line endings changed

Author: mrsac7

src/1086 - Writing Numbers.cpp

@@ -1,6 +1,40 @@
-/*
-Problem Name: Writing Numbers
-Problem Link: https://cses.fi/problemset/task/1086
-Author: Sachin Srivastava (mrsac7)
-*/
-#include<bits/stdc++.h>using namespace std;#define int long long#define endl '\n'bool check(int n, int k) {    int ans = 0;    for (int i = 1; i <= n; i*=10) {        int d = i*10;        ans += n/d*i + min(max(n%d-i+1,0LL), i);    }    if (ans <= k) return 1;    return 0;}   signed main(){    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);    #ifdef LOCAL    freopen("input.txt", "r" , stdin);    freopen("output.txt", "w", stdout);    #endif        int k; cin>>k;    int l = 1, h = 6e17;    int ans = 1;    while(l <= h ) {        int m = (l+h)/2;        if (check(m, k)) {            ans = m;            l = m + 1;        }        else h = m - 1;    }    cout<<ans;}
+/*
+Problem Name: Writing Numbers
+Problem Link: https://cses.fi/problemset/task/1086
+Author: Sachin Srivastava (mrsac7)
+*/
+#include<bits/stdc++.h>
+using namespace std;
+
+#define int long long
+#define endl '\n'
+
+bool check(int n, int k) {
+    int ans = 0;
+    for (int i = 1; i <= n; i*=10) {
+        int d = i*10;
+        ans += n/d*i + min(max(n%d-i+1,0LL), i);
+    }
+    if (ans <= k) return 1;
+    return 0;
+}   
+signed main(){
+    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
+    #ifdef LOCAL
+    freopen("input.txt", "r" , stdin);
+    freopen("output.txt", "w", stdout);
+    #endif
+    
+    int k; cin>>k;
+    int l = 1, h = 6e17;
+    int ans = 1;
+    while(l <= h ) {
+        int m = (l+h)/2;
+        if (check(m, k)) {
+            ans = m;
+            l = m + 1;
+        }
+        else h = m - 1;
+    }
+    cout<<ans;
+}

src/1087 - Shortest Subsequence.cpp

@@ -1,6 +1,46 @@
-/*
-Problem Name: Shortest Subsequence
-Problem Link: https://cses.fi/problemset/task/1087
-Author: Sachin Srivastava (mrsac7)
-*/
-#include<bits/stdc++.h>using namespace std;// #define int long long#define endl '\n'signed main(){    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);    #ifdef LOCAL    freopen("input.txt", "r" , stdin);    freopen("output.txt", "w", stdout);    #endif        string s; cin>>s;    int l = 0, r = 0;    bool a = 0, b = 0, c = 0, d = 0;    int n = s.size();    string ans;    while(l < n) {        a = 0, b = 0, c = 0, d = 0;        a += (s[l] == 'A'); b += (s[l] == 'C');        c += (s[l] == 'G'); d += (s[l] == 'T');        r = l+1;        while(r < n && a+b+c+d != 4) {            a += (s[r] == 'A'); b += (s[r] == 'C');            c += (s[r] == 'G'); d += (s[r] == 'T');            r++;        }        if (a+b+c+d == 4)            ans += s[r-1];        l = r;    }    cerr<<a<<' '<<b<<' '<<c<<' '<<d;    if (a+b+c+d == 4)        ans += 'A';    else if (!a) ans += 'A';    else if (!b) ans += 'C';    else if (!c) ans += 'G';    else if (!d) ans += 'T';    cout<<ans;}
+/*
+Problem Name: Shortest Subsequence
+Problem Link: https://cses.fi/problemset/task/1087
+Author: Sachin Srivastava (mrsac7)
+*/
+#include<bits/stdc++.h>
+using namespace std;
+
+// #define int long long
+#define endl '\n'
+
+signed main(){
+    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
+    #ifdef LOCAL
+    freopen("input.txt", "r" , stdin);
+    freopen("output.txt", "w", stdout);
+    #endif
+    
+    string s; cin>>s;
+    int l = 0, r = 0;
+    bool a = 0, b = 0, c = 0, d = 0;
+    int n = s.size();
+    string ans;
+    while(l < n) {
+        a = 0, b = 0, c = 0, d = 0;
+        a += (s[l] == 'A'); b += (s[l] == 'C');
+        c += (s[l] == 'G'); d += (s[l] == 'T');
+        r = l+1;
+        while(r < n && a+b+c+d != 4) {
+            a += (s[r] == 'A'); b += (s[r] == 'C');
+            c += (s[r] == 'G'); d += (s[r] == 'T');
+            r++;
+        }
+        if (a+b+c+d == 4)
+            ans += s[r-1];
+        l = r;
+    }
+    cerr<<a<<' '<<b<<' '<<c<<' '<<d;
+    if (a+b+c+d == 4)
+        ans += 'A';
+    else if (!a) ans += 'A';
+    else if (!b) ans += 'C';
+    else if (!c) ans += 'G';
+    else if (!d) ans += 'T';
+    cout<<ans;
+}

