結果
問題 | No.367 ナイトの転身 |
ユーザー | はむ吉🐹 |
提出日時 | 2016-05-01 20:06:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 505 ms / 2,000 ms |
コード長 | 1,776 bytes |
コンパイル時間 | 239 ms |
コンパイル使用メモリ | 82,296 KB |
実行使用メモリ | 93,012 KB |
最終ジャッジ日時 | 2024-04-15 08:27:55 |
合計ジャッジ時間 | 4,517 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
55,244 KB |
testcase_01 | AC | 47 ms
56,568 KB |
testcase_02 | AC | 46 ms
54,840 KB |
testcase_03 | AC | 45 ms
55,636 KB |
testcase_04 | AC | 45 ms
55,992 KB |
testcase_05 | AC | 46 ms
55,644 KB |
testcase_06 | AC | 71 ms
64,756 KB |
testcase_07 | AC | 49 ms
54,576 KB |
testcase_08 | AC | 47 ms
54,972 KB |
testcase_09 | AC | 47 ms
55,120 KB |
testcase_10 | AC | 286 ms
86,296 KB |
testcase_11 | AC | 505 ms
93,012 KB |
testcase_12 | AC | 149 ms
79,100 KB |
testcase_13 | AC | 166 ms
79,824 KB |
testcase_14 | AC | 254 ms
81,836 KB |
testcase_15 | AC | 126 ms
77,388 KB |
testcase_16 | AC | 238 ms
81,444 KB |
testcase_17 | AC | 136 ms
77,964 KB |
testcase_18 | AC | 148 ms
77,656 KB |
testcase_19 | AC | 140 ms
78,168 KB |
testcase_20 | AC | 99 ms
77,320 KB |
testcase_21 | AC | 148 ms
78,048 KB |
testcase_22 | AC | 54 ms
64,072 KB |
testcase_23 | AC | 72 ms
74,440 KB |
testcase_24 | AC | 105 ms
77,120 KB |
testcase_25 | AC | 100 ms
77,148 KB |
testcase_26 | AC | 82 ms
76,396 KB |
ソースコード
#!/usr/bin/env pypy3 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()