結果
問題 | No.1647 Travel in Mitaru city 2 |
ユーザー | mkawa2 |
提出日時 | 2021-08-13 23:31:07 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 463 ms / 2,500 ms |
コード長 | 1,750 bytes |
コンパイル時間 | 910 ms |
コンパイル使用メモリ | 82,040 KB |
実行使用メモリ | 132,228 KB |
最終ジャッジ日時 | 2024-04-21 04:57:45 |
合計ジャッジ時間 | 20,550 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 39 ms
53,348 KB |
testcase_01 | AC | 39 ms
53,556 KB |
testcase_02 | AC | 39 ms
52,936 KB |
testcase_03 | AC | 42 ms
53,684 KB |
testcase_04 | AC | 58 ms
69,104 KB |
testcase_05 | AC | 40 ms
55,116 KB |
testcase_06 | AC | 41 ms
54,496 KB |
testcase_07 | AC | 63 ms
72,000 KB |
testcase_08 | AC | 375 ms
117,180 KB |
testcase_09 | AC | 307 ms
108,872 KB |
testcase_10 | AC | 394 ms
116,732 KB |
testcase_11 | AC | 338 ms
112,908 KB |
testcase_12 | AC | 367 ms
116,924 KB |
testcase_13 | AC | 314 ms
107,944 KB |
testcase_14 | AC | 417 ms
128,156 KB |
testcase_15 | AC | 406 ms
119,196 KB |
testcase_16 | AC | 391 ms
125,604 KB |
testcase_17 | AC | 349 ms
114,476 KB |
testcase_18 | AC | 344 ms
110,324 KB |
testcase_19 | AC | 463 ms
116,984 KB |
testcase_20 | AC | 380 ms
111,856 KB |
testcase_21 | AC | 327 ms
111,612 KB |
testcase_22 | AC | 430 ms
130,416 KB |
testcase_23 | AC | 424 ms
130,304 KB |
testcase_24 | AC | 358 ms
113,276 KB |
testcase_25 | AC | 393 ms
117,120 KB |
testcase_26 | AC | 425 ms
130,424 KB |
testcase_27 | AC | 438 ms
130,428 KB |
testcase_28 | AC | 434 ms
130,952 KB |
testcase_29 | AC | 425 ms
130,956 KB |
testcase_30 | AC | 418 ms
126,600 KB |
testcase_31 | AC | 429 ms
132,228 KB |
testcase_32 | AC | 342 ms
112,896 KB |
testcase_33 | AC | 368 ms
114,564 KB |
testcase_34 | AC | 428 ms
131,848 KB |
testcase_35 | AC | 316 ms
108,808 KB |
testcase_36 | AC | 421 ms
131,716 KB |
testcase_37 | AC | 381 ms
131,352 KB |
testcase_38 | AC | 390 ms
122,380 KB |
testcase_39 | AC | 331 ms
109,080 KB |
testcase_40 | AC | 407 ms
121,620 KB |
testcase_41 | AC | 359 ms
114,740 KB |
testcase_42 | AC | 396 ms
120,728 KB |
testcase_43 | AC | 53 ms
62,208 KB |
testcase_44 | AC | 50 ms
65,792 KB |
testcase_45 | AC | 271 ms
108,108 KB |
testcase_46 | AC | 358 ms
108,156 KB |
testcase_47 | AC | 271 ms
108,240 KB |
testcase_48 | AC | 325 ms
108,300 KB |
testcase_49 | AC | 270 ms
107,988 KB |
testcase_50 | AC | 263 ms
108,364 KB |
ソースコード
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**16 md = 998244353 # md = 10**9+7 h, w, n = LI() to = [[] for _ in range(h+w)] xytoi = {} for i in range(n): x, y = LI1() y += h to[x].append(y) to[y].append(x) xytoi[x, y] = i vis = [0]*(h+w) def dfs(u): stack = [(u, -1, True)] res = [] while stack: u, par, first = stack.pop() if first: vis[u] = 1 stack.append((u, par, False)) for v in to[u]: if v == par: continue if vis[v] == 2: continue if vis[v] == 1: res = [v, u, par] break stack.append((v, u, True)) else: if res and res[-1] == u: res.append(par) if res and res[0] == res[-1]: return res vis[u] = 2 ans = [] for u in range(h): if vis[u]: continue uu = dfs(u) if uu: for u0, u1 in zip(uu, uu[1:]): if u0 > u1: u0, u1 = u1, u0 i = xytoi[u0, u1] ans.append(i+1) if uu[0] > uu[1]: ans = [ans[-1]]+ans[:-1] break if ans: print(len(ans)) print(*ans) else: print(-1)