Add files via upload

Author: BrandonTang89

Other_Tasks/CF2036_E_Reverse_the_Rivers.py

@@ -0,0 +1,49 @@
+n, k, q = map(int, input().split())
+
+arr = [list(map(int, input().split())) for _ in range(n)]
+
+for r in range(k):
+    cur = 0
+    for c in range(n):
+        cur |= arr[c][r]
+        arr[c][r] = cur
+
+for _ in range(q):
+    m = int(input())
+    mini = 0
+    maxi = n-1
+    
+    for _ in range(m):
+        region, o, val = input().split()
+        region = int(region) - 1
+        val = int(val)
+        
+        if o == '>':
+            # find smallest row that has column region with value greater than val
+            lo = mini
+            hi = n
+            
+            while lo < hi:
+                mid = (lo+hi)//2
+                if arr[mid][region] > val:
+                    hi = mid
+                else:
+                    lo = mid+1
+            mini = lo
+            
+        else:
+            # find largest row that has column region with value less than val
+            lo = -1
+            hi = maxi
+            while lo < hi:
+                mid = (lo+hi+1)//2
+                if arr[mid][region] < val:
+                    lo = mid
+                else:
+                    hi = mid-1
+            maxi = lo
+    
+    if mini <= maxi:
+        print(mini + 1)
+    else:
+        print(-1)

Other_Tasks/CF2036_F_XORificator_3000.py

@@ -0,0 +1,31 @@
+t = int(input())
+from math import log2
+
+for _ in range(t):
+    l, r, i, k = map(int, input().split())
+
+    def prefix(x): # XOR of 1..x
+        ans = 0
+        for j in range(int(log2(x + 2)) + 1):
+            if j == 0:
+                if x % 4 == 1 or x % 4 == 2:
+                    ans = 1
+                else:
+                    ans = 0
+                continue
+
+            if (x >> j) % 2 == 1:
+                # one block
+                numOnes = x % (1 << j) + 1
+                if numOnes % 2 == 1:
+                    ans |= 1 << j
+        return ans
+
+    def xorUpto(x):  # XOR of all numbers up to x that are k mod 2^i
+        y = x // (1 << i)
+        if x % (1 << i) >= k:
+            y += 1
+
+        return (prefix(y - 1) << i) + (k if y % 2 == 1 else 0)
+
+    print(prefix(r) ^ prefix(l - 1) ^ xorUpto(r) ^ xorUpto(l - 1))