結果
問題 | No.340 雪の足跡 |
ユーザー | mkawa2 |
提出日時 | 2022-01-23 13:53:43 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,844 bytes |
コンパイル時間 | 441 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 34,176 KB |
最終ジャッジ日時 | 2024-05-07 01:35:48 |
合計ジャッジ時間 | 6,348 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
34,176 KB |
testcase_01 | AC | 29 ms
11,008 KB |
testcase_02 | AC | 29 ms
10,752 KB |
testcase_03 | AC | 30 ms
11,008 KB |
testcase_04 | AC | 29 ms
11,008 KB |
testcase_05 | AC | 29 ms
11,008 KB |
testcase_06 | AC | 29 ms
11,008 KB |
testcase_07 | AC | 29 ms
11,008 KB |
testcase_08 | AC | 29 ms
11,008 KB |
testcase_09 | AC | 30 ms
10,880 KB |
testcase_10 | AC | 30 ms
10,880 KB |
testcase_11 | AC | 42 ms
11,008 KB |
testcase_12 | AC | 39 ms
10,752 KB |
testcase_13 | AC | 45 ms
11,008 KB |
testcase_14 | AC | 280 ms
12,928 KB |
testcase_15 | AC | 303 ms
13,184 KB |
testcase_16 | AC | 186 ms
11,264 KB |
testcase_17 | AC | 373 ms
13,440 KB |
testcase_18 | AC | 350 ms
13,440 KB |
testcase_19 | AC | 385 ms
13,568 KB |
testcase_20 | TLE | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
ソースコード
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 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)