codeforces educational round

Author: Pankajcoder1

Codeforces/After Placement/1204B-Mislove Has Lost an Array.cpp

@@ -0,0 +1,34 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n, l, r;
+    cin >> n >> l >> r;
+    int mini = 0, maxo = 0;
+    int t = 1;
+    for (int x = 1; x <= l; x++){
+        mini += t, t *= 2;
+    }
+    mini += (n - l);
+    t=1;
+    for(int x = 1; x <= r; x++){
+        maxo += t, t *= 2;
+    }
+    maxo += (n - r) * t / 2;
+    cout << mini << " " << maxo << endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1793A-Yet Another Promotion.cpp

@@ -0,0 +1,41 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    long long a,b,n,m;
+    cin>>a>>b>>n>>m;
+    if(n<=m){
+        cout<<n*min(a,b)<<endl;
+        return 0;
+    }
+
+    if((m*a)<=(m+1)*b){
+        long long temp1=n/(m+1);
+        long long temp2=n%(m+1);
+        long long temp3=temp1*m*a;
+        // cout<<"temp1 is "<<temp1<<endl;
+        // cout<<"temp2 is "<<temp2<<endl;
+        // cout<<"temp3 is "<<temp3<<endl;
+        temp3+=temp2*min(a,b);
+        cout<<temp3<<endl;
+    }
+    else{
+        cout<<n*b<<endl;   
+    }
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1795A-Two Towers.cpp

@@ -0,0 +1,65 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n,m;
+    cin>>n>>m;
+    string s1="", s2="";
+    string temp="";
+    bool flag=true;
+    cin>>s1>>s2;
+    for(int i=0;i+1<n;i++){
+        if(s1[i]==s1[i+1]){
+            temp=s1.substr(i+1,n);
+            // cout<<"temp is "<<temp<<endl;
+            flag=false;
+            break;
+        }
+    }
+    if(!flag){
+        reverse(temp.begin(),temp.end());
+        s2+=temp;
+        for(int i=0;i+1<s2.size();i++){
+            if(s2[i]==s2[i+1]){
+                cout<<"NO"<<endl;
+                return 0;
+            }
+        }
+    }
+    temp="";
+    flag=true;
+    for(int i=0;i+1<m;i++){
+        if(s2[i]==s2[i+1]){
+            temp=s2.substr(i+1,m);
+            flag=false;
+            break;
+        }
+    }
+    if(!flag){
+        reverse(temp.begin(),temp.end());
+        s1+=temp;
+        for(int i=0;i+1<s1.size();i++){
+            if(s1[i]==s1[i+1]){
+                cout<<"NO"<<endl;
+                return 0;
+            }
+        }
+    }
+    cout<<"YES"<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1795B-Ideal Point.cpp

@@ -0,0 +1,58 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n,k;
+    cin>>n>>k;
+    vector<pair<int,int>> v(n);
+    map<int,int> m;
+    int countOfMaxo=0;
+    for(int i=0;i<n;i++){
+        cin>>v[i].first>>v[i].second;
+        for(int j=v[i].first;j<=v[i].second;j++){
+            m[j]++;
+        }
+    }
+    // cout<<"k frequency is "<<m[k]<<endl;
+    bool flag=true;
+    for(int i=1;i<=50;i++){
+        if(i!=k && m[i]>=m[k]){
+            flag=false;
+            int count=0;
+            for(auto x:v){
+                if(x.second>=i && x.first<=i && (x.second<k || x.first>k)){
+                    count++;
+                }
+            }
+            if(count>=(m[i]-m[k]+1)){
+                flag=true;
+            }
+            else{
+                flag=false;
+                break;
+            }
+        }
+    }    
+    if(flag){
+        cout<<"YES"<<endl;
+    }
+    else{
+        cout<<"NO"<<endl;
+    }
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}