Add a bunch of other problems.

Some are not finished...

Codeforces Round 1032 (Div. 3)/A. Letter Home.cpp

@@ -0,0 +1,98 @@
+/* Problem URL: https://codeforces.com/contest/2121/problem/A */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        int n, s;
+        cin >> n >> s;
+
+        vi fds(n);
+        cin >> fds;
+
+        if (fds.back() <= s) {
+            cout << s - fds[0] << '\n';
+            continue;
+        }
+
+        if (fds[0] >= s) {
+            cout << fds.back() - s << '\n';
+            continue;
+        }
+
+        cout << min(abs(fds[0] - s) + abs(fds.back() - s) * 2, abs(fds.back() - s) + abs(fds[0] - s) * 2) << '\n';
+    }
+}

Codeforces Round 1032 (Div. 3)/B. Above the Clouds.cpp

@@ -0,0 +1,102 @@
+/* Problem URL: https://codeforces.com/contest/2121/problem/B */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    
+    while (t--) {
+        int n;
+        cin >> n;
+
+        string s;
+        cin >> s;
+
+        vi count(26);
+        rep(i, n) {
+            count[s[i] - 'a']++;
+        }
+
+        bool pos = false;
+        nrep(i, 1, n - 1) {
+            if (count[s[i] - 'a'] > 1) {
+                pos = true;
+                break;
+            }
+        }
+
+        cout << (pos ? "Yes\n" : "No\n");
+    }
+}

Codeforces Round 1032 (Div. 3)/C. Those Who Are With Us.cpp

@@ -0,0 +1,140 @@
+/* Problem URL: https://codeforces.com/contest/2121/problem/C */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        int n, m;
+        cin >> n >> m;
+
+        vvi fds(n, vi(m));
+        cin >> fds;
+
+        V<V<pair<int, int>>> count(101);
+
+        rep(i, n) {
+            rep(j, m) {
+                count[fds[i][j]].emplace_back(i, j);
+            }
+        }
+
+        int i = 100;
+        while (count[i].empty()) {
+            i--;
+        }
+
+        bool pos = true;
+        map<int, int> countsi;
+        int maximal = 0;
+        int choice = 0;
+
+        bool byj = false;
+        
+        rep(j, count[i].size()) {
+            countsi[count[i][j].first]++;
+            if (countsi[count[i][j].first] > maximal) {
+                maximal = countsi[count[i][j].first];
+                choice = count[i][j].first;
+            }
+        }
+
+        map<int, int> countsj;
+
+        rep(j, count[i].size()) {
+            countsj[count[i][j].second]++;
+            if (countsj[count[i][j].second] > maximal) {
+                maximal = countsj[count[i][j].second];
+                choice = count[i][j].second;
+                byj = true;
+            }
+        }
+
+
+        set<int> c;
+        for (int j = 0; j < count[i].size(); j++) {
+            if ((!byj && count[i][j].first == choice) || (byj && count[i][j].second == choice)) {
+                continue;
+            }
+            c.insert(byj ? count[i][j].first : count[i][j].second);
+        }
+
+        if (c.size() < 2) {
+            cout << i - 1 << '\n';
+        } else {
+            cout << i << '\n';
+        }
+    }
+}

Codeforces Round 1032 (Div. 3)/D. 1709.cpp

@@ -0,0 +1,118 @@
+/* Problem URL: https://codeforces.com/contest/2121/problem/D */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        int n;
+        cin >> n;
+
+        vvi fds(2, vi(n));
+
+        rep(i, 2) {
+            rep(j, n) {
+                cin >> fds[i][j];
+            }
+        }
+
+        V<pair<int, int>> ops;
+
+        for (int j = n - 1; j > 0; j--) {
+            rep(i, j) {
+                if (fds[0][i] > fds[0][i + 1]) {
+                    ops.emplace_back(1, i + 1);
+                    swap(fds[0][i], fds[0][i + 1]);
+                }
+
+                if (fds[1][i] > fds[1][i + 1]) {
+                    ops.emplace_back(2, i + 1);
+                    swap(fds[1][i], fds[1][i + 1]);
+                }
+            }
+        }
+
+        rep(i, n) {
+            if (fds[0][i] > fds[1][i]) {
+                ops.emplace_back(3, i + 1);
+            }
+        }
+
+        cout << ops.size() << '\n';
+        for (auto [op, p] : ops) {
+            cout << op << ' ' << p << '\n';
+        }
+    }
+}

Codeforces Round 1032 (Div. 3)/E. Sponsor of Your Problems.cpp

@@ -0,0 +1,107 @@
+/* Problem URL: https://codeforces.com/contest/2121/problem/E */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+
+    while (t--) {
+        string l, r;
+        cin >> l >> r;
+
+        vvvi memo(l.size(), vvi(2, vi(2, -1)));
+
+        function<int(int, int, int)> dp = [&](int i, int under, int over) {
+            if (i == l.size()) {
+                return 0;
+            }
+            if (memo[i][under][over] != -1) {
+                return memo[i][under][over];
+            }
+
+            auto &ans = memo[i][under][over];
+            ans = INT32_MAX >> 1;
+
+            char limit = over ? '0' : l[i];
+            for (char itr = under ? '9' : r[i]; itr >= limit; itr--) {
+                rmin(ans, dp(i + 1, under || itr < r[i], over || itr > l[i]) + (itr == l[i]) + (itr == r[i]));
+            }
+
+            return ans;
+        };
+
+        cout << dp(0, 0, 0) << '\n';
+    }
+}

Codeforces Round 1032 (Div. 3)/F. Yamakasi.cpp

@@ -0,0 +1,118 @@
+/* Problem URL: https://codeforces.com/contest/2121/problem/F */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        ll n, s, x;
+        cin >> n >> s >> x;
+
+        vl fds(n);
+        cin >> fds;
+
+        map<ll, int> count;
+        map<ll, int> rem;
+        vl pref(n + 1);
+
+        rep(i, n) {
+            pref[i + 1] = pref[i] + fds[i];
+        }
+
+        ll ans = 0;
+
+        rep(i, n) {
+            if (fds[i] == x) {
+                count[pref[i]]++;
+                ans += count[pref[i + 1] - s];
+                rem.clear();
+                continue;
+            }
+
+
+            if (fds[i] > x) {
+                count.clear();
+                rem.clear();
+                continue;
+            }
+
+            ans += count[pref[i + 1] - s] - rem[pref[i + 1] - s];
+            count[pref[i]]++;
+            rem[pref[i]]++;
+        }
+
+        cout << ans << '\n';
+    }
+}