Add a bunch of other problems

Codeforces Round 1052 (Div. 2)/A. Equal Occurrences.cpp

@@ -0,0 +1,113 @@
+/* Problem URL: https://codeforces.com/contest/2146/problem/A */
+
+#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 t;
+    cin >> t;
+    while (t--) {
+        int n;
+        cin >> n;
+        vi a(n);
+        cin >> a;
+
+        vi fds(n + 1);
+        repv(i, a) {
+            fds[i]++;
+        }
+
+        int ans = 0;
+        
+
+        rep(i, n + 1) {
+            int now = 0;
+
+            rep(j, n + 1) {
+                if (fds[j] >= i) {
+                    now += i;
+                }
+            }
+
+            rmax(ans, now);
+        }
+
+        cout << ans << '\n';
+    }
+}

Codeforces Round 1052 (Div. 2)/B. Merging the Sets.cpp

@@ -0,0 +1,127 @@
+/* Problem URL: https://codeforces.com/contest/2146/problem/B */
+
+#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 t;
+    cin >> t;
+    while (t--) {
+        int n, m;
+        cin >> n >> m;
+
+        vi count(m);
+        vvi them(n);
+
+        int c = 0;
+
+        rep(i, n) {
+            int l;
+            cin >> l;
+
+            while (l--) {
+                int a;
+                cin >> a;
+                count[a - 1]++;
+                them[i].push_back(a - 1);
+            }
+        }
+
+        if (*min_element(all(count)) <= 0) {
+            cout << "NO\n";
+            continue;
+        }
+
+        rep(i, n) {
+            bool pos = true;
+            repv(j, them[i]) {
+                if (count[j] == 1) {
+                    pos = false;
+                    break;
+                }
+            }
+
+            if (pos) {
+                c++;
+            }
+        }
+
+        cout << (c >= 2 ? "YES\n" : "NO\n");
+    }
+}

Codeforces Round 1052 (Div. 2)/C. Wrong Binary Search.cpp

@@ -0,0 +1,136 @@
+/* Problem URL: https://codeforces.com/contest/2146/problem/C */
+
+#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 t;
+    cin >> t;
+    while (t--) {
+        int n;
+        cin >> n;
+
+        string a;
+        cin >> a;
+
+        vi perm(n, -1);
+        int c = 0;
+        bool pos = true;
+        
+        rep(i, n) {
+            if (a[i] == '1') {
+                perm[i] = i + 1;
+                c++;
+                continue;
+            }
+
+            if ((i == 0 || a[i - 1] == '1') && (i == n - 1 || a[i + 1] == '1')) {
+                pos = false;
+                break;
+            }
+        }
+
+        if (!pos) {
+            cout << "NO\n";
+            continue;
+        }
+
+        int i = 0;
+        int now = 0;
+
+        while (i < n) {
+            while (i < n && a[i] == '0') {
+                i++;
+            }
+
+            int tmp = i - 1;
+            while (tmp >= 0 && a[tmp] == '0') {
+                perm[tmp] = now + 1;
+                tmp--;
+                now++;
+            }
+
+            now++;
+            i++;
+        }
+
+        cout << "YES\n";
+        cout << perm;
+    }
+}

Codeforces Round 1052 (Div. 2)/D1. Max Sum OR (Easy Version).cpp

@@ -0,0 +1,154 @@
+/* Problem URL: https://codeforces.com/contest/2146/problem/D1 */
+
+#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 t;
+    cin >> t;
+    while (t--) {
+        int l, r;
+        cin >> l >> r;
+
+        if (r == 0) {
+            cout << "0\n0\n";
+            continue;
+        }
+
+        int n = r + 1;
+
+        vi perm(n, -1);
+
+        set<int> all;
+        rep(i, n) {
+            all.insert(i);
+        }
+
+        int log = 32 - __builtin_clz(r);
+        // cout << log << '\n';
+
+        int now = r;
+        rep(i, n) {
+            if (perm[now] != -1) {
+                now--;
+                continue;
+            }
+
+            int act = 0;
+            rep(j, log) {
+                if (!((now >> j) & 1)) {
+                    act |= 1 << j;
+                }
+            }
+
+            while (act > 0 && !all.count(act)) {
+                act -= 1 << (31 - __builtin_clz(act));
+            }
+
+            if (!all.count(act)) {
+                now--;
+                continue;
+            }
+
+            // cout << now << ' ' << act << '\n';
+
+            perm[now] = act;
+            perm[act] = now;
+            all.erase(now);
+            all.erase(act);
+            now--;
+        }
+
+        rep(i, n) {
+            if (perm[i] != -1) {
+                continue;
+            }
+
+            perm[i] = *prev(all.end());
+            all.erase(prev(all.end()));
+        }
+
+        ll total = 0;
+        rep(i, n) {
+            total += perm[i] | i;
+        }
+        cout << total << '\n';
+        cout << perm;
+    }
+}