src/1134 - Prüfer Code.cpp

@@ -1,6 +1,39 @@
-/*
-Problem Name: Prüfer Code
-Problem Link: https://cses.fi/problemset/task/1134
-Author: Sachin Srivastava (mrsac7)
-*/
-#include<bits/stdc++.h>using namespace std;#define int long long#define endl '\n'signed main(){    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);    #ifdef LOCAL    freopen("input.txt", "r" , stdin);    freopen("output.txt", "w", stdout);    #endif        int n; cin>>n;    vector<int> v(n-2);    set<int> s;    for (int i = 1; i <= n; i++)        s.insert(i);    int a[n+1] = {0};    for (auto &i: v) {        cin>>i;        a[i]++;        if (s.count(i))            s.erase(i);    }    for (int i = 0; i < n-2; i++) {        int x = *s.begin();        s.erase(x);        cout<<x<<' '<<v[i]<<endl;        a[v[i]]--;        if (a[v[i]] == 0) s.insert(v[i]);    }    cout<<*s.begin()<<' '<<*s.rbegin();}
+/*
+Problem Name: Prüfer Code
+Problem Link: https://cses.fi/problemset/task/1134
+Author: Sachin Srivastava (mrsac7)
+*/
+#include<bits/stdc++.h>
+using namespace std;
+
+#define int long long
+#define endl '\n'
+
+signed main(){
+    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
+    #ifdef LOCAL
+    freopen("input.txt", "r" , stdin);
+    freopen("output.txt", "w", stdout);
+    #endif
+    
+    int n; cin>>n;
+    vector<int> v(n-2);
+    set<int> s;
+    for (int i = 1; i <= n; i++)
+        s.insert(i);
+    int a[n+1] = {0};
+    for (auto &i: v) {
+        cin>>i;
+        a[i]++;
+        if (s.count(i))
+            s.erase(i);
+    }
+    for (int i = 0; i < n-2; i++) {
+        int x = *s.begin();
+        s.erase(x);
+        cout<<x<<' '<<v[i]<<endl;
+        a[v[i]]--;
+        if (a[v[i]] == 0) s.insert(v[i]);
+    }
+    cout<<*s.begin()<<' '<<*s.rbegin();
+}

src/1142 - Advertisement.cpp

@@ -1,6 +1,48 @@
-/*
-Problem Name: Advertisement
-Problem Link: https://cses.fi/problemset/task/1142
-Author: Sachin Srivastava (mrsac7)
-*/
-#include<bits/stdc++.h>using namespace std;#define int long long#define endl '\n'signed main(){    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);    #ifdef LOCAL    freopen("input.txt", "r" , stdin);    freopen("output.txt", "w", stdout);    #endif        int n; cin>>n;    int pre[n] = {0}, suf[n+1] = {0}, a[n];    int ans = 0;    stack<pair<int, int>> q;    for (int i = 0; i < n; i++) {        cin>>a[i];        while(!q.empty() && q.top().first >= a[i])            q.pop();        int x = -1;        if (!q.empty()) {            x = q.top().second;        }        pre[i] = 1 + i-x-1;        q.push({a[i], i});    }    while(!q.empty()) q.pop();    for (int i = n-1; i >= 0; i--) {        while(!q.empty() && q.top().first >= a[i])            q.pop();        int x = n;        if (!q.empty()) {            x = q.top().second;        }        suf[i] = 1 + x-i-1;        q.push({a[i], i});        ans = max(ans, (pre[i]+suf[i]-1)*a[i]);    }    cout<<ans;}
+/*
+Problem Name: Advertisement
+Problem Link: https://cses.fi/problemset/task/1142
+Author: Sachin Srivastava (mrsac7)
+*/
+#include<bits/stdc++.h>
+using namespace std;
+
+#define int long long
+#define endl '\n'
+
+signed main(){
+    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
+    #ifdef LOCAL
+    freopen("input.txt", "r" , stdin);
+    freopen("output.txt", "w", stdout);
+    #endif
+    
+    int n; cin>>n;
+    int pre[n] = {0}, suf[n+1] = {0}, a[n];
+    int ans = 0;
+    stack<pair<int, int>> q;
+    for (int i = 0; i < n; i++) {
+        cin>>a[i];
+        while(!q.empty() && q.top().first >= a[i])
+            q.pop();
+        int x = -1;
+        if (!q.empty()) {
+            x = q.top().second;
+        }
+        pre[i] = 1 + i-x-1;
+        q.push({a[i], i});
+    }
+    while(!q.empty()) q.pop();
+
+    for (int i = n-1; i >= 0; i--) {
+        while(!q.empty() && q.top().first >= a[i])
+            q.pop();
+        int x = n;
+        if (!q.empty()) {
+            x = q.top().second;
+        }
+        suf[i] = 1 + x-i-1;
+        q.push({a[i], i});
+        ans = max(ans, (pre[i]+suf[i]-1)*a[i]);
+    }
+    cout<<ans;
+}

