cses corting and searching

Author: Pankajcoder1

CSES/Sorting_and_Searching/Movie_Festival.cpp

@@ -1,184 +1,51 @@
 /*
 	written by Pankaj Kumar.
 	country:-INDIA
-	Institute: National Institute of Technology, Uttarakhand
 */
 #include <bits/stdc++.h>
-#include <ext/pb_ds/assoc_container.hpp>
-#include <ext/pb_ds/tree_policy.hpp>
 using namespace std;
-using namespace __gnu_pbds;
-typedef long long ll ;
-typedef vector<ll> vl;
-typedef vector<vector<ll>> vvl;
-#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
-/*  Abbrevations  */
-#define ff first
-#define ss second
-#define mp make_pair
-#define line cout<<endl;
-#define pb push_back
-// loops
-#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
-// Some print
-#define no cout<<"NO"<<endl;
-#define yes cout<<"YES"<<endl;
-// sort
-#define all(V) (V).begin(),(V).end()
-#define srt(V) sort(all(V))
-#define srtGreat(V) sort(all(V),greater<ll>())
-// some extra
-#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} line;
-#define precision(x) cout<<fixed<<setprecision(x);
-#define sz(V) ll(V.size())
-// datatype definination
-#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
- 
- 
-ll ppow(ll n, ll m, ll mod){
-	if(m==0) return 1;
-	ll tmp=ppow(n, m/2, mod);
-	tmp=tmp*tmp%mod;
-	return m%2 ? tmp*n%mod: tmp;
-}
-namespace mod_operations{
-	ll modInv(ll n, ll mod){
-		return ppow(n,mod-2, mod);
-	}
-	ll modAdd(ll n, ll m, ll mod){
-		n=(n%mod+mod)%mod; m=(m%mod+mod)%mod;
-		return (n+m)%mod;
-	}
-	ll modMul(ll n, ll m, ll mod){
-		n=(n%mod+mod)%mod; m=(m%mod+mod)%mod;
-		return n*m %mod;
-	}
-	ll modSub(ll n, ll m, ll mod){
-		n=(n%mod+mod)%mod; m=(m%mod+mod)%mod;
-		return modAdd(n,-m, mod);
-	}
-	ll modDiv(ll n, ll m, ll mod){
-		return modMul(n, modInv(m, mod), mod);
+typedef long long ll;
+
+
+int solve(){
+	ll n;
+	cin >> n;
+	vector<pair<ll, ll>> t(n);
+	for (ll i = 0; i < n; i++)
+	{
+		cin >> t[i].first >> t[i].second;
 	}
-}
-using namespace mod_operations;
- 
- 
-class Atcoder
-{
-	private:
-		// read only variable
-		const ll INF=1e18;
-		const ll mod1=1e9+7;
-		const ll mod2=998244353;
- 
- 
-	public:
-		Atcoder(){
- 
-		}
- 
-		ll power(ll x,ll y){
-			ll result=1;
-			while(y>0){
-				if(y&1){
-					result*=x;
-				}
-				y>>=1;
-				x*=x;
-			}
-			return result;
-		}
- 
-		ll power(ll x,ll y,ll mod){
-			ll result=1;
-			x%=mod;
-			while(y>0){
-				if(y&1){
-					result*=x;
-					result%=mod;
-				}
-				y>>=1;
-				x*=x;
-				x%=mod;
-			}
-			return result;
-		}
- 
-		ll str_to_num(string s)
-		{
-			stringstream pk(s);
-			ll num;
-			pk>>num;
-			return num;
-		}
- 
-		string num_to_str(ll num)
+	sort(t.begin(),t.end());
+
+	ll ans = 0, current = 0;
+	for (ll i = 0; i < n; i++)
+	{
+		if (i == 0)
 		{
-			return to_string(num);
+			current = t[i].second;
+			ans++;
 		}
-		// Techniques :
-		// divide into cases, brute force, pattern finding
-		// sort, greedy, binary search, two pointer
-		// transform into graph
- 
-		// Experience :
-		// Cp is nothing but only observation and mathematics.
-		ll solve()
+		else
 		{
-			ll n;
-			cin>>n;
-			vector<pair<ll,ll>> t(n);
-			for(ll i=0;i<n;i++){
-				cin>>t[i].ff>>t[i].ss;
+			if (t[i].first >= current)
+			{
+				current = t[i].second;
+				ans++;
 			}
-			srt(t);
-            
-			ll ans=0,maxo=0,current=0;
-			for(ll i=0;i<n;i++){
-				if(i==0){
-					current=t[i].ss;
-					ans++;
-				}
-				else{
-					if(t[i].ff>=current){
-						current=t[i].ss;
-						ans++;
-					}
-					else{
-						current=min(current,t[i].ss);
-					}
-				}
-				maxo=max(maxo,ans);
+			else
+			{
+				current = min(current, t[i].second);
 			}
-			cout<<ans<<endl;
-			return 0;
 		}
-};
- 
- 
-/*  --------------------MAIN PROGRAM----------------------------*/
- 
+	}
+	cout << ans << endl;
+	return 0;
+}
 int main()
 {
-	speed;
-	/* #ifndef ONLINE_JUDGE
-		freopen("input.txt","r",stdin);
-		freopen("output.txt","w",stdout);
-	#endif */
-	ll TestCase=1;
-	// cin>>TestCase;;
-	while(TestCase--)
-	{
-		Atcoder at;
-		at.solve();
+	int testCase=1;
+	while(testCase--){
+		solve();
 	}
-}
-/* -----------------END OF PROGRAM --------------------*/
-/*
-* stuff you should look before submission
-* constraint and time limit
-* int overflow
-* special test case (n=0||n=1||n=2)
-* don't get stuck on one approach if you get wrong answer
-*/
+	return 0;
+}

CSES/Sorting_and_Searching/maximum_subarray_sum.cpp

@@ -4,84 +4,33 @@
 */
 #include <bits/stdc++.h>
 using namespace std;
-typedef long long ll ;
-typedef set<pair<int,int>> spi;
-typedef set<pair<ll,ll>> spl;
-typedef vector<pair<int,int>> vpi;
-typedef vector<int> vi;
-typedef vector<ll> vl;
-typedef vector<bool> vb;
-typedef vector<char> vc;
-typedef vector<pair<ll,ll>> vpl;
-typedef vector<string> vs;
-typedef map<int,int>mi;
-typedef map<ll,ll> ml;
-typedef set<string> ss;
-typedef set<char>sc;
-typedef set<int> si;
-typedef set<ll> sl;
-#define pan cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
-// define values.
-#define mod 1000000007
-#define phi 1.618
-/* Bit-Stuff */
-#define get_set_bits(a) (__builtin_popcount(a))
-#define get_set_bitsll(a) ( __builtin_popcountll(a))
-#define get_trail_zero(a) (__builtin_ctz(a))
-#define get_lead_zero(a) (__builtin_clz(a))
-#define get_parity(a) (__builtin_parity(a))
-/*  Abbrevations  */
-#define ff first
-#define ss second
-#define mp make_pair
-#define line cout<<endl;
-#define pb push_back
-#define Endl "\n"
-// loops
-#define loop(i,start,end) for(ll i=ll(start);i<ll(end);i++)
-#define loop0(num) for(ll i=0;i<ll(num);i++)
-#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
-// Some print
-#define no cout<<"NO"<<endl;
-#define yes cout<<"YES"<<endl;
-#define cc ll test;cin>>test;while(test--)
-// sort
-#define all(V) (V).begin(),(V).end()
-#define srt(V) sort(all(V))
-#define srtGreat(V) sort(all(V),greater<ll>())
-// function
+typedef long long ll;
 
-ll power(ll x,ll y)
-{
-	ll res=1;
-	while(y>0)
+
+int solve(){
+	ll n;
+	cin >> n;
+	vector<int> v(n);
+	for(int i=0;i<n;i++){
+		cin>>v[i];
+	}
+	ll temp_sum = 0, max_sum = INT_MIN;
+	for(int i=0;i<n;i++)
 	{
-		if(y%2==1)res*=x;
-		y/=2; x*=x;
+		temp_sum += v[i];
+		if (temp_sum > max_sum)
+			max_sum = temp_sum;
+		if (temp_sum < 0)
+			temp_sum = 0;
 	}
-	return res;
+	cout << max_sum << endl;
+	return 0;
 }
-/* ascii value 
-A=65,Z=90,a=97,z=122
-*/
-/*  -----------------------------------------------------------------------------------*/
-
-
 int main()
 {
-	pan
-	ll n;
-	cin>>n;
-	vl v(n,0);
-	forin(v,n);
-	ll temp_sum=0,max_sum=INT_MIN;
-	loop(i,0,n)
-	{
-		temp_sum+=v[i];
-		if(temp_sum>max_sum)
-			max_sum=temp_sum;
-		if(temp_sum<0)
-			temp_sum=0;
+	int testCase=1;
+	while(testCase--){
+		solve();
 	}
-	cout<<max_sum<<endl;
+	return 0;
 }