結果
問題 | No.340 雪の足跡 |
ユーザー | mkawa2 |
提出日時 | 2022-01-23 13:29:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 470 ms / 1,000 ms |
コード長 | 1,956 bytes |
コンパイル時間 | 841 ms |
コンパイル使用メモリ | 86,856 KB |
実行使用メモリ | 108,928 KB |
最終ジャッジ日時 | 2023-08-19 18:13:47 |
合計ジャッジ時間 | 13,555 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge10 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 110 ms
71,336 KB |
testcase_01 | AC | 106 ms
71,584 KB |
testcase_02 | AC | 104 ms
71,376 KB |
testcase_03 | AC | 106 ms
71,360 KB |
testcase_04 | AC | 105 ms
71,608 KB |
testcase_05 | AC | 106 ms
71,612 KB |
testcase_06 | AC | 106 ms
71,564 KB |
testcase_07 | AC | 106 ms
71,412 KB |
testcase_08 | AC | 104 ms
71,424 KB |
testcase_09 | AC | 103 ms
71,516 KB |
testcase_10 | AC | 105 ms
71,412 KB |
testcase_11 | AC | 129 ms
77,436 KB |
testcase_12 | AC | 128 ms
77,644 KB |
testcase_13 | AC | 133 ms
78,220 KB |
testcase_14 | AC | 162 ms
79,692 KB |
testcase_15 | AC | 177 ms
80,272 KB |
testcase_16 | AC | 151 ms
78,748 KB |
testcase_17 | AC | 176 ms
80,300 KB |
testcase_18 | AC | 173 ms
80,204 KB |
testcase_19 | AC | 179 ms
80,060 KB |
testcase_20 | AC | 350 ms
102,480 KB |
testcase_21 | AC | 197 ms
78,296 KB |
testcase_22 | AC | 154 ms
96,372 KB |
testcase_23 | AC | 350 ms
102,872 KB |
testcase_24 | AC | 290 ms
102,724 KB |
testcase_25 | AC | 319 ms
102,668 KB |
testcase_26 | AC | 152 ms
78,288 KB |
testcase_27 | AC | 116 ms
77,236 KB |
testcase_28 | AC | 158 ms
79,088 KB |
testcase_29 | AC | 382 ms
92,664 KB |
testcase_30 | AC | 314 ms
89,128 KB |
testcase_31 | AC | 429 ms
106,068 KB |
testcase_32 | AC | 470 ms
108,076 KB |
testcase_33 | AC | 420 ms
106,988 KB |
testcase_34 | AC | 468 ms
108,528 KB |
testcase_35 | AC | 381 ms
108,928 KB |
testcase_36 | AC | 384 ms
108,816 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) 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 = 18446744073709551615 # inf = 4294967295 # md = 10**9+7 md = 998244353 from collections import deque w, h, n = LI() row = [[0]*w for _ in range(h)] col = [[0]*h for _ in range(w)] for _ in range(n): m = II() bb = LI() for k in range(m): i, j = divmod(bb[k], w) s, t = divmod(bb[k+1], w) if i == s: if j > t: j, t = t, j row[i][j] += 1 row[s][t] -= 1 else: if i > s: i, s = s, i col[j][i] += 1 col[t][s] -= 1 for i in range(h): for j in range(w-1): row[i][j+1] += row[i][j] for j in range(w): for i in range(h-1): col[j][i+1] += col[j][i] # p2D(row) # p2D(col) def push(i, j, d): dist[i][j] = d q.append((i, j)) dist = [[-1]*w for _ in range(h)] q = deque([(0, 0)]) dist[0][0] = 0 while q: i, j = q.popleft() d = dist[i][j] if j and row[i][j-1] and dist[i][j-1] == -1: push(i, j-1, d+1) if j+1 < w and row[i][j] and dist[i][j+1] == -1: push(i, j+1, d+1) if i and col[j][i-1] and dist[i-1][j] == -1: push(i-1, j, d+1) if i+1 < h and col[j][i] and dist[i+1][j] == -1: push(i+1, j, d+1) # pDB(i,j) # p2D(dist) ans = dist[-1][-1] if ans == -1: ans = "Odekakedekinai.." print(ans)