AtCoder Beginner Contest 337

MikeAlwaysCode · MikeAlwaysCode · commit b9c1fef32f35 · 2024-01-20T23:50:07.000+08:00
diff --git a/Contests/AtCoderPython/AtCoder Beginner Contest 337/PA - Scoreboard.py b/Contests/AtCoderPython/AtCoder Beginner Contest 337/PA - Scoreboard.py
@@ -0,0 +1,26 @@
+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
+# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+
+def solve() -> None:
+    n = sint()
+    a = b = 0
+    for _ in range(n):
+        x, y = mint()
+        a += x
+        b += y
+    print("Takahashi" if a > b else "Aoki" if a < b else "Draw")
+
+
+solve()
diff --git a/Contests/AtCoderPython/AtCoder Beginner Contest 337/PB - Extended ABC.py b/Contests/AtCoderPython/AtCoder Beginner Contest 337/PB - Extended ABC.py
@@ -0,0 +1,26 @@
+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
+# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+
+def solve() -> None:
+    s = input()
+    i, j = -1, len(s)
+    while i < len(s) - 1 and s[i + 1] == 'A':
+        i += 1
+    while j > 0 and s[j - 1] == 'C':
+        j -= 1
+    print("Yes" if s.count('B') == j - i - 1 else "No")
+
+
+solve()
diff --git a/Contests/AtCoderPython/AtCoder Beginner Contest 337/PC - Lining Up 2.py b/Contests/AtCoderPython/AtCoder Beginner Contest 337/PC - Lining Up 2.py
@@ -0,0 +1,28 @@
+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
+# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+
+def solve() -> None:
+    n = sint()
+    nums = ints()
+    d = {x:i for i, x in enumerate(nums, 1)}
+    ans = []
+    last = -1
+    while last in d:
+        last = d[last]
+        ans.append(last)
+    print(*ans)
+
+
+solve()
diff --git a/Contests/AtCoderPython/AtCoder Beginner Contest 337/PD - Cheating Gomoku Narabe.py b/Contests/AtCoderPython/AtCoder Beginner Contest 337/PD - Cheating Gomoku Narabe.py
@@ -0,0 +1,54 @@
+import math
+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
+# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+
+def solve() -> None:
+    n, m, k = mint()
+    ans = math.inf
+    g = []
+    for _ in range(n):
+        g.append(input())
+        cnt_x = cnt_o = 0
+        for i, c in enumerate(g[-1]):
+            if c == 'x':
+                cnt_x += 1
+            elif c == 'o':
+                cnt_o += 1
+            if i >= k:
+                if g[-1][i - k] == 'x':
+                    cnt_x -= 1
+                elif g[-1][i - k] == 'o':
+                    cnt_o -= 1
+            if i >= k - 1 and cnt_x == 0:
+                ans = min(ans, k - cnt_o)
+    for j in range(m):
+        cnt_x = cnt_o = 0
+        for i in range(n):
+            if g[i][j] == 'x':
+                cnt_x += 1
+            elif g[i][j] == 'o':
+                cnt_o += 1
+            if i >= k:
+                if g[i - k][j] == 'x':
+                    cnt_x -= 1
+                elif g[i - k][j] == 'o':
+                    cnt_o -= 1
+            if i >= k - 1 and cnt_x == 0:
+                ans = min(ans, k - cnt_o)
+
+    print(-1 if ans == math.inf else ans)
+
+
+solve()
diff --git a/Contests/AtCoderPython/AtCoder Beginner Contest 337/PE - Bad Juice.py b/Contests/AtCoderPython/AtCoder Beginner Contest 337/PE - Bad Juice.py
@@ -0,0 +1,48 @@
+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
+# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+def solve() -> None:
+    n = sint()
+    k = 0
+    x = n
+    while x > 1:
+        k += 1
+        x = (x + 1) // 2
+    qry = [[] for _ in range(k)]
+
+    def zz(l: int, r: int, k: int):
+        if l == r: return
+        mid = (l + r) // 2
+        qry[k].extend(list(range(l, mid + 1)))
+        zz(l, mid, k + 1)
+        zz(mid + 1, r, k + 1)
+
+    zz(1, n, 0)
+
+    print(k, flush=True)
+    for i in range(k):
+        print(len(qry[i]), *qry[i], flush=True)
+    res = input()
+    l, r = 1, n
+    for c in res:
+        mid = (l + r) // 2
+        if c == '1':
+            r = mid
+        else:
+            l = mid + 1
+        if l == r:
+            break
+    print(l)
+
+solve()
diff --git a/Contests/AtCoderPython/AtCoder Beginner Contest 337/PF - Usual Color Ball Problems.py b/Contests/AtCoderPython/AtCoder Beginner Contest 337/PF - Usual Color Ball Problems.py
@@ -0,0 +1,54 @@
+import sys
+from collections import deque
+from heapq import *
+
+# 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
+# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))
+# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))
+
+
+def solve() -> None:
+    n, m, k = mint()
+    color = ints()
+    pos = [deque() for _ in range(n + 1)]
+    cnt = [0] * (n + 1)
+    last = [-1] * (n + 1)
+    h = []
+    s = 0
+    for i, c in enumerate(color):
+        cnt[c] += 1
+        pos[c].append(i)
+        if len(pos[c]) == 1:
+            heappush(h, (i, 0, c))
+        
+    for _ in range(m):
+        i, j, c = heappop(h)
+        if j + k >= len(pos[c]):
+            s += len(pos[c] - j + 1)
+        else:
+            s += k
+            j += k
+            heappush(h, (pos[c][j], j, c))
+        if not h:
+            break
+
+    print(s)
+    for i in range(0, n - 1):
+        c = color[i]
+        pos[c].popleft()
+        pos[c].append(n + i)
+        s -= min(cnt[c], k)
+        heappush(h, (pos[c][0], c))
+        i, c = heappop(h)
+        s += cnt[c]
+        print(s)
+
+solve()
diff --git a/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/A_Tricky_Template/A_Tricky_Template.py b/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/A_Tricky_Template/A_Tricky_Template.py
@@ -0,0 +1,29 @@
+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()
+    A = input()
+    B = input()
+    C = input()
+    ok = 0
+    for a, b, c in zip(A, B, C):
+        if (a == b and a == c) or (a != b and (a == c or b == c)):
+            ok += 1
+    print("YES" if ok < n else "NO")
+
+
+for _ in range(int(input())):
+    solve()
diff --git a/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/B_Forming_Triangles/B_Forming_Triangles.py b/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/B_Forming_Triangles/B_Forming_Triangles.py
@@ -0,0 +1,30 @@
+import math
+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()
+    nums.sort()
+    ans, i = 0, 1
+    for j in range(2, n):
+        while i < j and nums[i] < nums[j]:
+            i += 1
+        ans += (j - i) * i + math.comb(j - i, 2)
+    print(ans)
+
+
+for _ in range(int(input())):
+    solve()
diff --git a/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/C_Closest_Cities/C_Closest_Cities.py b/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/C_Closest_Cities/C_Closest_Cities.py
@@ -0,0 +1,45 @@
+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()
+    left, right = [0] * n, [0] * n
+    right[1] = 1
+    for i in range(2, n):
+        if nums[i] - nums[i - 1] < nums[i - 1] - nums[i - 2]:
+            right[i] = right[i - 1] + 1
+        else:
+            right[i] = right[i - 1] + nums[i] - nums[i - 1]
+    left[-2] = 1
+    for i in range(n - 3, -1, -1):
+        if nums[i + 1] - nums[i] < nums[i + 2] - nums[i + 1]:
+            left[i] = left[i + 1] + 1
+        else:
+            left[i] = left[i + 1] + nums[i + 1] - nums[i]
+
+    m = sint()
+    for _ in range(m):
+        x, y = mint()
+        x -= 1
+        y -= 1
+        if x < y:
+            print(right[y] - right[x])
+        else:
+            print(left[y] - left[x])
+
+
+for _ in range(int(input())):
+    solve()
diff --git a/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/D_Berserk_Monsters/D_Berserk_Monsters.py b/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/D_Berserk_Monsters/D_Berserk_Monsters.py
diff --git a/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/E_Increasing_Subsequences/E_Increasing_Subsequences.py b/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/E_Increasing_Subsequences/E_Increasing_Subsequences.py
diff --git a/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/F_Replace_on_Segment/F_Replace_on_Segment.py b/Contests/CodeforcesPython/Educational Codeforces Round 161 Rated for Div. 2/F_Replace_on_Segment/F_Replace_on_Segment.py
diff --git a/README.md b/README.md
