結果
問題 | No.2928 Gridpath |
ユーザー |
👑 |
提出日時 | 2024-09-13 01:18:41 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 118 ms / 2,000 ms |
コード長 | 1,195 bytes |
コンパイル時間 | 158 ms |
コンパイル使用メモリ | 82,344 KB |
実行使用メモリ | 76,412 KB |
最終ジャッジ日時 | 2024-09-13 01:18:44 |
合計ジャッジ時間 | 2,437 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 20 |
ソースコード
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 = 0while stack:state, now_i, now_j = stack.pop()if now_i == G_i and now_j == G_j:ans += statecontinueif state == 0:grid[now_i][now_j] += 1for di, dj in ways:next_i, next_j = now_i + di, now_j + djif 0 <= next_i < H and 0 <= next_j < W:grid[next_i][next_j] += 1for di, dj in ways:next_i, next_j = now_i + di, now_j + djif not (0 <= next_i < H and 0 <= next_j < W):continueif 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] -= 1for di, dj in ways:next_i, next_j = now_i + di, now_j + djif 0 <= next_i < H and 0 <= next_j < W:grid[next_i][next_j] -= 1print(ans)