Add files via upload

Author: BrandonTang89

Other_Tasks/CF2077_A_Breach_of_Faith.py

@@ -0,0 +1,18 @@
+for _ in range(int(input())):
+    n = int(input())
+    arr = list(map(int, input().split()))
+
+    arr.sort(reverse=True)
+
+    left = arr[: n + 1]
+    right = arr[n + 1 :]
+
+    gap = sum(left) - sum(right)
+    right.append(gap)
+
+    for i in range(2 * n + 1):
+        if i % 2 == 1:
+            print(right[i // 2], end=" ")
+        else:
+            print(left[i // 2], end=" ")
+    print()

Other_Tasks/CF2077_B_Finding_OR_Sum.py

@@ -0,0 +1,76 @@
+from sys import stdout
+mask_even = 0
+for i in range(0, 30, 2):
+    mask_even += 1 << i
+
+mask_odd = 0
+for i in range(1, 30, 2):
+    mask_odd += 1 << i
+
+ZEROS = 0
+MIX = 1
+ONES = 2
+
+for _ in range(int(input())):
+    print(mask_even)
+    stdout.flush()
+    even_res = int(input())
+
+    print(mask_odd)
+    stdout.flush()
+    odd_res = int(input())
+
+    numbers = [None] * 30
+
+    for i in range(2, 30, 2):
+        # refer to mask odd to find the even bit patterns
+        at_i = odd_res & (1 << i)
+        at_ip1 = odd_res & (1 << (i + 1))
+
+        if at_i and at_ip1:
+            numbers[i] = ONES
+        elif at_i and not at_ip1:
+            numbers[i] = ZEROS
+        elif not at_i and at_ip1:
+            numbers[i] = MIX
+        else:
+            assert False
+
+    at_0 = odd_res & 1
+    at_1 = odd_res & 2
+    if not at_0 and not at_1:
+        numbers[0] = ZEROS
+    elif at_0 and not at_1:
+        numbers[0] = MIX
+    elif not at_0 and at_1:
+        numbers[0] = ONES
+    else:
+        assert False
+
+    for i in range(1, 30, 2):
+        # refer to mask even to find the odd bit patterns
+        at_i = even_res & (1 << i)
+        at_ip1 = even_res & (1 << (i + 1))
+
+        if at_i and at_ip1:
+            numbers[i] = ONES
+        elif at_i and not at_ip1:
+            numbers[i] = ZEROS
+        elif not at_i and at_ip1:
+            numbers[i] = MIX
+        else:
+            assert False
+
+    x = 0
+    y = 0
+    for i in range(0, 30):
+        if numbers[i] == MIX:
+            y += 1 << i
+        elif numbers[i] == ONES:
+            x += 1 << i
+            y += 1 << i
+
+    print("!")
+    stdout.flush()
+    m = int(input())
+    print((x | m) + (y | m))

Other_Tasks/CF2078_A_Final_Verdict.py

@@ -0,0 +1,3 @@
+for _ in range(int(input())):
+    n, x = map(int, input().split())
+    print("YES" if sum(map(int, input().split())) == n * x else "NO")

Other_Tasks/CF2078_B_Vicious_Labyrinth.py

@@ -0,0 +1,9 @@
+for _ in range(int(input())):
+    n, k = map(int, input().split())
+
+    if k % 2 == 1:
+        ans = [n] * (n - 1) + [n - 1]
+    else:
+        ans = [n - 1] * (n - 2) + [n] + [n - 1]
+
+    print(*ans)

Other_Tasks/CF2078_D_Scammy_Game_Ad.cpp

@@ -0,0 +1,70 @@
+#pragma GCC optimize("Ofast")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+int n;
+vector<ll> to_add;
+vector<pair<ll, ll>> factor;
+vector<vector<ll>> memo;
+ll dp(ll idx, int side) {
+    if (idx == n) return 1;
+    if (memo[idx][side] != -1) return memo[idx][side];
+
+    if (side == 0) {
+        return memo[idx][side] = dp(idx + 1, 0) + max(dp(idx + 1, 0), dp(idx + 1, 1)) * (factor[idx].first - 1);
+    } else {
+        return memo[idx][side] = dp(idx + 1, 1) + max(dp(idx + 1, 1), dp(idx + 1, 0)) * (factor[idx].second - 1);
+    }
+}
+
+int main() {
+    int tc;
+    cin >> tc;
+    while (tc--) {
+        cin >> n;
+        to_add.assign(n, 0);
+        factor.assign(n, {0, 0});
+
+        for (int i = 0; i < n; i++) {
+            char left_op, right_op;
+            ll left_num, right_num;
+
+            cin >> left_op >> left_num >> right_op >> right_num;
+
+            if (left_op == '+') {
+                factor[i].first = 1;
+                to_add[i] += left_num;
+            } else {
+                factor[i].first = left_num;
+            }
+
+            if (right_op == '+') {
+                factor[i].second = 1;
+                to_add[i] += right_num;
+            } else {
+                factor[i].second = right_num;
+            }
+        }
+
+        memo.assign(n, vector<ll>(2, -1));
+
+        ll onLeft = 1;
+        ll onRight = 1;
+        for (int i = 0; i < n; i++) {
+            ll additional = to_add[i] + (factor[i].first - 1) * onLeft + (factor[i].second - 1) * onRight;
+            if (dp(i + 1, 0) > dp(i + 1, 1)) {
+                // better value to add to the left
+                onLeft += additional;
+            } else {
+                // better value to add to the right
+                onRight += additional;
+            }
+        }
+
+        cout << onLeft + onRight << endl;
+    }
+
+    return 0;
+}