結果
問題 | No.2928 Gridpath |
ユーザー | loop0919 |
提出日時 | 2024-09-13 01:13:56 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 243 ms / 2,000 ms |
コード長 | 1,089 bytes |
コンパイル時間 | 354 ms |
コンパイル使用メモリ | 82,356 KB |
実行使用メモリ | 78,868 KB |
最終ジャッジ日時 | 2024-09-13 01:14:00 |
合計ジャッジ時間 | 3,671 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
53,024 KB |
testcase_01 | AC | 37 ms
53,136 KB |
testcase_02 | AC | 175 ms
77,640 KB |
testcase_03 | AC | 37 ms
53,136 KB |
testcase_04 | AC | 36 ms
52,572 KB |
testcase_05 | AC | 48 ms
61,104 KB |
testcase_06 | AC | 149 ms
77,620 KB |
testcase_07 | AC | 37 ms
53,760 KB |
testcase_08 | AC | 39 ms
54,096 KB |
testcase_09 | AC | 99 ms
76,180 KB |
testcase_10 | AC | 42 ms
60,004 KB |
testcase_11 | AC | 37 ms
53,032 KB |
testcase_12 | AC | 35 ms
53,360 KB |
testcase_13 | AC | 37 ms
52,948 KB |
testcase_14 | AC | 36 ms
52,832 KB |
testcase_15 | AC | 164 ms
78,316 KB |
testcase_16 | AC | 174 ms
78,132 KB |
testcase_17 | AC | 158 ms
77,840 KB |
testcase_18 | AC | 147 ms
77,208 KB |
testcase_19 | AC | 243 ms
78,868 KB |
testcase_20 | AC | 37 ms
52,212 KB |
testcase_21 | AC | 174 ms
77,860 KB |
testcase_22 | AC | 179 ms
78,448 KB |
ソースコード
ways = [(0, 1), (0, -1), (1, 0), (-1, 0)] H, W = map(int, input().split()) S_i, S_j = map(lambda x: int(x) - 1, input().split()) G_i, G_j = map(lambda x: int(x) - 1, input().split()) grid = [[0 for _ in range(W)] for _ in range(H)] stack = [(0, S_i, S_j)] # 0: 行きがけ, 1: 戻りがけ ans = 0 def next_hop(i, j): for di, dj in ways: next_i, next_j = i + di, j + dj if 0 <= next_i < H and 0 <= next_j < W: yield next_i, next_j while stack: state, now_i, now_j = stack.pop() if now_i == G_i and now_j == G_j: ans += state continue if state == 0: grid[now_i][now_j] += 1 for next_i, next_j in next_hop(now_i, now_j): grid[next_i][next_j] += 1 for next_i, next_j in next_hop(now_i, now_j): if grid[next_i][next_j] <= 1: stack.append((1, next_i, next_j)) stack.append((0, next_i, next_j)) else: grid[now_i][now_j] -= 1 for next_i, next_j in next_hop(now_i, now_j): grid[next_i][next_j] -= 1 print(ans)