結果
問題 | No.340 雪の足跡 |
ユーザー | mkawa2 |
提出日時 | 2022-01-23 14:03:27 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,023 bytes |
コンパイル時間 | 191 ms |
コンパイル使用メモリ | 81,792 KB |
実行使用メモリ | 107,264 KB |
最終ジャッジ日時 | 2024-05-07 01:47:21 |
合計ジャッジ時間 | 13,870 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
54,528 KB |
testcase_01 | AC | 50 ms
54,400 KB |
testcase_02 | AC | 47 ms
54,016 KB |
testcase_03 | AC | 46 ms
54,144 KB |
testcase_04 | AC | 47 ms
54,272 KB |
testcase_05 | AC | 46 ms
53,888 KB |
testcase_06 | AC | 46 ms
53,888 KB |
testcase_07 | AC | 46 ms
53,888 KB |
testcase_08 | AC | 46 ms
54,360 KB |
testcase_09 | AC | 47 ms
54,144 KB |
testcase_10 | AC | 47 ms
54,144 KB |
testcase_11 | AC | 68 ms
66,944 KB |
testcase_12 | AC | 77 ms
69,120 KB |
testcase_13 | AC | 82 ms
72,064 KB |
testcase_14 | AC | 174 ms
78,212 KB |
testcase_15 | AC | 185 ms
78,592 KB |
testcase_16 | AC | 157 ms
77,376 KB |
testcase_17 | AC | 196 ms
79,116 KB |
testcase_18 | AC | 193 ms
78,708 KB |
testcase_19 | AC | 199 ms
79,416 KB |
testcase_20 | AC | 551 ms
88,448 KB |
testcase_21 | AC | 392 ms
77,632 KB |
testcase_22 | AC | 53 ms
62,080 KB |
testcase_23 | AC | 640 ms
87,024 KB |
testcase_24 | AC | 464 ms
87,128 KB |
testcase_25 | AC | 478 ms
87,704 KB |
testcase_26 | AC | 148 ms
76,764 KB |
testcase_27 | AC | 77 ms
72,704 KB |
testcase_28 | AC | 194 ms
78,336 KB |
testcase_29 | AC | 688 ms
94,808 KB |
testcase_30 | AC | 516 ms
88,500 KB |
testcase_31 | AC | 858 ms
102,400 KB |
testcase_32 | TLE | - |
testcase_33 | AC | 860 ms
103,296 KB |
testcase_34 | TLE | - |
testcase_35 | AC | 841 ms
95,360 KB |
testcase_36 | AC | 809 ms
95,232 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 = (1 << 63)-1 # inf = (1<<31)-1 # md = 10**9+7 md = 998244353 def main(): 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 if ij == h*w-1: return True q.append(ij) return False 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: if push(ij-1): break if j+1 < w and row[i] >> j & 1 and dist[ij+1] == -1: if push(ij+1): break if i and col[j] >> i-1 & 1 and dist[ij-w] == -1: if push(ij-w): break if i+1 < h and col[j] >> i & 1 and dist[ij+w] == -1: if push(ij+w): break # pDB(i,j,dist) ans = dist[-1] if ans == -1: ans = "Odekakedekinai.." print(ans) main()