結果
問題 | No.367 ナイトの転身 |
ユーザー | rpy3cpp |
提出日時 | 2016-05-28 10:11:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 254 ms / 2,000 ms |
コード長 | 1,800 bytes |
コンパイル時間 | 259 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 82,560 KB |
最終ジャッジ日時 | 2024-04-16 18:04:23 |
合計ジャッジ時間 | 3,329 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
52,096 KB |
testcase_01 | AC | 41 ms
52,224 KB |
testcase_02 | AC | 42 ms
52,352 KB |
testcase_03 | AC | 41 ms
51,968 KB |
testcase_04 | AC | 41 ms
51,840 KB |
testcase_05 | AC | 42 ms
52,096 KB |
testcase_06 | AC | 48 ms
53,760 KB |
testcase_07 | AC | 44 ms
52,096 KB |
testcase_08 | AC | 41 ms
51,968 KB |
testcase_09 | AC | 41 ms
52,224 KB |
testcase_10 | AC | 186 ms
82,176 KB |
testcase_11 | AC | 254 ms
82,560 KB |
testcase_12 | AC | 101 ms
78,720 KB |
testcase_13 | AC | 98 ms
78,464 KB |
testcase_14 | AC | 125 ms
78,336 KB |
testcase_15 | AC | 80 ms
71,424 KB |
testcase_16 | AC | 127 ms
77,568 KB |
testcase_17 | AC | 93 ms
76,288 KB |
testcase_18 | AC | 99 ms
76,160 KB |
testcase_19 | AC | 89 ms
76,288 KB |
testcase_20 | AC | 65 ms
65,792 KB |
testcase_21 | AC | 97 ms
76,800 KB |
testcase_22 | AC | 43 ms
52,480 KB |
testcase_23 | AC | 58 ms
61,696 KB |
testcase_24 | AC | 68 ms
66,944 KB |
testcase_25 | AC | 69 ms
66,432 KB |
testcase_26 | AC | 58 ms
62,336 KB |
ソースコード
def read_data(): H, W = map(int, input().split()) s = [input() for i in range(H)] return H, W, s def parse_board(H, W, s): reds = [False] * (H * W) start = -1 goal = -1 for h in range(H): sh = s[h] for w in range(W): c = sh[w] if c == 'S': start = h * W + w elif c == 'G': goal = h * W + w elif c == 'R': reds[h * W + w] = True return reds, start, goal def solve(H, W, s): next_move = [(), ()] next_move[0] = ((-2, -1), (-2, 1), (-1, -2), (-1, 2), (1, -2), (1, 2), (2, -1), (2, 1)) next_move[1] = ((-1, -1), (-1, 1), (1, -1), (1, 1)) reds, start, goal = parse_board(H, W, s) return wfs(start, goal, reds, H, W, next_move) def wfs(start, goal, reds, H, W, next_move): HW = H * W dist = [-1] * (HW * 2) goals = [goal, goal + HW] steps = 0 state = 0 frontiers = [start] dist[start] = 0 while frontiers: steps += 1 new_frontiers = [] for spos in frontiers: state, pos = divmod(spos, HW) h, w = divmod(pos, W) for dh, dw in next_move[state]: nh = h + dh nw = w + dw if 0 <= nh < H and 0 <= nw < W: npos = nh * W + nw new_state = 1 - state if reds[npos] else state nspos = new_state * HW + npos if dist[nspos] == -1: dist[nspos] = steps new_frontiers.append(nspos) if nspos in goals: return steps frontiers = new_frontiers return -1 if __name__ == '__main__': pars = read_data() print(solve(*pars))