Codeforces Round 799

Author: MikeAlwaysCode

Diff for: Contests/CodeforcesPython/Codeforces Round 521 Div. 3/A_Frog_Jumping/A_Frog_Jumping.py

@@ -0,0 +1,20 @@
+import sys
+
+# region fastio
+input = lambda: sys.stdin.readline().rstrip()
+sint = lambda: int(input())
+mint = lambda: map(int, input().split())
+ints = lambda: list(map(int, input().split()))
+# endregion fastio
+
+# MOD = 998_244_353
+# MOD = 10 ** 9 + 7
+# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+def solve() -> None:
+    return
+
+
+for _ in range(int(input())):
+    solve()

Diff for: Contests/CodeforcesPython/Codeforces Round 521 Div. 3/B_Disturbed_People/B_Disturbed_People.py

@@ -0,0 +1,20 @@
+import sys
+
+# region fastio
+input = lambda: sys.stdin.readline().rstrip()
+sint = lambda: int(input())
+mint = lambda: map(int, input().split())
+ints = lambda: list(map(int, input().split()))
+# endregion fastio
+
+# MOD = 998_244_353
+# MOD = 10 ** 9 + 7
+# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+def solve() -> None:
+    return
+
+
+for _ in range(int(input())):
+    solve()

Diff for: Contests/CodeforcesPython/Codeforces Round 521 Div. 3/C_Good_Array/C_Good_Array.py

@@ -0,0 +1,33 @@
+import sys
+
+# region fastio
+input = lambda: sys.stdin.readline().rstrip()
+sint = lambda: int(input())
+mint = lambda: map(int, input().split())
+ints = lambda: list(map(int, input().split()))
+# endregion fastio
+
+# MOD = 998_244_353
+# MOD = 10 ** 9 + 7
+# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+def solve() -> None:
+    n = sint()
+    nums = ints()
+    suff = [0] * (n + 1)
+    s = mx = 0
+    for i in range(n - 1, -1, -1):
+        s += nums[i]
+        suff[i] = max(nums[i], suff[i + 1])
+    ans = []
+    for i, x in enumerate(nums, 1):
+        if s - x == max(suff[i], mx) * 2:
+            ans.append(i)
+        mx = max(mx, x)
+    
+    print(len(ans))
+    print(*ans)
+
+
+solve()

Diff for: Contests/CodeforcesPython/Codeforces Round 521 Div. 3/D_Cutting_Out/D_Cutting_Out.py

@@ -0,0 +1,20 @@
+import sys
+
+# region fastio
+input = lambda: sys.stdin.readline().rstrip()
+sint = lambda: int(input())
+mint = lambda: map(int, input().split())
+ints = lambda: list(map(int, input().split()))
+# endregion fastio
+
+# MOD = 998_244_353
+# MOD = 10 ** 9 + 7
+# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+def solve() -> None:
+    return
+
+
+for _ in range(int(input())):
+    solve()

Diff for: Contests/CodeforcesPython/Codeforces Round 521 Div. 3/E_Thematic_Contests/E_Thematic_Contests.py

@@ -0,0 +1,20 @@
+import sys
+
+# region fastio
+input = lambda: sys.stdin.readline().rstrip()
+sint = lambda: int(input())
+mint = lambda: map(int, input().split())
+ints = lambda: list(map(int, input().split()))
+# endregion fastio
+
+# MOD = 998_244_353
+# MOD = 10 ** 9 + 7
+# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+def solve() -> None:
+    return
+
+
+for _ in range(int(input())):
+    solve()

Diff for: Contests/CodeforcesPython/Codeforces Round 521 Div. 3/F1_Pictures_with_Kittens_easy_version/F1_Pictures_with_Kittens_easy_version.py

@@ -0,0 +1,20 @@
+import sys
+
+# region fastio
+input = lambda: sys.stdin.readline().rstrip()
+sint = lambda: int(input())
+mint = lambda: map(int, input().split())
+ints = lambda: list(map(int, input().split()))
+# endregion fastio
+
+# MOD = 998_244_353
+# MOD = 10 ** 9 + 7
+# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+def solve() -> None:
+    return
+
+
+for _ in range(int(input())):
+    solve()

Diff for: Contests/CodeforcesPython/Codeforces Round 521 Div. 3/F2_Pictures_with_Kittens_hard_version/F2_Pictures_with_Kittens_hard_version.py

@@ -0,0 +1,20 @@
+import sys
+
+# region fastio
+input = lambda: sys.stdin.readline().rstrip()
+sint = lambda: int(input())
+mint = lambda: map(int, input().split())
+ints = lambda: list(map(int, input().split()))
+# endregion fastio
+
+# MOD = 998_244_353
+# MOD = 10 ** 9 + 7
+# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+def solve() -> None:
+    return
+
+
+for _ in range(int(input())):
+    solve()

Diff for: Contests/CodeforcesPython/Codeforces Round 799 Div. 4/A_Marathon/A_Marathon.py

@@ -13,7 +13,8 @@
 # DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
 
 def solve() -> None:
-    return
+    d = ints()
+    print(sum(x > d[0] for x in d[1:]))
 
 
 for _ in range(int(input())):

Diff for: Contests/CodeforcesPython/Codeforces Round 799 Div. 4/B_All_Distinct/B_All_Distinct.py

@@ -1,4 +1,5 @@
 import sys
+from collections import Counter
 
 # region fastio
 input = lambda: sys.stdin.readline().rstrip()
@@ -13,7 +14,10 @@
 # DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
 
 def solve() -> None:
