Add files via upload

Author: BrandonTang89

Other_Tasks/CF2004_A_Closest_Point.py

@@ -0,0 +1,10 @@
+t = int(input())
+for _ in range(t):
+    n = int(input())
+    arr = list(map(int, input().split()))
+
+    if n > 2 or arr[0] + 1 == arr[1]:
+        print("NO")
+
+    else:
+        print("YES")

Other_Tasks/CF2004_B_Game_with_Doors.py

@@ -0,0 +1,24 @@
+for _ in range(int(input())):
+    
+    al, ar = map(int, input().split())
+    bl, br = map(int, input().split())
+    
+    if al > bl:
+        al, ar, bl, br = bl, br, al, ar
+    
+    if ar < bl: 
+        print(1) 
+        continue
+    
+    if ar > br:
+        ans = 0
+        if al < bl: ans += 1
+        print (ans + 1 + br - bl)
+        continue
+    
+    ans = 0
+    if al < bl: ans += 1
+    if ar < br: ans += 1
+    ans += ar - bl
+    
+    print(ans)

Other_Tasks/CF2004_C_Splitting_Items.py

@@ -0,0 +1,23 @@
+t = int(input())
+for _ in range(t):
+    n, k = map(int, input().split())
+    
+    arr = list(map(int, input().split()))
+    arr.sort(reverse=True)
+    
+    rk = k
+    for i in range(0, n-1, 2):
+        maxUp = arr[i] - arr[i+1]
+        update = min(maxUp, rk)
+        rk -= update
+        arr[i+1] += update
+        if rk == 0:
+            break
+    
+    ans = 0
+    for i in range(0, n):
+        ans += (-1 if i % 2 == 1 else 1) * arr[i]
+    
+    print(ans)
+        
+        

Other_Tasks/CF2004_D_Colored_Portals.py

@@ -0,0 +1,54 @@
+for _ in range(int(input())):
+    n, q = map(int, input().split())
+    inf = int(1e18)
+    latest = {}
+    latest["BG"] = -inf
+    latest["BR"] = -inf
+    latest["BY"] = -inf
+    latest["GR"] = -inf
+    latest["GY"] = -inf
+    latest["RY"] = -inf
+    
+    arr = list(input().split())
+    sameLeft = [-inf for i in range(n)]
+    sameRight = [inf for i in range(n)]
+    
+    for i in range(n):
+        for k in latest:
+            if len(set(k + arr[i])) == 3:
+                sameLeft[i] = max(sameLeft[i], latest[k])
+        latest[arr[i]] = i
+        
+    
+    latest["BG"] = inf
+    latest["BR"] = inf
+    latest["BY"] = inf
+    latest["GR"] = inf
+    latest["GY"] = inf
+    latest["RY"] = inf
+    
+    for i in range(n-1, -1, -1):
+        for k in latest:
+            if len(set(k + arr[i])) == 3:
+                sameRight[i] = min(sameRight[i], latest[k])
+        latest[arr[i]] = i
+        
+    for _ in range(q):
+        l, r = map(int, input().split())
+        if l > r: l, r = r, l
+        l -= 1
+        r -= 1
+        
+        if len(set(arr[l] + arr[r])) <= 3:
+            print(r - l)
+            continue
+        
+        if sameRight[l] <= r:
+            print(r - l)
+            continue
+        
+        extra = min(l - sameLeft[l], sameRight[l] - r)
+        if extra >= int(1e7):
+            print(-1)
+            continue
+        print(r - l + extra*2)

Other_Tasks/CF2004_E_Not_a_Nim_Problem.cpp

@@ -0,0 +1,65 @@
+#pragma GCC optimize("Ofast")
+#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>  
+using namespace std;
+
+#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+
+typedef long long ll;
+typedef vector<ll> vll;
+
+constexpr ll inf = 1e18;
+vector<ll> lowestpf, primes;
+void smallestPF(ll upperbound = (ll) 1e7+2){
+    _sieve_size = upperbound + 1;
+    lowestpf.assign(_sieve_size, inf);
+
+    for(ll i = 2; i < _sieve_size; i++){
+        if(lowestpf[i] == inf){
+            lowestpf[i] = i;
+            for(ll j = i * i; j < _sieve_size; j += i){
+                lowestpf[j] = min(lowestpf[j], i);
+            }
+            primes.push_back(i);
+        }
+    }
+} // Time: O(n log log n)
+
+unordered_map<ll, ll> primeOrder;
+
+int g(int x){
+    if (x == 0) return 0;
+    if (x == 1) return 1;
+    int pf = lowestpf[x];
+    if (pf == 2) return 0;
+    return primeOrder[pf];
+}
+
+int main(){
+    fast_cin();
+    smallestPF();
+    for (int i = 0; i < primes.size(); i++){
+        primeOrder[primes[i]] = i+1;
+    }
+    
+    int t;
+    cin >> t;
+    while (t--){
+        int n;
+        cin >> n;
+        int ans = 0;
+        for (int i = 0; i < n; i++){
+            int x;
+            cin >> x;
+            ans ^= g(x);
+        }
+
+        if (ans == 0){
+            cout << "Bob\n";
+        } else {
+            cout << "Alice\n";
+        }
+    }
+    return 0;
+}