Add a bunch of other problems.

Some are not finished...

2022-2023 ICPC Brazil Subregional Programming Contest/A. Finding Maximal Non-Trivial Monotones.cpp

@@ -0,0 +1,96 @@
+/* Problem URL: https://codeforces.com/gym/103960/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 n;
+    string a;
+    cin >> n >> a;
+
+    int ans = 0;
+    int count = 0;
+    repv(i, a) {
+        if (i == 'b') {
+            ans += count >= 2 ? count : 0;
+            count = 0;
+            continue;
+        }
+
+        count++;
+    }
+
+    ans += count >= 2 ? count : 0;
+
+    cout << ans << '\n';
+}

2022-2023 ICPC Brazil Subregional Programming Contest/D. Displacing Particles.cpp

@@ -0,0 +1,108 @@
+/* Problem URL: https://codeforces.com/gym/103960/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 n, is, js;
+    cin >> n >> is >> js;
+
+    int inf = INT32_MAX >> 1;
+    vi dp(1 << n, inf);
+
+    auto bfs = [&]() {
+        queue<int> q;
+        
+        dp[1 << (n - 1)] = 0;
+        q.push(1 << (n - 1));
+
+        while (!q.empty()) {
+            int i = q.front();
+            q.pop();
+
+            if (dp[i >> 1] > dp[i] + 1) {
+                dp[i >> 1] = dp[i] + 1;
+                q.push(i >> 1);
+            }
+
+            if (dp[(i + (1 << n)) >> 1] > dp[i] + 1) {
+                dp[(i + (1 << n)) >> 1] = dp[i] + 1;
+                q.push((i + (1 << n)) >> 1);
+            }
+        }
+    };
+
+    bfs();
+
+    cout << dp[is] << '\n';
+}

2022-2023 ICPC Brazil Subregional Programming Contest/E. Eliminating Ballons.cpp

@@ -0,0 +1,99 @@
+/* Problem URL: https://codeforces.com/gym/103960/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 n;
+    cin >> n;
+
+    vi c(1e6 + 1, 0);
+
+    int ans = 0;
+
+    while (n--) {
+        int now;
+        cin >> now;
+
+        if (c[now] == 0) {
+            ans++;
+            c[now - 1]++;
+            continue;
+        }
+
+        c[now]--;
+        c[now - 1]++;
+    }
+
+    cout << ans << '\n';
+}

2022-2023 ICPC Brazil Subregional Programming Contest/F. Multidimensional Hangman.cpp

@@ -0,0 +1,150 @@
+/* Problem URL: https://codeforces.com/gym/103960/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 n, c;
+    cin >> n >> c;
+
+    vvi trie(1, vi(26));
+    vvi count(1, vi(26));
+    
+    function<int(string&, int, int)> add = [&](string &a, int i, int p) {
+        if (a[i] == '*') {
+            int maximal = 0;
+            rep(j, 26) {
+                if (trie[p][j] == 0) {
+                    trie[p][j] = trie.size();
+                    trie.emplace_back(26);
+                    count.emplace_back(26);
+                }
+
+                if (i == c - 1) {
+                    count[p][j]++;
+                    rmax(maximal, count[p][j]);
+                    continue;
+                }
+
+                rmax(count[p][j], add(a, i + 1, trie[p][j]));
+                rmax(maximal, count[p][j]);
+            }
+
+            return maximal;
+        }
+
+        if (trie[p][a[i] - 'a'] == 0) {
+            trie[p][a[i] - 'a'] = trie.size();
+            trie.emplace_back(26);
+            count.emplace_back(26);
+        }
+
+        if (i == c - 1) {
+            count[p][a[i] - 'a']++;
+            return count[p][a[i] - 'a'];
+        }
+
+        rmax(count[p][a[i] - 'a'], add(a, i + 1, trie[p][a[i] - 'a']));
+
+        return count[p][a[i] - 'a'];
+    };
+
+    while (n--) {
+        string f;
+        cin >> f;
+
+        add(f, 0, 0);
+    }
+
+    string ans;
+    int now = 0;
+    int ansc = 0;
+
+    rep(i, c) {
+        int tmp = 0;
+        int maximal = 0;
+
+        rep(j, 26) {
+            if (count[now][j] > maximal) {
+                maximal = count[now][j];
+                tmp = j;
+            }
+        }
+
+        ans.push_back(tmp + 'a');
+        ansc = maximal;
+        now = trie[now][tmp];
+    }
+
+    cout << ans << ' ' << ansc << '\n';
+}

2022-2023 ICPC Brazil Subregional Programming Contest/H. Helping the Transit.cpp

@@ -0,0 +1,185 @@
+/* Problem URL: https://codeforces.com/gym/103960/problem/H */
+
+#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;
+
+template <class T, class comp = less<>>
+using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
+
+#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 n, m;
+    cin >> n >> m;
+
+    vvi graph(n);
+    vvi inv(n);
+    vvi comp(n);
+
+    while (m--) {
+        int a, b;
+        cin >> a >> b;
+        a--, b--;
+
+        graph[a].push_back(b);
+        inv[b].push_back(a);
+        comp[a].push_back(b);
+        comp[b].push_back(a);
+    }
+
+    stack<int> preorder;
+
+    V<bool> vis(n);
+
+    function<void(int)> getpre = [&](int i) {
+        vis[i] = true;
+
+        for (auto j : graph[i]) {
+            if (vis[j]) {
+                continue;
+            }
+
+            getpre(j);
+        }
+
+        preorder.push(i);
+    };
+
+    rep(i, n) {
+        if (vis[i]) {
+            continue;
+        }
+
+        getpre(i);
+    }
+
+    int g = 0;
+    fill(all(vis), false);
+    V<set<int>> condin;
+    V<set<int>> condout;
+    vi group(n, -1);
+
+    function<void(int)> dfs = [&](int i) {
+        vis[i] = true;
+        group[i] = g;
+
+        for (auto j : inv[i]) {
+            if (group[j] != -1 && group[j] != g) {
+                condin[g].insert(group[j]);
+                condout[group[j]].insert(g);
+                continue;
+            }
+
+            if (vis[j]) {
+                continue;
+            }
+
+            dfs(j);
+        }
+    };
+
+    while (!preorder.empty()) {
+        int i = preorder.top();
+        preorder.pop();
+
+        if (vis[i]) {
+            continue;
+        }
+
+        condin.emplace_back();
+        condout.emplace_back();
+        dfs(i);
+        g++;
+    }
+
+    if (g == 1) {
+        cout << "0\n";
+        return 0;
+    }
+
+    int nonein = 0;
+    int noneout = 0;
+
+    rep(i, g) {
+        if (condin[i].empty()) {
+            nonein++;
+        }
+
+        if (condout[i].empty()) {
+            noneout++;
+        }
+    }
+
+    cout << max(nonein, noneout) << '\n';
+}

