Add files via upload

Author: BrandonTang89

Other_Tasks/CF2096_A_Wonderful_Sticks.py

@@ -0,0 +1,22 @@
+for _ in range(int(input())):
+    n = int(input())
+    a = list(input())
+    a.reverse()
+    
+    top = n
+    bottom = 1
+    
+    ans = []
+    for x in a:
+        if x == '<':
+            ans.append(bottom)
+            bottom += 1
+        else:
+            ans.append(top)
+            top -= 1
+    
+    ans.append(bottom)
+    
+    ans.reverse()
+    
+    print(*ans)

Other_Tasks/CF2096_B_Wonderful_Gloves.py

@@ -0,0 +1,14 @@
+for _ in range(int(input())):
+    n, k = map(int, input().split())
+    
+    rs = map(int, input().split())
+    ls = map(int, input().split())
+    
+    together = [(r, l) for r, l in zip(rs, ls)]
+    together.sort(key=lambda x: min(x[0], x[1]), reverse=True)
+    
+    ans = sum(max(x[0], x[1]) for x in together)
+    ans += sum(min(x[0], x[1]) for x in together[:k-1])
+    ans += 1
+    
+    print(ans)

Other_Tasks/CF2096_C_Wonderful_City.cpp

@@ -0,0 +1,89 @@
+#pragma GCC optimize("Ofast")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>
+using namespace std;
+
+typedef long long ll;
+typedef vector<int> vi;
+#define fast_cin()                    \
+    ios_base::sync_with_stdio(false); \
+    cin.tie(NULL);                    \
+    cout.tie(NULL);
+
+int n;
+vector<vector<int>> heights;
+vector<vector<ll>> memo;
+vector<ll> costs;
+constexpr ll inf = 1e18;
+ll dp(int idx, int prev_up) {
+    if (idx == n) return 0;
+    if (memo[idx][prev_up] != -1) return memo[idx][prev_up];
+    if (idx == 0) return min(dp(idx + 1, 0), dp(idx + 1, 1) + costs[idx]);
+
+    // we need to check if we can no upgrade this current row
+    bool same_can = true;
+    for (int c = 0; c < n; c++) {
+        if (heights[idx][c] == heights[idx - 1][c] + prev_up) {
+            same_can = false;
+            break;
+        }
+    }
+
+    bool up_can = true;
+    for (int c = 0; c < n; c++) {
+        if (heights[idx][c] + 1 == heights[idx - 1][c] + prev_up) {
+            up_can = false;
+            break;
+        }
+    }
+
+    if (same_can && up_can) {
+        return memo[idx][prev_up] = min(dp(idx + 1, 0), dp(idx + 1, 1) + costs[idx]);
+    } else if (same_can) {
+        return memo[idx][prev_up] = dp(idx + 1, 0);
+    } else if (up_can) {
+        return memo[idx][prev_up] = dp(idx + 1, 1) + costs[idx];
+    } else {
+        return memo[idx][prev_up] = inf;
+    }
+}
+
+void solve() {
+    cin >> n;
+    heights.assign(n, vector<int>(n));
+    memo.assign(n, vector<ll>(2, -1));
+
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < n; j++) {
+            cin >> heights[i][j];
+        }
+    }
+
+    costs.assign(n, 0);
+    for (auto &x : costs) {
+        cin >> x;
+    }
+
+    ll ans = dp(0, 0);
+
+    // transpose the matrix
+    for (int i = 0; i < n; i++) {
+        for (int j = i + 1; j < n; j++) {
+            swap(heights[i][j], heights[j][i]);
+        }
+    }
+
+    memo.assign(n, vector<ll>(2, -1));
+    for (auto &x : costs) {
+        cin >> x;
+    }
+
+    ans += dp(0, 0);
+    cout << (ans >= inf ? -1 : ans) << '\n';
+}
+
+int main() {
+    int tc;
+    cin >> tc;
+    while (tc--) solve();
+}

Other_Tasks/CF2096_D_Wonderful_Lightbulbs.py

@@ -0,0 +1,52 @@
+from collections import defaultdict
+for _ in range(int(input())):
+    
+    n = int(input())
+    pts: list[tuple[int, int]] = []
+    for i in range(n):
+        x, y = map(int, input().split())
+        pts.append((x, y))
+        
+    by_x: dict[int, list[int]] = defaultdict(lambda: []) # number of y at point x
+    for i in range(n):
+        by_x[pts[i][0]].append(pts[i][1])
+    
+    # get the only one with an odd number of y
+    odd_x = None
+    for x, ys in by_x.items():
+        if len(ys) % 2 == 1:
+            odd_x = x
+            break
+    
+    assert odd_x is not None, "There should be an odd number of y at some x"
+    
+    # print("the x", odd_x)
+    
+    s = set(y for y in by_x[odd_x]) # items on the odd_x
+    
+    for x in by_x:
+        if x == odd_x:
+            continue
+        
+        if x < odd_x:  # shift downward
+            diff = odd_x - x
+            for y in by_x[x]:
+                ny = y - diff
+                if ny in s:
+                    s.remove(ny)
+                else:
+                    s.add(ny)
+        else:  # shift upward
+            diff = x - odd_x
+            for y in by_x[x]:
+                ny = y + diff
+                if ny in s:
+                    s.remove(ny)
+                else:
+                    s.add(ny)
+    
+    assert len(s) == 1, "There should be only one y left"
+    
+    print(odd_x, s.pop())
+    
+    

Other_Tasks/CF2096_E_Wonderful_Teddy_Bears.py

@@ -0,0 +1,74 @@
+def prune(arr):
+    # remove any left bs
+    # remove any right ps
+    n = len(arr)
+    num_left_bs = 0
+    for i in range(n):
+        if arr[i] == "B":
+            num_left_bs += 1
+        else:
+            break
+    num_right_ps = 0
+    for i in range(n - 1, -1, -1):
+        if arr[i] == "P":
+            num_right_ps += 1
+        else:
+            break
+
+    return arr[num_left_bs : n - num_right_ps]
+
+
+def f(n: int) -> int:
+    if n % 2 == 0:
+        k = n // 2
+        return k * (k + 1)
+    else:
+        k = n // 2
+        return (k + 1) * (k + 1)
+
+
+for _ in range(int(input())):
+    n = int(input())
+    arr = list(input())
+    arr = prune(arr)
+    n = len(arr)
+
+    num_p_on_left = [0] * n
+    num_b_on_right = [0] * n
+
+    for i in range(n):
+        num_p_on_left[i] = (num_p_on_left[i - 1] if i > 0 else 0) + (arr[i] == "P")
+
+    for i in range(n - 1, -1, -1):
+        num_b_on_right[i] = (num_b_on_right[i + 1] if i < n - 1 else 0) + (
+            arr[i] == "B"
+        )
+
+    # print("arr", arr)
+    ans = 0
+    st: list = []
+    p_edit = 0
+    for i in range(n):
+        if arr[i] == "P":
+            if st and st[-1][0] == "P":
+                ans += num_b_on_right[i]
+                # print("added", num_b_on_right[i])
+                st.pop()
+                p_edit += 2
+            else:
+                st.append((arr[i], None))
+        elif arr[i] == "B":
+            if st and st[-1][0] == "B":
+                ans += st[-1][1]
+                # print("added", st[-1][1])
+                st.pop()
+            else:
+                st.append((arr[i], num_p_on_left[i] - p_edit))
+        # print(st)
+
+    arr = prune([x[0] for x in st])
+    # print("arr", arr)
+
+    ans += f(len(arr) // 2)
+    print(ans)
+