AtCoder 329 solutions.

Author: mitkonikov

AtCoder/A_Spread.cpp

@@ -0,0 +1,15 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+int main() {
+    string S;
+    cin >> S;
+    for (int i = 0; i < S.size(); i++) {
+        cout << S[i] << " ";
+    }
+    cout << endl;
+    return 0;
+}

AtCoder/B_Next.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+int main() {
+    int N;
+    cin >> N;
+    set<int> A;
+    for (int i = 0; i < N; i++) {
+        int X;
+        cin >> X;
+        A.insert(X);
+    }
+    cout << *prev(prev(A.end())) << endl;
+    return 0;
+}

AtCoder/C_Count_xxx.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+int main() {
+    int N;
+    cin >> N;
+    string S;
+    cin >> S;
+    vector<int> longest(26, 0);
+    int block = 1;
+    for (int i = 0; i < N; i++) {
+        if (i && S[i] == S[i-1]) {
+            block++;
+        } else {
+            block = 1;
+        }
+        longest[S[i] - 'a'] = max(longest[S[i] - 'a'], block);
+    }
+    int ans = 0;
+    for (int i = 0; i < 26; i++) {
+        ans += longest[i];
+    }
+    cout << ans << endl;
+    return 0;
+}

AtCoder/D_Election_Quick_Report.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+int main() {
+    int N, M;
+    cin >> N >> M;
+    vector<int> votes(N);
+    priority_queue<pair<int, int>> pq;
+    for (int i = 0; i < M; i++) {
+        int C;
+        cin >> C;
+        C--;
+        votes[C]++;
+        pq.push({ votes[C], -C });
+        auto [votes, c] = pq.top();
+        cout << -c + 1 << endl;
+    }
+    return 0;
+}

AtCoder/E_Stamp.cpp

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+int main() {
+    int N, M;
+    cin >> N >> M;
+    string S, T;
+    cin >> S >> T;
+
+    vector<vector<int>> dp(N + 1, vector<int>(2, 0));
+    for (int i = 0; i < N - M + 1; i++) {
+        int l = 0;
+        for (int j = 0; j < M; j++) {
+            if (S[i+j] == T[j]) l++;
+            else break;
+        }
+        
+        if (i == 0 || dp[i-1][0]) for (int k = 0; k < l; k++) dp[i+k][0] = max(dp[i+k][0], k+1);
+        if ((i == 0 || dp[i-1][0] || dp[i-1][1]) && l == M) {
+            dp[i][1] = 1;
+        }
+
+        for (int j = 1; j < M; j++) {
+            int last = i + j - M;
+            if (last >= 0 && (dp[last][1] || dp[i+j-1][0] == M)) {
+                for (int k = j; k < M; k++) {
+                    if (S[i+k] == T[k]) {
+                        dp[i+k][0] = max(dp[i+k][0], k+1);
+                    } else {
+                        break;
+                    }
+                }
+            }
+        }
+    }
+    cout << ((dp[N-1][0] == M || dp[N-M][1]) ? "Yes" : "No") << endl;
+    return 0;
+}

MergeSmallToLarge/AtCoder - F_Colored_Ball.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+#define ll long long
+#define endl '\n'
+
+using namespace std;
+
+int main() {
+    int N, Q;
+    cin >> N >> Q;
+    vector<set<int>> boxes(N);
+    for (int i = 0; i < N; i++) {
+        int X;
+        cin >> X;
+        boxes[i].insert(X);
+    }
+    for (int i = 0; i < Q; i++) {
+        int a, b;
+        cin >> a >> b;
+        a--; b--;
+        if (boxes[a].size() > boxes[b].size()) {
+            boxes[a].swap(boxes[b]);
+        }
+        for (auto el: boxes[a]) {
+            boxes[b].insert(el);
+        }
+        boxes[a].clear();
+        cout << boxes[b].size() << endl;
+    }
+    return 0;
+}

README.md

@@ -1,6 +1,6 @@
 # Competitive Programming Problems and Solutions
 
-![](https://img.shields.io/static/v1?label=Solutions&message=1157&color=brightgreen)
+![](https://img.shields.io/static/v1?label=Solutions&message=1163&color=brightgreen)
 
 This repository is meant as a public place to store my competitive programming solutions to various of competitive programming problems on sites such as:
  - CodeForces