arc172

Author: reo11

atcoder/ARC/arc172/a.py

@@ -0,0 +1,74 @@
+import sys
+import pypyjit
+pypyjit.set_param('max_unroll_recursion=-1')
+input = lambda: sys.stdin.readline().rstrip()
+sys.setrecursionlimit(20000000)
+from collections import defaultdict
+from bisect import bisect_left
+
+h, w, n = map(int, input().split())
+a = list(map(int, input().split()))
+a.sort(reverse=True)
+
+counter = defaultdict(lambda: 0)
+candidates = [0]
+for i in range(26):
+    candidates.append(2**i)
+candidates.sort()
+
+
+def dfs(h, w):
+    # h, wの大きさの正方形から作成可能なできるだけ大きい正方形の数
+    if h == 1 or w == 1:
+        counter[1] += h * w
+        return
+    min_hw = min(h, w)
+    idx = bisect_left(candidates, min_hw)
+    size = candidates[idx - 1]
+
+    if size == 0:
+        return
+
+    h_cnt = h // size
+    w_cnt = w // size
+    counter[size] += h_cnt * w_cnt
+    # あまり
+    mod_h = h % size
+    mod_w = w % size
+    if mod_h == 0 and mod_w == 0:
+        return
+    elif mod_h == 0:
+        dfs(mod_w, h)
+    elif mod_w == 0:
+        dfs(mod_h, w)
+    else:
+        if mod_h < mod_w:
+            # あまりが大きい方を大きくする
+            dfs(mod_w, h)
+            dfs(mod_h, w_cnt * size)
+        else:
+            dfs(mod_h, w)
+            dfs(mod_w, h_cnt * size)
+
+dfs(h, w)
+a_count = defaultdict(lambda: 0)
+for ai in a:
+    a_count[2**ai] += 1
+
+# print(counter)
+# print(a_count)
+
+flag = True
+for k in reversed(candidates[1:]):
+    if counter[k] >= a_count[k]:
+        counter[k] -= a_count[k]
+        counter[k // 2] += 4 * counter[k]
+    else:
+        flag = False
+        break
+
+if flag:
+    print("Yes")
+else:
+    print("No")
+

atcoder/ARC/arc172/b.py

@@ -0,0 +1,2 @@
+n, k, l = map(int, input().split())
+

atcoder/ARC/arc172/c.py

@@ -0,0 +1,70 @@
+from collections import defaultdict
+n = int(input())
+c = list(input())
+
+# 遷移させるだけ
+# 遷移元と遷移先の状態によって中間状態を定める
+# 状態数はそんなに多くない（多分）のでsetで適当に扱う？
+
+votes = [[0 for _ in range(4)] for _ in range(n + 1)]
+c1 = c[0]
+c = c[1:]
+if c1 == "A":
+    votes[0][2] = 1
+else:
+    votes[0][3] = 1
+
+for i, ci in enumerate(c, start=1):
+    if ci == "A":
+        votes[i][0] = votes[i - 1][0] + 1
+        votes[i][1] = votes[i - 1][1]
+        votes[i][2] = votes[i - 1][2] + 1
+        votes[i][3] = votes[i - 1][3]
+    else:
+        votes[i][0] = votes[i - 1][0]
+        votes[i][1] = votes[i - 1][1] + 1
+        votes[i][2] = votes[i - 1][2]
+        votes[i][3] = votes[i - 1][3] + 1
+
+# 最後
+if c1 == "A":
+    votes[-1][0] = votes[-2][0] + 1
+    votes[-1][1] = votes[-2][1]
+else:
+    votes[-1][0] = votes[-2][0]
+    votes[-1][1] = votes[-2][1] + 1
+
+def stats(x, y):
+    if x > y:
+        return "A"
+    elif x < y:
+        return "B"
+    else:
+        return "C"
+
+counter = defaultdict(lambda: defaultdict(lambda: 0))
+paths = [set() for _ in range(n - 1)]
+for i in range(1, n):
+    start1 = stats(votes[i][0], votes[i][1])
+    end1 = stats(votes[i][2], votes[i][3])
+    end2 = stats(votes[i + 1][0], votes[i + 1][1])
+    paths[i - 1].add(f"{start1} {end1} 1")
+    paths[i - 1].add(f"{start1} {end2} 2")
+
+    start2 = stats(votes[i - 1][2], votes[i - 1][3])
+    paths[i - 1].add(f"{start2} {end1} 3")
+
+start_status1 = stats(votes[1][0], votes[1][1])
+start_status2 = stats(votes[0][2], votes[0][3])
+
+for status in list(set([start_status1, start_status2])):
+    counter[0][f"{status}_0"] = 1
+
+for i in range(1, len(paths) + 1):
+    for path in paths[i - 1]:
+        start, end, path_type = path.split()
+        counter[i][end] += counter[i - 1][start]
+
+print(paths)
+print(counter)
+print(sum(counter[n - 1].values()))