Add files via upload

Author: BrandonTang89

Other_Tasks/CF2111_A_Energy_Crystals.py

@@ -0,0 +1,11 @@
+
+for _ in range(int(input())):
+    x = int(input())
+    
+    arr = [0, 0, 0]
+    ans = 0
+    while min(arr) < x:
+        arr.sort()
+        arr[0] = arr[1]*2+1
+        ans += 1
+    print(ans)

Other_Tasks/CF2111_B_Fibonacci_Cubes.py

@@ -0,0 +1,27 @@
+
+fibo = [-1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]
+
+for _ in range(int(input())):
+    n, q = map(int, input().split())
+    
+    if n == 1:
+        for _ in range(q):
+            input()
+            print(1, end="")
+        print()
+        continue
+    
+            
+    biggest = fibo[n]
+    second_biggest = fibo[n-1]
+    
+    for _ in range(q):
+        arr = list(map(int, input().split()))
+        arr.sort()
+        
+        if arr[0] >= biggest and arr[1] >= biggest and arr[2] >= biggest + second_biggest:
+            print(1, end="")
+        else:
+            print(0, end="")
+    print()
+    

Other_Tasks/CF2111_C_Equal_Values.py

@@ -0,0 +1,20 @@
+for _ in range(int(input())):
+    n = int(input())
+    arr = list(map(int, input().split()))
+    ans = int(1e12)
+
+    cur = -1
+    cur_start = -1
+    for i in range(n):
+        if cur == arr[i]:
+            continue
+        
+        # We consider the new row
+        if cur_start != -1:
+            ans = min(ans, cur_start * cur + (n-i) * (cur))
+        
+        cur = arr[i]
+        cur_start = i
+        
+    ans = min(ans, cur_start * cur)
+    print(ans)

Other_Tasks/CF2111_D_Creating_a_Schedule.py

@@ -0,0 +1,15 @@
+for _ in range(int(input())):
+    n, m = map(int, input().split())
+    a = list(map(int, input().split()))
+    arr = [(x // 100, x) for x in a]
+    arr.sort()
+    
+    for i in range(n):
+        # assign furthest classrooms
+        bottom = arr[i//2][1]
+        top = arr[m-(i//2)-1][1]
+
+        if i%2 == 0:
+            print(bottom, top, bottom, top, bottom, top)
+        else:
+            print(top, bottom, top, bottom, top, bottom)

Other_Tasks/CF2111_E_Changing_the_String.cpp

@@ -0,0 +1,92 @@
+#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, q;
+string s;
+set<int> ca, ba, cb, bc;
+
+char a = 'a', b = 'b', c = 'c';
+void solve() {
+    cin >> n >> q;
+    cin >> s;
+
+    ca.clear();
+    ba.clear();
+    cb.clear();
+    bc.clear();
+    for (int i = 0; i < q; i++) {
+        char x, y;
+        cin >> x >> y;
+
+        if (x == 'c' && y == 'a') {
+            ca.insert(i);
+        } else if (x == 'b' && y == 'a') {
+            ba.insert(i);
+        } else if (x == 'c' && y == 'b') {
+            cb.insert(i);
+        } else if (x == 'b' && y == 'c') {
+            bc.insert(i);
+        }
+    }
+
+    for (int i = 0; i < n; i++) {
+        if (s[i] == a) continue;
+
+        if (s[i] == b) {
+            // try to do b -> a first
+            if (!ba.empty()) {
+                s[i] = a;
+                ba.erase(ba.begin());
+            } else if (!bc.empty()) {
+                // try to do b -> c -> a
+                int idx = *bc.begin();
+
+                // see if we can do c -> a
+                auto it = ca.upper_bound(idx);
+                if (it != ca.end()) {
+                    s[i] = a;
+                    bc.erase(bc.begin());
+                    ca.erase(it);
+                }
+            }
+        }
+
+        else if (s[i] == c) {
+            // try to do c -> a first
+            if (!ca.empty()) {
+                s[i] = a;
+                ca.erase(ca.begin());
+            } else if (!cb.empty()) {
+                // try to do c -> b
+                int idx = *cb.begin();
+                cb.erase(cb.begin());
+                s[i] = b;
+
+                // try to do b -> a
+                auto it = ba.upper_bound(idx);
+                if (it != ba.end()) {
+                    s[i] = a;
+                    ba.erase(it);
+                }
+            }
+        }
+    }
+    cout << s << endl;
+}
+
+int main() {
+    int tc;
+    cin >> tc;
+    while (tc--) solve();
+
+    return 0;
+}