-    return
+    n = sint()
+    nums = ints()
+    cnt = Counter(nums)
+    print(n - (sum(v - 1 for v in cnt.values()) + 1) // 2 * 2)
 
 
 for _ in range(int(input())):

Diff for: Contests/CodeforcesPython/Codeforces Round 799 Div. 4/C_Wheres_the_Bishop/C_Wheres_the_Bishop.py

@@ -13,7 +13,16 @@
 # DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
 
 def solve() -> None:
-    return
+    input()
+    g = []
+    for i in range(8):
+        g.append(input())
+        
+    for i in range(1, 7):
+        for j in range(1, 7):
+            if g[i][j] == '#' and g[i - 1][j - 1] == '#' and g[i - 1][j + 1] == '#':
+                print(i + 1, j + 1)
+                return
 
 
 for _ in range(int(input())):

Diff for: Contests/CodeforcesPython/Codeforces Round 799 Div. 4/D_The_Clock/D_The_Clock.py

@@ -1,3 +1,4 @@
+import math
 import sys
 
 # region fastio
@@ -12,8 +13,25 @@
 # DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL
 # DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
 
+pal = set()
+for t in range(1440):
+    h, m = divmod(t, 60)
+    h0, h1 = divmod(h, 10)
+    m0, m1 = divmod(m, 10)
+    if h0 == m1 and h1 == m0:
+        pal.add(t)
+
+
 def solve() -> None:
-    return
+    s, x = input().split()
+    h, m = s.split(':')
+    t = int(h) * 60 + int(m)
+    g = math.gcd(int(x), 1440)
+    ans = 0
+    for p in pal:
+        if (p - t) % 1440 % g == 0:
+            ans += 1
+    print(ans)
 
 
 for _ in range(int(input())):

Diff for: Contests/CodeforcesPython/Codeforces Round 799 Div. 4/E_Binary_Deque/E_Binary_Deque.py

@@ -1,3 +1,4 @@
+import math
 import sys
 
 # region fastio
@@ -13,7 +14,19 @@
 # DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
 
 def solve() -> None:
-    return
+    n, s = mint()
+    nums = ints()
+    ans = math.inf
+    l = m = 0
+    for r, x in enumerate(nums):
+        m += x
+        while m > s:
+            m -= nums[l]
+            l += 1
+        if m == s:
+            ans = min(ans, l + n - 1 - r)
+
+    print(-1 if ans == math.inf else ans)
 
 
 for _ in range(int(input())):

Diff for: Contests/CodeforcesPython/Codeforces Round 799 Div. 4/G_2Sort/G_2Sort.py

@@ -13,7 +13,18 @@
 # DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
 
 def solve() -> None:
-    return
+    n, k = mint()
+    nums = ints()
+    suff = 1
+    ans = 0
+    for i in range(n - 2, -1, -1):
+        if nums[i] < nums[i + 1] * 2:
+            suff += 1
+        else:
+            suff = 1
+        if suff > k:
+            ans += 1
+    print(ans)
 
 
 for _ in range(int(input())):

Diff for: Contests/CodeforcesPython/Codeforces Round 799 Div. 4/H_Gambling/H_Gambling.py

@@ -1,4 +1,6 @@
 import sys
+from collections import defaultdict
+from random import getrandbits
 
 # region fastio
 input = lambda: sys.stdin.readline().rstrip()
@@ -13,7 +15,21 @@
 # DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
 
 def solve() -> None:
-    return
+    n = sint()
+    nums = ints()
+    h = getrandbits(30)
+    pos = defaultdict(list)
+    for i, x in enumerate(nums, 1):
+        pos[x ^ h].append(i)
+    ans, l, r, mx = nums[0], 1, 1, 1
+    for x, arr in pos.items():
+        i = 0
+        for j in range(len(arr)):
+            if j * 2 - i * 2 + 1 - arr[j] + arr[i] < 1:
+                i = j
+            if j * 2 - i * 2 + 1 - arr[j] + arr[i] > mx:
+                ans, l, r, mx = x ^ h, arr[i], arr[j], j * 2 - i * 2 + 1 - arr[j] + arr[i]
+    print(ans, l, r)
 
 
 for _ in range(int(input())):

Diff for: Contests/CodeforcesPython/Codeforces Round 953 Div. 2/A_Alice_and_Books/A_Alice_and_Books.py

@@ -0,0 +1,22 @@
+import sys
+
+# region fastio
+input = lambda: sys.stdin.readline().rstrip()
+sint = lambda: int(input())
+mint = lambda: map(int, input().split())
+ints = lambda: list(map(int, input().split()))
+# endregion fastio
+
+# MOD = 998_244_353
+# MOD = 10 ** 9 + 7
+# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+def solve() -> None:
+    n = sint()
+    nums = ints()
+    print(nums[-1] + max(nums[:-1]))
+    
+
+for _ in range(int(input())):
+    solve()

Diff for: Contests/CodeforcesPython/Codeforces Round 953 Div. 2/B_New_Bakery/B_New_Bakery.py

@@ -0,0 +1,25 @@
+import sys
+
+# region fastio
+input = lambda: sys.stdin.readline().rstrip()
+sint = lambda: int(input())
+mint = lambda: map(int, input().split())
+ints = lambda: list(map(int, input().split()))
+# endregion fastio
+
+# MOD = 998_244_353
+# MOD = 10 ** 9 + 7
+# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+def solve() -> None:
+    n, a, b = mint()
+    ans = a * n
+    if b > a:
+        i = min(n, b - a + 1)
+        ans = a * (n - i) + (b * 2 - i + 1) * i // 2
+    print(ans)
+    
+ 
+for _ in range(int(input())):
+    solve()