src/1146 - Counting Bits.cpp

@@ -1,6 +1,33 @@
-/*
-Problem Name: Counting Bits
-Problem Link: https://cses.fi/problemset/task/1146
-Author: Sachin Srivastava (mrsac7)
-*/
-#include<bits/stdc++.h>using namespace std;#define int long long#define endl '\n'signed main(){    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);    #ifdef LOCAL    freopen("input.txt", "r" , stdin);    freopen("output.txt", "w", stdout);    #endif        int n; cin>>n;    int dp[50] = {0};    dp[0] = 1;    for (int i = 1; i < 50; i++)         dp[i] = 2*dp[i-1] + ((1LL<<(i-1)) - 1);    int ans = 0;    while(n>0) {        int b = log2(n);        ans += dp[b];        b = 1LL<<b;        ans += n - b;        n = n - b;    }    cout<<ans;}
+/*
+Problem Name: Counting Bits
+Problem Link: https://cses.fi/problemset/task/1146
+Author: Sachin Srivastava (mrsac7)
+*/
+#include<bits/stdc++.h>
+using namespace std;
+
+#define int long long
+#define endl '\n'
+
+signed main(){
+    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
+    #ifdef LOCAL
+    freopen("input.txt", "r" , stdin);
+    freopen("output.txt", "w", stdout);
+    #endif
+    
+    int n; cin>>n;
+    int dp[50] = {0};
+    dp[0] = 1;
+    for (int i = 1; i < 50; i++) 
+        dp[i] = 2*dp[i-1] + ((1LL<<(i-1)) - 1);
+    int ans = 0;
+    while(n>0) {
+        int b = log2(n);
+        ans += dp[b];
+        b = 1LL<<b;
+        ans += n - b;
+        n = n - b;
+    }
+    cout<<ans;
+}

src/1149 - String Removals.cpp

@@ -1,6 +1,36 @@
-/*
-Problem Name: String Removals
-Problem Link: https://cses.fi/problemset/task/1149
-Author: Sachin Srivastava (mrsac7)
-*/
-#include<bits/stdc++.h>using namespace std;#define int long long#define endl '\n'const int mxN = 500005;const int md = 1e9+7;int dp[mxN];int ind[26];signed main(){    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);    #ifdef LOCAL    freopen("input.txt", "r" , stdin);    freopen("output.txt", "w", stdout);    #endif        string s; cin>>s;    int n = s.size();    memset(ind, -1, sizeof ind);    dp[0] = 1;    for (int i = 1; i <= n; i++) {        dp[i] = 2*dp[i-1];        if (ind[s[i-1]-'a'] >= 0)            dp[i] -= dp[ind[s[i-1]-'a']];        dp[i] = (dp[i] + md)%md;        ind[s[i-1]-'a'] = i-1;    }    cout<<(dp[n]-1+md)%md;}
+/*
+Problem Name: String Removals
+Problem Link: https://cses.fi/problemset/task/1149
+Author: Sachin Srivastava (mrsac7)
+*/
+#include<bits/stdc++.h>
+using namespace std;
+
+#define int long long
+#define endl '\n'
+
+const int mxN = 500005;
+const int md = 1e9+7;
+int dp[mxN];
+int ind[26];
+signed main(){
+    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
+    #ifdef LOCAL
+    freopen("input.txt", "r" , stdin);
+    freopen("output.txt", "w", stdout);
+    #endif
+    
+    string s; cin>>s;
+    int n = s.size();
+    memset(ind, -1, sizeof ind);
+    dp[0] = 1;
+    for (int i = 1; i <= n; i++) {
+        dp[i] = 2*dp[i-1];
+        if (ind[s[i-1]-'a'] >= 0)
+            dp[i] -= dp[ind[s[i-1]-'a']];
+
+        dp[i] = (dp[i] + md)%md;
+        ind[s[i-1]-'a'] = i-1;
+    }
+    cout<<(dp[n]-1+md)%md;
+}

