結果
問題 | No.1650 Moving Coins |
ユーザー |
![]() |
提出日時 | 2021-08-20 21:57:36 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
AC
|
実行時間 | 934 ms / 2,000 ms |
コード長 | 1,325 bytes |
コンパイル時間 | 374 ms |
コンパイル使用メモリ | 12,928 KB |
実行使用メモリ | 89,172 KB |
最終ジャッジ日時 | 2024-10-14 03:33:32 |
合計ジャッジ時間 | 17,423 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
import sys sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**9 md = 998244353 # md = 10**9+7 n = II() aa = LI() bb = LI() dd = [0]*n for i, (a, b) in enumerate(zip(aa, bb)): dd[i] = b-a to = [[] for _ in range(n)] for i in range(n-1): if dd[i] > 0 and dd[i+1] > 0: to[i+1].append(i) if dd[i] < 0 and dd[i+1] < 0: to[i].append(i+1) def dfs(i): fin[i] = True for j in to[i]: if fin[j]: continue dfs(j) topo.append(i) topo = [] fin = [False]*n for i in range(n): if fin[i]: continue dfs(i) ans = [] for i in topo[::-1]: if dd[i] == 0: continue if dd[i] > 0: for _ in range(dd[i]): ans.append((i+1, "R")) else: for _ in range(-dd[i]): ans.append((i+1, "L")) print(len(ans)) for i, c in ans: print(i, c)