2022-2023 ICPC Brazil Subregional Programming Contest/I. Intercepting Information.cpp

@@ -0,0 +1,88 @@
+/* Problem URL: https://codeforces.com/gym/103960/problem/I */
+
+#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);
+
+    rep(i, 9) {
+        int n;
+        cin >> n;
+
+        if (n == 9) {
+            cout << "F\n";
+            return 0;
+        }
+    }
+
+    cout << "S\n";
+}

2022-2023 ICPC Brazil Subregional Programming Contest/J. Playing 23.cpp

@@ -0,0 +1,142 @@
+/* Problem URL: https://codeforces.com/gym/103960/problem/J */
+
+#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 n;
+    cin >> n;
+
+    map<string, int> card;
+
+    vi cards(11, 4);
+    cards[10] = 16;
+
+    int john = 0;
+    int mary = 0;
+
+    vi value(14, 0);
+    nrep(i, 1, 11) {
+        value[i] = i;
+    }
+
+    value[11] = 10;
+    value[12] = 10;
+    value[13] = 10;
+
+    int c1, c2;
+    cin >> c1 >> c2;
+    cards[value[c1]]--;
+    cards[value[c2]]--;
+
+    john = value[c1] + value[c2];
+
+    cin >> c1 >> c2;
+    cards[value[c1]]--;
+    cards[value[c2]]--;
+
+    mary = value[c1] + value[c2];
+
+    while (n--) {
+        int c;
+        cin >> c;
+
+        cards[value[c]]--;
+        john += value[c];
+        mary += value[c];
+    }
+
+    if (mary >= john) {
+        if (23 - mary > 10 || cards[23 - mary] == 0) {
+            cout << "-1\n";
+            return 0;
+        }
+
+        cout << 23 - mary << '\n';
+        return 0;
+    }
+
+    nrep(i, 1, 11) {
+        if (mary + i > 23) {
+            cout << "-1\n";
+            return 0;
+        }
+
+        if (john + i > 23 && cards[i] > 0) {
+            cout << i << '\n';
+            return 0;
+        }
+    }
+
+    cout << "-1\n";
+}