Add a bunch of other problems.

Some are not finished...

2018-2019 ACM-ICPC Brazil Subregional Programming Contest/B. Marbles.cpp

@@ -0,0 +1,134 @@
+/* Problem URL: https://codeforces.com/gym/101908/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 mr;
+    cin >> mr;
+
+    const int n = 101;
+    const int inf = INT32_MAX >> 1;
+
+    vvi grundy(n, vi(n));
+
+    rep(i, n) {
+        grundy[i][i] = 1000;
+        grundy[0][i] = 1000;
+        grundy[i][0] = 1000;
+    }
+
+    auto search = [&](int i, int j) {
+        V<bool> exists(1001, false);
+        nrep(k, 1, n) {
+            if (i - k >= 0) {
+                exists[grundy[i - k][j]] = true;
+            }
+
+            if (j - k >= 0) {
+                exists[grundy[i][j - k]] = true;
+            }
+
+            if (i - k >= 0 && j - k >= 0) {
+                exists[grundy[i - k][j - k]] = true;
+            }
+        }
+
+        int mex = 0;
+        while (exists[mex]) {
+            mex++;
+        }
+
+        return mex;
+    };
+
+    nrep(i, 1, n) {
+        nrep(j, 1, n) {
+            if (i == j) {
+                continue;
+            }
+            grundy[i][j] = search(i, j);
+        }
+    }
+
+    int state = 0;
+
+    while (mr--) {
+        int i, j;
+        cin >> i >> j;
+
+        state ^= grundy[i][j];
+    }
+
+    cout << (state == 0 ? "N\n" : "Y\n");
+}

2018-2019 ACM-ICPC Brazil Subregional Programming Contest/C. Pizza Cutter.cpp

@@ -0,0 +1,156 @@
+/* Problem URL: https://codeforces.com/gym/101908/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);
+
+    ll x, y;
+    cin >> x >> y;
+
+    ll h, v;
+    cin >> h >> v;
+
+    ll ans = (h + 1) * (v + 1);
+
+    V<pair<ll, ll>> ys(h);
+    repv(i, ys) {
+        cin >> i.first >> i.second;
+    }
+
+    V<pair<ll, ll>> xs(v);
+
+    repv(i, xs) {
+        cin >> i.first >> i.second;
+    }
+
+    sortv(ys);
+    sortv(xs);
+
+    function<ll(V<pair<ll, ll>>&)> count = [&](V<pair<ll, ll>> &vec) -> ll {
+        if (vec.size() <= 1) {
+            return 0;
+        }
+
+        int mid = vec.size() / 2;
+
+        V<pair<ll, ll>> first(mid);
+        rep(i, mid) {
+            first[i] = vec[i];
+        }
+
+        V<pair<ll, ll>> second(vec.size() - mid);
+        rep(i, vec.size() - mid) {
+            second[i] = vec[vec.size() - i - 1];
+        }
+        reverse(all(second));
+
+        ll ans = count(first);
+        ans += count(second);
+
+        int now = 0;
+        int l = 0;
+        int r = 0;
+        while (l < first.size() && r < second.size()) {
+            if (first[l].second <= second[r].second) {
+                vec[now] = first[l];
+                now++;
+                l++;
+                continue;
+            }
+
+            ans += first.size() - l;
+            vec[now] = second[r];
+            now++;
+            r++;
+        }
+
+        while (l < first.size()) {
+            vec[now] = first[l];
+            l++;
+            now++;
+        }
+
+        while (r < second.size()) {
+            vec[now] = second[r];
+            r++;
+            now++;
+        }
+
+        return ans;
+    };
+
+    ans += count(xs);
+    ans += count(ys);
+
+    cout << ans << '\n';
+}

2018-2019 ACM-ICPC Brazil Subregional Programming Contest/D. Unraveling Monty Hall.cpp

@@ -0,0 +1,89 @@
+/* Problem URL: https://codeforces.com/gym/101908/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;
+    int count = 0;
+    while (t--) {
+        int n;
+        cin >> n;
+        
+        if (n == 2 || n == 3) {
+            count++;
+        }
+    }
+    cout << count << '\n';
+}

2018-2019 ACM-ICPC Brazil Subregional Programming Contest/E. Enigma.cpp

@@ -0,0 +1,97 @@
+/* Problem URL: https://codeforces.com/gym/101908/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);
+
+    string a, b;
+    cin >> a >> b;
+
+    int count = 0;
+    rep(i, a.size() - b.size() + 1) {
+        bool pos = true;
+
+        rep(j, b.size()) {
+            if (a[i + j] == b[j]) {
+                pos = false;
+                break;
+            }
+        }
+
+        if (pos) {
+            count++;
+        }
+    }
+
+    cout << count << '\n';
+}

2018-2019 ACM-ICPC Brazil Subregional Programming Contest/F. Music Festival.cpp

@@ -0,0 +1,81 @@
+/* Problem URL: https://codeforces.com/gym/101908/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;
+    cin >> n;
+
+    V<tuple<int, int, int, int>> stuff;
+}

2018-2019 ACM-ICPC Brazil Subregional Programming Contest/I. Switches.cpp

@@ -0,0 +1,120 @@
+/* Problem URL: https://codeforces.com/gym/101908/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);
+
+    int n, m;
+    cin >> n >> m;
+
+    int l;
+    cin >> l;
+
+    int on = l;
+
+    vi status(m);
+    while (l--) {
+        int a;
+        cin >> a;
+        status[a - 1] = 1;
+    }
+
+    vvi graph(n);
+    rep(i, n) {
+        int k;
+        cin >> k;
+
+        while (k--) {
+            int b;
+            cin >> b;
+            graph[i].push_back(b - 1);
+        }
+    }
+
+    int i = 0;
+    while (i < 2 * n && on != 0) {
+        repv(j, graph[i % n]) {
+            on += 1 - 2 * status[j];
+            status[j] ^= 1;
+        }
+
+        i++;
+    }
+
+    if (on != 0) {
+        cout << "-1\n";
+        return 0;
+    }
+
+    cout << i << '\n';
+}

2018-2019 ACM-ICPC Brazil Subregional Programming Contest/L. Subway Lines.cpp

@@ -0,0 +1,159 @@
+/* Problem URL: https://codeforces.com/gym/101908/problem/L */
+
+#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, q;
+    cin >> n >> q;
+
+    vvi graph(n);
+
+    rep(i, n - 1) {
+        int a, b;
+        cin >> a >> b;
+        a--, b--;
+
+        graph[a].push_back(b);
+        graph[b].push_back(a);
+    }
+
+    vvi parent(n, vi(20, 0));
+    vi depth(n, 0);
+
+    function<void(int, int)> dfs = [&](int i, int p) {
+        depth[i] = depth[p] + 1;
+        parent[i][0] = p;
+
+        nrep(j, 1, 20) {
+            parent[i][j] = parent[parent[i][j - 1]][j - 1];
+        }
+
+        for (auto j : graph[i]) {
+            if (j == p) {
+                continue;
+            }
+
+            dfs(j, i);
+        }
+    };
+
+    dfs(0, 0);
+
+    auto lca = [&](int a, int b) {
+        if (depth[a] > depth[b]) {
+            swap(a, b);
+        }
+
+        int diff = depth[b] - depth[a];
+
+        rep(i, 20) {
+            if ((diff >> i) & 1) {
+                b = parent[b][i];
+            }
+        }
+
+        if (a == b) {
+            return a;
+        }
+
+        for (int i = 19; i >= 0; i--) {
+            if (parent[a][i] != parent[b][i]) {
+                a = parent[a][i];
+                b = parent[b][i];
+            }
+        }
+
+        return parent[a][0];
+    };
+
+    auto dis = [&](int a, int b) {
+        return depth[a] + depth[b] - 2 * depth[lca(a, b)];
+    };
+
+    while (q--) {
+        int a, b, c, d;
+        cin >> a >> b >> c >> d;
+        a--, b--, c--, d--;
+
+        int x = dis(a, b) + dis(c, d);
+        int y = min(dis(a, c) + dis(b, d), dis(a, d) + dis(b, c));
+
+        if (y > x) {
+            cout << "0\n";
+            continue;
+        }
+
+        cout << (x - y) / 2 + 1 << '\n';
+    }
+}