Codeforces Round 1052 (Div. 2)/D2. Max Sum OR (Hard Version).cpp

@@ -0,0 +1,155 @@
+/* Problem URL: https://codeforces.com/contest/2146/problem/D2 */
+
+#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 t;
+    cin >> t;
+    while (t--) {
+        V<array<int, 2>> trie(1);
+        V<array<int, 2>> count(1);
+
+        auto add = [&](ll num) {
+            int now = 0;
+            rep(i, 31) {
+                int bit = (num >> i) & 1;
+                count[now][bit]++;
+                if (trie[now][bit] == 0) {
+                    trie[now][bit] = trie.size();
+                    count.emplace_back();
+                    trie.emplace_back();
+                }
+
+                now = trie[now][bit];
+            }
+        };
+
+        auto rem = [&](ll num) {
+            int now = 0;
+            rep(i, 31) {
+                int bit = (num >> i) & 1;
+                count[now][bit]--;
+                now = trie[now][bit];
+            }
+        };
+
+        ll l, r;
+        cin >> l >> r;
+
+        nrep(i, l, r + 1) {
+            add(i);
+        }
+
+        int n = r - l + 1;
+        vl ans(n);
+
+        for (int i = r; i >= l; i--) {
+            ll tmp = 0;
+            function<void(int, int)> find = [&](ll now, int j) {
+                if (j > 30) {
+                    return;
+                }
+
+                int bit = (i >> j) & 1;
+                if (count[now][bit^1] == 0) {
+                    tmp |= (bit << j);
+                    find(trie[now][bit], j + 1);
+                    return;
+                }
+
+                tmp |= ((bit^1) << j);
+                find(trie[now][bit^1], j + 1);
+            };
+
+            find(0, 0);
+
+            rem(tmp);
+            ans[i - l] = tmp;
+        }
+
+        ll total = 0;
+        rep(i, n) {
+            total += ans[i] | (i + l);
+        }
+
+        cout << total << '\n';
+        cout << ans;
+    }
+}

Codeforces Round 1052 (Div. 2)/E. Yet Another MEX Problem.cpp

@@ -0,0 +1,184 @@
+/* Problem URL: https://codeforces.com/contest/2146/problem/E */
+
+#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 t;
+    cin >> t;
+    while (t--) {
+        int n;
+        cin >> n;
+
+        vi fds(n);
+        cin >> fds;
+
+        int prev = n;
+        n++;
+        fds.push_back(0);
+        
+        while (__builtin_popcount(n) != 1) {
+            n++;
+            fds.push_back(0);
+        }
+        
+        vvi segm(n * 2);
+
+        function<void(int, int, int)> build = [&](int i, int l, int r) {
+            if (l == r) {
+                segm[i] = {fds[i - n]};
+                return;
+            }
+
+            int mid = (l + r) >> 1;
+
+            build(i * 2, l, mid);
+            build(i * 2 + 1, mid + 1, r);
+
+            merge(all(segm[i * 2]), all(segm[i * 2 + 1]), back_inserter(segm[i]));
+        };
+
+        build(1, 0, n - 1);
+
+        function<int(int, int, int, int, int, int)> querym = [&](int i, int l, int r, int tl, int tr, int v) {
+            if (l > tr || r < tl) {
+                return 0;
+            }
+
+            if (l >= tl && r <= tr) {
+                auto upper = upper_bound(all(segm[i]), v);
+                return (int)(segm[i].end() - upper);
+            }
+
+            int mid = (l + r) >> 1;
+
+            return querym(i * 2, l, mid, tl, tr, v) + querym(i * 2 + 1, mid + 1, r, tl, tr, v);
+        };
+
+        vi seg(n * 2, -1);
+
+        auto update = [&](int i, int v) {
+            i += n;
+            seg[i] = v;
+
+            for (i >>= 1; i > 0; i >>= 1) {
+                seg[i] = min(seg[i * 2], seg[i * 2 + 1]);
+            }
+        };
+        
+        function<int(int, int, int, int, int)> query = [&](int i, int l, int r, int tl, int tr) {
+            int oo = INT32_MAX >> 1;
+            if (l > tr || r < tl) {
+                return oo;
+            }
+
+            if (l >= tl && r <= tr) {
+                return seg[i];
+            }
+
+            int mid = (l + r) >> 1;
+
+            return min(query(i * 2, l, mid, tl, tr), query(i * 2 + 1, mid + 1, r, tl, tr));
+        };
+
+        vi ans(prev);
+        rep(i, prev) {
+            update(fds[i], i);
+
+            int mex = 0;
+            int ans = 0;
+
+            while (mex <= n) {
+                int minimal = query(1, 0, n - 1, 0, mex);
+
+                int tmp = querym(1, 0 , n - 1, minimal, i, mex);
+
+                if (tmp >= ans) {
+                    ans = tmp;
+                    mex++;
+                    continue;
+                }
+
+                break;
+            }
+
+            cout << ans << " \n"[i == prev - 1];
+        }
+    }
+}