Add files via upload

Author: BrandonTang89

Other_Tasks/CF2165_A_Cyclic_Merging.cpp

@@ -0,0 +1,54 @@
+#pragma GCC optimize("Ofast")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>  
+using namespace std;
+
+using ll = long long;
+using vi = vector<int>;
+#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+
+
+void solve() {
+    set<pair<ll, ll>> s; // (max_value, index)
+    int n;
+    cin >> n;
+
+    vector<ll> a(n);
+    vector<ll> nxt(n);
+    vector<ll> prv(n);
+    for (int i = 0; i < n; i++) {
+        cin >> a[i];
+        nxt[i] = (i + 1) % n;
+        prv[i] = (i - 1 + n) % n;
+    }
+
+    for (int i = 0; i < n; i++) {
+        s.insert({max(a[i], a[nxt[i]]), i});
+    }
+
+    ll ans = 0;
+    while (s.size() > 1) {
+        auto [val, idx] = *s.begin();
+        s.erase(s.begin());
+        ans += val;
+
+        // remove the left one
+        pair<ll, ll> left_pair = {max(a[prv[idx]], a[idx]), prv[idx]};
+        s.erase(left_pair);
+
+        // now update with new pair
+        nxt[prv[idx]] = nxt[idx];
+        prv[nxt[idx]] = prv[idx];
+        a[nxt[idx]] = val;
+        pair<ll, ll> new_pair = {max(a[prv[idx]], a[nxt[idx]]), prv[idx]};
+        s.insert(new_pair);        
+    }
+
+    cout << ans << '\n';
+}
+
+int main(){
+    int tc; cin >> tc; while (tc--) solve();
+
+    return 0;
+}

Other_Tasks/CF2165_B_Marble_Council.cpp

@@ -0,0 +1,56 @@
+#pragma GCC optimize("Ofast")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using vi = vector<int>;
+#define fast_cin()                    \
+    ios_base::sync_with_stdio(false); \
+    cin.tie(NULL);                    \
+    cout.tie(NULL);
+
+int n;
+ll maxi;
+
+constexpr ll MOD = 998244353;
+vector<ll> arr;
+vector<vector<ll>> memo;
+ll dp(int idx, ll taken) {
+    if (idx >= n) {
+        if (taken < maxi)
+            return 0;
+        else
+            return 1;
+    }
+
+    if (memo[idx][taken] != -1) return memo[idx][taken];
+    ll ans = 0;
+    ans += dp(idx + 1, taken);
+    ans %= MOD;
+    ans += (arr[idx] * dp(idx + 1, taken + arr[idx])) % MOD;
+    ans %= MOD;
+
+    return memo[idx][taken] = ans;
+}
+void solve() {
+    cin >> n;
+    arr.assign(n, 0);
+    maxi = 0;
+    for (int i = 0; i < n; i++) {
+        int x;
+        cin >> x;
+        arr[x-1]++;
+        maxi = max(maxi, arr[x-1]);
+    }
+    memo.assign(n + 1, vector<ll>(n + 1, -1));
+    cout << dp(0, 0) % MOD << '\n';
+}
+
+int main() {
+    int tc;
+    cin >> tc;
+    while (tc--) solve();
+
+    return 0;
+}

Other_Tasks/CF2165_C_Binary_Wine.cpp

@@ -0,0 +1,69 @@
+#include <queue>
+#pragma GCC optimize("Ofast")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using vi = vector<int>;
+#define fast_cin()                    \
+    ios_base::sync_with_stdio(false); \
+    cin.tie(NULL);                    \
+    cout.tie(NULL);
+
+void solve() {
+    int n, q;
+    cin >> n >> q;
+    vector<int> arr(n);
+
+    for (int i = 0; i < n; i++) {
+        cin >> arr[i];
+    }
+    sort(arr.begin(), arr.end(), greater<int>());
+
+    while (q--) {
+        int x;
+        cin >> x;
+
+        priority_queue<int> pq;
+        while (!pq.empty()) pq.pop();
+        for (int i = 0; i < min(n, 32); i++) {  // at most 32 needed
+            pq.push(arr[i]);
+        }
+
+        int cur = x;
+        int count = 0;
+        while (cur > 0) {
+            int ref = (pq.empty()) ? 0 : pq.top();
+            if (!pq.empty()) {
+                pq.pop();
+            }
+
+            if (cur <= ref) {
+                break;
+            } else if (ref == 0) {
+                count += cur;
+                break;
+            } else if (__builtin_clz(ref) > __builtin_clz(cur)) {
+                int target = (1 << (32 - __builtin_clz(cur) - 1));
+                count += (target - ref);
+                cur -= target;
+            } else {
+                assert(__builtin_clz(cur) == __builtin_clz(ref));
+                int part = (1 << (31 - __builtin_clz(ref)));
+                cur ^= part;
+                pq.emplace(ref ^ part);
+            }
+        }
+
+        cout << count << endl;
+    }
+}
+
+int main() {
+    int tc;
+    cin >> tc;
+    while (tc--) solve();
+
+    return 0;
+}