結果
問題 | No.340 雪の足跡 |
ユーザー | mkawa2 |
提出日時 | 2022-01-23 14:02:33 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 533 ms / 1,000 ms |
コード長 | 2,171 bytes |
コンパイル時間 | 248 ms |
コンパイル使用メモリ | 82,492 KB |
実行使用メモリ | 110,832 KB |
最終ジャッジ日時 | 2024-05-07 01:46:28 |
合計ジャッジ時間 | 9,103 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
55,424 KB |
testcase_01 | AC | 42 ms
55,056 KB |
testcase_02 | AC | 43 ms
54,940 KB |
testcase_03 | AC | 42 ms
55,644 KB |
testcase_04 | AC | 43 ms
55,068 KB |
testcase_05 | AC | 43 ms
54,796 KB |
testcase_06 | AC | 44 ms
55,080 KB |
testcase_07 | AC | 44 ms
55,872 KB |
testcase_08 | AC | 47 ms
54,744 KB |
testcase_09 | AC | 43 ms
54,572 KB |
testcase_10 | AC | 43 ms
56,316 KB |
testcase_11 | AC | 63 ms
68,260 KB |
testcase_12 | AC | 69 ms
70,692 KB |
testcase_13 | AC | 70 ms
72,832 KB |
testcase_14 | AC | 115 ms
79,064 KB |
testcase_15 | AC | 128 ms
78,856 KB |
testcase_16 | AC | 100 ms
77,344 KB |
testcase_17 | AC | 137 ms
79,796 KB |
testcase_18 | AC | 128 ms
79,736 KB |
testcase_19 | AC | 132 ms
79,656 KB |
testcase_20 | AC | 340 ms
102,264 KB |
testcase_21 | AC | 189 ms
76,836 KB |
testcase_22 | AC | 82 ms
91,084 KB |
testcase_23 | AC | 354 ms
101,588 KB |
testcase_24 | AC | 293 ms
101,896 KB |
testcase_25 | AC | 330 ms
102,292 KB |
testcase_26 | AC | 117 ms
77,184 KB |
testcase_27 | AC | 67 ms
72,900 KB |
testcase_28 | AC | 124 ms
78,316 KB |
testcase_29 | AC | 423 ms
91,888 KB |
testcase_30 | AC | 321 ms
88,404 KB |
testcase_31 | AC | 462 ms
104,992 KB |
testcase_32 | AC | 533 ms
110,832 KB |
testcase_33 | AC | 444 ms
106,704 KB |
testcase_34 | AC | 511 ms
106,684 KB |
testcase_35 | AC | 375 ms
106,832 KB |
testcase_36 | AC | 380 ms
106,976 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 def solve(): 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) solve()