結果
問題 | No.340 雪の足跡 |
ユーザー | mkawa2 |
提出日時 | 2022-01-23 13:45:24 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,755 bytes |
コンパイル時間 | 302 ms |
コンパイル使用メモリ | 82,444 KB |
実行使用メモリ | 106,720 KB |
最終ジャッジ日時 | 2024-05-07 01:26:30 |
合計ジャッジ時間 | 12,469 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
53,760 KB |
testcase_01 | AC | 43 ms
54,272 KB |
testcase_02 | AC | 42 ms
53,632 KB |
testcase_03 | AC | 43 ms
53,888 KB |
testcase_04 | AC | 42 ms
54,400 KB |
testcase_05 | AC | 42 ms
54,400 KB |
testcase_06 | AC | 42 ms
54,144 KB |
testcase_07 | AC | 42 ms
54,272 KB |
testcase_08 | AC | 42 ms
54,272 KB |
testcase_09 | AC | 42 ms
54,144 KB |
testcase_10 | AC | 42 ms
54,272 KB |
testcase_11 | WA | - |
testcase_12 | AC | 65 ms
69,376 KB |
testcase_13 | WA | - |
testcase_14 | AC | 143 ms
78,024 KB |
testcase_15 | WA | - |
testcase_16 | AC | 129 ms
77,576 KB |
testcase_17 | AC | 162 ms
79,104 KB |
testcase_18 | AC | 157 ms
78,812 KB |
testcase_19 | AC | 161 ms
78,880 KB |
testcase_20 | AC | 481 ms
87,680 KB |
testcase_21 | AC | 342 ms
77,392 KB |
testcase_22 | AC | 46 ms
61,952 KB |
testcase_23 | AC | 532 ms
86,900 KB |
testcase_24 | AC | 410 ms
86,528 KB |
testcase_25 | AC | 409 ms
87,296 KB |
testcase_26 | WA | - |
testcase_27 | AC | 65 ms
72,832 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 464 ms
88,704 KB |
testcase_31 | AC | 782 ms
102,016 KB |
testcase_32 | AC | 917 ms
106,720 KB |
testcase_33 | AC | 788 ms
103,040 KB |
testcase_34 | AC | 898 ms
105,984 KB |
testcase_35 | AC | 727 ms
95,360 KB |
testcase_36 | AC | 726 ms
95,104 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]*h col = [0]*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] |= (1 << t-j)-1 << j else: if i > s: i, s = s, i col[j] |= (1 << s-i)-1 << i # for a in row: print(bin(a)[2:].zfill(w)) # for a in col: print(bin(a)[2:].zfill(h)) def push(ij): dist[ij] = d+1 q.append(ij) dist = [-1]*h*w q = deque([0]) dist[0] = 0 while q: ij = q.popleft() d = dist[ij] i, j = divmod(ij, w) if j and row[i] >> j-1 & 1 and dist[ij-1] == -1: push(ij-1) if j+1 < w and row[i] >> j & 1 and dist[ij+1] == -1: push(ij+1) if i and col[j] >> i-1 & 1 and dist[ij-w] == -1: push(ij-w) if i+1 < w and col[j] >> i & 1 and dist[ij+w] == -1: push(ij+w) # pDB(i,j,dist) ans = dist[-1] if ans == -1: ans = "Odekakedekinai.." print(ans)