結果
問題 | No.1638 Robot Maze |
ユーザー | yudai1102jp |
提出日時 | 2021-08-06 23:47:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 185 ms / 2,000 ms |
コード長 | 1,877 bytes |
コンパイル時間 | 170 ms |
コンパイル使用メモリ | 81,544 KB |
実行使用メモリ | 77,612 KB |
最終ジャッジ日時 | 2023-10-17 05:41:01 |
合計ジャッジ時間 | 6,560 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
53,300 KB |
testcase_01 | AC | 42 ms
53,300 KB |
testcase_02 | AC | 40 ms
53,300 KB |
testcase_03 | AC | 130 ms
76,664 KB |
testcase_04 | AC | 41 ms
53,312 KB |
testcase_05 | AC | 42 ms
53,312 KB |
testcase_06 | AC | 41 ms
53,312 KB |
testcase_07 | AC | 41 ms
53,312 KB |
testcase_08 | AC | 42 ms
53,312 KB |
testcase_09 | AC | 41 ms
53,312 KB |
testcase_10 | AC | 42 ms
53,312 KB |
testcase_11 | AC | 41 ms
53,312 KB |
testcase_12 | AC | 42 ms
53,312 KB |
testcase_13 | AC | 42 ms
53,312 KB |
testcase_14 | AC | 114 ms
76,132 KB |
testcase_15 | AC | 106 ms
76,076 KB |
testcase_16 | AC | 108 ms
76,076 KB |
testcase_17 | AC | 113 ms
76,872 KB |
testcase_18 | AC | 43 ms
55,360 KB |
testcase_19 | AC | 106 ms
76,072 KB |
testcase_20 | AC | 107 ms
76,072 KB |
testcase_21 | AC | 65 ms
75,512 KB |
testcase_22 | AC | 67 ms
75,492 KB |
testcase_23 | AC | 67 ms
75,500 KB |
testcase_24 | AC | 68 ms
75,512 KB |
testcase_25 | AC | 66 ms
75,512 KB |
testcase_26 | AC | 71 ms
75,716 KB |
testcase_27 | AC | 71 ms
75,716 KB |
testcase_28 | AC | 72 ms
75,716 KB |
testcase_29 | AC | 71 ms
75,720 KB |
testcase_30 | AC | 39 ms
53,312 KB |
testcase_31 | AC | 39 ms
53,312 KB |
testcase_32 | AC | 125 ms
76,400 KB |
testcase_33 | AC | 131 ms
76,820 KB |
testcase_34 | AC | 114 ms
76,548 KB |
testcase_35 | AC | 141 ms
77,296 KB |
testcase_36 | AC | 141 ms
76,836 KB |
testcase_37 | AC | 118 ms
76,368 KB |
testcase_38 | AC | 128 ms
76,540 KB |
testcase_39 | AC | 124 ms
76,780 KB |
testcase_40 | AC | 147 ms
76,964 KB |
testcase_41 | AC | 126 ms
76,720 KB |
testcase_42 | AC | 148 ms
77,032 KB |
testcase_43 | AC | 185 ms
77,612 KB |
testcase_44 | AC | 148 ms
76,844 KB |
testcase_45 | AC | 137 ms
76,600 KB |
testcase_46 | AC | 133 ms
76,684 KB |
testcase_47 | AC | 120 ms
76,572 KB |
testcase_48 | AC | 131 ms
76,884 KB |
testcase_49 | AC | 122 ms
76,240 KB |
testcase_50 | AC | 134 ms
76,820 KB |
testcase_51 | AC | 134 ms
76,688 KB |
ソースコード
import sys import heapq sys.setrecursionlimit(10**6) # 再帰関数使う時有効 H, W = map(int, input().split()) U, D, R, L, K, P = map(int, input().split()) x, y, xt, yt = map(int, input().split()) start = [x-1, y-1] goal = [xt-1, yt-1] goal_n = goal[0]*W+goal[1] allow = [[1, 0], [0, 1], [-1, 0], [0, -1]] allow_cost = [D, R, U, L] C = [input() for i in range(H)] # def fps(now, cost): # if now == goal: # return cost # ans = 10**13+8 # for i in range(4): # nextx = now[0]+allow[i][0] # nexty = now[1]+allow[i][1] # if not (0 <= nextx < H and 0 <= nexty < W): # continue # if C[nextx][nexty] == '.': # new_cost = cost+allow_cost[i] # elif C[nextx][nexty] == '@': # new_cost = cost+allow_cost[i]+P # else: # continue # ans = min(ans, fps([nextx, nexty], new_cost)) # return ans dp = [[-1]*W for i in range(H)] dp[start[0]][start[1]] = 0 q = [] heapq.heapify(q) heapq.heappush(q, (0, start)) ok = set() while q: cost, now = heapq.heappop(q) # now_n = [now_n//W, now_n % W] now_n = now*W+now if now_n == goal_n: break ok.add(now[0]*W+now[1]) for i in range(4): nextx = now[0]+allow[i][0] nexty = now[1]+allow[i][1] if (not (0 <= nextx < H and 0 <= nexty < W)) or C[nextx][nexty] == '#' or nextx*W+nexty in ok: continue if C[nextx][nexty] == '.': new_cost = dp[now[0]][now[1]]+allow_cost[i] elif C[nextx][nexty] == '@': new_cost = dp[now[0]][now[1]]+allow_cost[i]+P if dp[nextx][nexty] == -1 or dp[nextx][nexty] > new_cost: dp[nextx][nexty] = new_cost heapq.heappush(q, (new_cost, [nextx, nexty])) if dp[goal[0]][goal[1]] <= K and dp[goal[0]][goal[1]] != -1: print('Yes') else: print('No')