src/1157 - Number Grid.cpp

@@ -1,6 +1,21 @@
-/*
-Problem Name: Number Grid
-Problem Link: https://cses.fi/problemset/task/1157
-Author: Sachin Srivastava (mrsac7)
-*/
-#include<bits/stdc++.h>using namespace std;#define int long long#define endl '\n'signed main(){    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);    #ifdef LOCAL    freopen("input.txt", "r" , stdin);    freopen("output.txt", "w", stdout);    #endif        int x,y; cin>>x>>y;    cout<<((x-1)^(y-1));}
+/*
+Problem Name: Number Grid
+Problem Link: https://cses.fi/problemset/task/1157
+Author: Sachin Srivastava (mrsac7)
+*/
+#include<bits/stdc++.h>
+using namespace std;
+
+#define int long long
+#define endl '\n'
+
+signed main(){
+    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
+    #ifdef LOCAL
+    freopen("input.txt", "r" , stdin);
+    freopen("output.txt", "w", stdout);
+    #endif
+    
+    int x,y; cin>>x>>y;
+    cout<<((x-1)^(y-1));
+}

src/1159 - Book Shop II.cpp

@@ -1,6 +1,51 @@
-/*
-Problem Name: Book Shop II
-Problem Link: https://cses.fi/problemset/task/1159
-Author: Sachin Srivastava (mrsac7)
-*/
-#include<bits/stdc++.h>using namespace std;#define int long long#define endl '\n'int dp[100005];signed main(){    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);    #ifdef LOCAL    freopen("input.txt", "r" , stdin);    freopen("output.txt", "w", stdout);    #endif        int n, x; cin>>n>>x;    vector<int> cost;    vector<int> val;    int a[n], b[n], c[n];    for (int i = 0; i < n; i++)        cin>>a[i];    for (int i = 0; i < n; i++)        cin>>c[i];    // converstion to 0-1 knapsack    for (int i = 0; i < n; i++) {        cin>>b[i];        int x = 1;        while(b[i] - x >=0) {            cost.push_back(x*a[i]);            val.push_back(x*c[i]);            b[i] -= x;            x*=2;        }        if (b[i]) {            cost.push_back(b[i]*a[i]);            val.push_back(b[i]*c[i]);        }    }    n = cost.size();    for (int i = 0; i < n; i++) {        for (int j = x; j >0; j--) {            if (j >= cost[i])                dp[j] = max(dp[j], val[i] + dp[j-cost[i]]);        }    }    cout<<dp[x];}
+/*
+Problem Name: Book Shop II
+Problem Link: https://cses.fi/problemset/task/1159
+Author: Sachin Srivastava (mrsac7)
+*/
+#include<bits/stdc++.h>
+using namespace std;
+
+#define int long long
+#define endl '\n'
+
+int dp[100005];
+signed main(){
+    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
+    #ifdef LOCAL
+    freopen("input.txt", "r" , stdin);
+    freopen("output.txt", "w", stdout);
+    #endif
+    
+    int n, x; cin>>n>>x;
+    vector<int> cost;
+    vector<int> val;
+    int a[n], b[n], c[n];
+    for (int i = 0; i < n; i++)
+        cin>>a[i];
+    for (int i = 0; i < n; i++)
+        cin>>c[i];
+    // converstion to 0-1 knapsack
+    for (int i = 0; i < n; i++) {
+        cin>>b[i];
+        int x = 1;
+        while(b[i] - x >=0) {
+            cost.push_back(x*a[i]);
+            val.push_back(x*c[i]);
+            b[i] -= x;
+            x*=2;
+        }
+        if (b[i]) {
+            cost.push_back(b[i]*a[i]);
+            val.push_back(b[i]*c[i]);
+        }
+    }
+    n = cost.size();
+    for (int i = 0; i < n; i++) {
+        for (int j = x; j >0; j--) {
+            if (j >= cost[i])
+                dp[j] = max(dp[j], val[i] + dp[j-cost[i]]);
+        }
+    }
+    cout<<dp[x];
+}