abc335

Author: reo11

atcoder/abc/abc301-400/abc335/a.py

@@ -0,0 +1,3 @@
+s = list(input())
+s[-1] = "4"
+print(*s, sep="")

atcoder/abc/abc301-400/abc335/b.py

@@ -0,0 +1,13 @@
+l = set()
+n = int(input())
+
+for x in range(n + 1):
+    for y in range(n + 1):
+        for z in range(n + 1):
+            if x + y + z <= n:
+                l.add((x, y, z))
+l = list(l)
+l.sort()
+l = [" ".join(map(str, x)) for x in l]
+
+print(*l, sep="\n")

atcoder/abc/abc301-400/abc335/c.py

@@ -0,0 +1,34 @@
+import sys
+import pypyjit
+
+pypyjit.set_param('max_unroll_recursion=-1')
+input = lambda: sys.stdin.readline().rstrip()
+
+directions = {
+    "L": [-1, 0],
+    "R": [1, 0],
+    "U": [0, 1],
+    "D": [0, -1]
+}
+
+n, q = map(int, input().split())
+queries = []
+for _ in range(q):
+    query_type, x = input().split()
+    queries.append((query_type, x))
+
+ans = []
+dragon = []
+for i in reversed(range(1, n + 1)):
+    dragon.append([i, 0])
+
+for query_type, x in queries:
+    if query_type == "1":
+        next_head_x = dragon[-1][0] + directions[x][0]
+        next_head_y = dragon[-1][1] + directions[x][1]
+        dragon.append([next_head_x, next_head_y])
+    else:
+        x = int(x)
+        current_x = dragon[-x]
+        ans.append(f"{current_x[0]} {current_x[1]}")
+print(*ans, sep="\n")

atcoder/abc/abc301-400/abc335/d.py

@@ -0,0 +1,30 @@
+n = int(input())
+
+# 外側から埋めるうずまき
+# 中央はT
+ans = [[0 for _ in range(n)] for _ in range(n)]
+ans[0][0] = 1
+ans[n // 2][n // 2] = "T"
+current_pos = [1, 0]
+current_num = 2
+status = 0
+dxy = [[1, 0], [0, 1], [-1, 0], [0, -1]]
+while True:
+    ans[current_pos[0]][current_pos[1]] = current_num
+    dx, dy = dxy[status % 4]
+    next_pos = [current_pos[0] + dx, current_pos[1] + dy]
+    if 0 <= next_pos[0] < n and 0 <= next_pos[1] < n:
+        if ans[next_pos[0]][next_pos[1]] == "T":
+            break
+        elif ans[next_pos[0]][next_pos[1]] == 0:
+            ans[next_pos[0]][next_pos[1]] = current_num
+            current_pos = next_pos
+            current_num += 1
+        else:
+            status += 1
+    else:
+        status += 1
+out = []
+for ansi in ans:
+    out.append(" ".join(map(str, ansi)))
+print(*out, sep="\n")

atcoder/abc/abc301-400/abc335/e.py

@@ -0,0 +1,49 @@
+import sys
+from collections import defaultdict, deque
+input = lambda: sys.stdin.readline().rstrip()
+sys.setrecursionlimit(20000000)
+INF = float("inf")
+
+n, m = map(int, input().split())
+a = list(map(int, input().split()))
+uv = []
+paths = defaultdict(lambda: [])
+for _ in range(m):
+    u, v = map(int, input().split())
+    if a[u - 1] <= a[v - 1]:
+        paths[u].append(v)
+    if a[v - 1] <= a[u - 1]:
+        paths[v].append(u)
+
+# 各頂点にそこにいくまでの最高得点を記録していく
+scores = defaultdict(lambda: -INF)
+q = [(1, 1, 0)]
+visited_path = set()
+path = []
+
+while q:
+    current_node_num, current_score, depth = q.pop()
+    while len(path) > depth:
+        visited_path.discard(path.pop())
+    if scores[current_node_num] > current_score:
+        # もっと良い手順がある
+        continue
+    if current_node_num == n:
+        continue
+    value = a[current_node_num - 1]
+    for next_node_num in paths[current_node_num]:
+        if next_node_num in visited_path:
+            continue
+        next_score = current_score
+        if value != a[next_node_num - 1]:
+            next_score += 1
+        if scores[next_node_num] >= next_score:
+            continue
+
+        q.append((next_node_num, next_score, depth + 1))
+        scores[next_node_num] = max(scores[next_node_num], next_score)
+
+if scores[n] == -INF:
+    print(0)
+else:
+    print(scores[n])