結果
問題 | No.367 ナイトの転身 |
ユーザー | はむ吉🐹 |
提出日時 | 2016-05-01 20:06:57 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,778 bytes |
コンパイル時間 | 159 ms |
コンパイル使用メモリ | 12,928 KB |
実行使用メモリ | 15,744 KB |
最終ジャッジ日時 | 2024-04-15 08:29:10 |
合計ジャッジ時間 | 7,446 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 33 ms
11,264 KB |
testcase_01 | AC | 35 ms
11,136 KB |
testcase_02 | AC | 32 ms
11,136 KB |
testcase_03 | AC | 34 ms
11,136 KB |
testcase_04 | AC | 33 ms
11,136 KB |
testcase_05 | AC | 33 ms
11,136 KB |
testcase_06 | AC | 35 ms
11,264 KB |
testcase_07 | AC | 33 ms
11,008 KB |
testcase_08 | AC | 34 ms
11,136 KB |
testcase_09 | AC | 33 ms
11,136 KB |
testcase_10 | AC | 1,419 ms
15,616 KB |
testcase_11 | TLE | - |
testcase_12 | AC | 172 ms
12,928 KB |
testcase_13 | AC | 225 ms
12,928 KB |
testcase_14 | AC | 544 ms
12,928 KB |
testcase_15 | AC | 46 ms
11,264 KB |
testcase_16 | AC | 538 ms
12,672 KB |
testcase_17 | AC | 106 ms
11,264 KB |
testcase_18 | AC | 138 ms
11,392 KB |
testcase_19 | AC | 128 ms
11,648 KB |
testcase_20 | AC | 52 ms
11,264 KB |
testcase_21 | AC | 133 ms
11,520 KB |
testcase_22 | AC | 33 ms
11,264 KB |
testcase_23 | AC | 37 ms
11,136 KB |
testcase_24 | AC | 43 ms
11,264 KB |
testcase_25 | AC | 40 ms
11,136 KB |
testcase_26 | AC | 36 ms
11,136 KB |
ソースコード
#!/usr/bin/env python3 import array import collections DS_KNIGHT = [(1, 2), (-1, -2), (1, -2), (-1, 2), (2, 1), (-2, -1), (2, -1), (-2, 1)] DS_MB = [(1, 1), (-1, -1), (1, -1), (-1, 1)] INF = 10 ** 8 Status = collections.namedtuple("Status", "is_knight r c") def min_num_of_operations(height, width, board, start, goal): s_start = Status(True, start[0], start[1]) dist = [[array.array("L", (INF for _ in range(width))) for _ in range(height)] for _ in range(2)] dist[s_start.is_knight][s_start.r][s_start.c] = 0 q = collections.deque() q.append(s_start) while q: s0 = q.popleft() if (s0.r, s0.c) == goal: break for dr, dc in (DS_KNIGHT if s0.is_knight else DS_MB): (r, c) = (s0.r + dr, s0.c + dc) if r < 0 or r >= height or c < 0 or c >= width: continue else: new_type = s0.is_knight ^ (board[r][c] == 'R') if dist[int(new_type)][r][c] >= INF: s = Status(new_type, r, c) q.append(s) dist[int(new_type)][r][c] = dist[int(s0.is_knight)][s0.r][s0.c] + 1 return min(dist[True][goal[0]][goal[1]], dist[False][goal[0]][goal[1]]) def main(): height, width = map(int, input().split()) board = [] start = None goal = None for r in range(height): row = input() if start is None or goal is None: for c in range(width): if row[c] == "S": start = (r, c) elif row[c] == "G": goal = (r, c) board.append(row) ans = min_num_of_operations(height, width, board, start, goal) print(ans if ans < INF else -1) if __name__ == '__main__': main()