結果
問題 | No.1638 Robot Maze |
ユーザー | puzneko |
提出日時 | 2021-12-02 23:42:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 217 ms / 2,000 ms |
コード長 | 2,228 bytes |
コンパイル時間 | 267 ms |
コンパイル使用メモリ | 87,112 KB |
実行使用メモリ | 80,892 KB |
最終ジャッジ日時 | 2023-09-18 11:07:45 |
合計ジャッジ時間 | 8,600 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 82 ms
71,092 KB |
testcase_01 | AC | 79 ms
71,440 KB |
testcase_02 | AC | 79 ms
71,228 KB |
testcase_03 | AC | 145 ms
78,676 KB |
testcase_04 | AC | 80 ms
71,480 KB |
testcase_05 | AC | 81 ms
71,484 KB |
testcase_06 | AC | 81 ms
71,296 KB |
testcase_07 | AC | 80 ms
71,232 KB |
testcase_08 | AC | 80 ms
71,388 KB |
testcase_09 | AC | 79 ms
71,172 KB |
testcase_10 | AC | 78 ms
71,376 KB |
testcase_11 | AC | 77 ms
71,256 KB |
testcase_12 | AC | 79 ms
71,040 KB |
testcase_13 | AC | 79 ms
71,344 KB |
testcase_14 | AC | 116 ms
78,580 KB |
testcase_15 | AC | 134 ms
78,836 KB |
testcase_16 | AC | 133 ms
78,692 KB |
testcase_17 | AC | 140 ms
78,844 KB |
testcase_18 | AC | 86 ms
76,228 KB |
testcase_19 | AC | 134 ms
78,728 KB |
testcase_20 | AC | 133 ms
78,624 KB |
testcase_21 | AC | 101 ms
77,048 KB |
testcase_22 | AC | 104 ms
77,156 KB |
testcase_23 | AC | 105 ms
77,116 KB |
testcase_24 | AC | 106 ms
77,268 KB |
testcase_25 | AC | 104 ms
77,244 KB |
testcase_26 | AC | 115 ms
78,052 KB |
testcase_27 | AC | 114 ms
77,784 KB |
testcase_28 | AC | 115 ms
77,696 KB |
testcase_29 | AC | 114 ms
77,900 KB |
testcase_30 | AC | 79 ms
71,176 KB |
testcase_31 | AC | 80 ms
71,260 KB |
testcase_32 | AC | 157 ms
79,160 KB |
testcase_33 | AC | 169 ms
79,264 KB |
testcase_34 | AC | 148 ms
79,184 KB |
testcase_35 | AC | 200 ms
79,940 KB |
testcase_36 | AC | 150 ms
79,448 KB |
testcase_37 | AC | 181 ms
79,888 KB |
testcase_38 | AC | 90 ms
76,240 KB |
testcase_39 | AC | 187 ms
80,204 KB |
testcase_40 | AC | 172 ms
79,552 KB |
testcase_41 | AC | 199 ms
79,672 KB |
testcase_42 | AC | 121 ms
79,060 KB |
testcase_43 | AC | 217 ms
80,892 KB |
testcase_44 | AC | 180 ms
79,920 KB |
testcase_45 | AC | 120 ms
77,956 KB |
testcase_46 | AC | 145 ms
79,240 KB |
testcase_47 | AC | 194 ms
80,312 KB |
testcase_48 | AC | 149 ms
79,072 KB |
testcase_49 | AC | 188 ms
80,096 KB |
testcase_50 | AC | 176 ms
79,556 KB |
testcase_51 | AC | 171 ms
79,636 KB |
ソースコード
from sys import stdin from heapq import heappush, heappop h, w = [int(x) for x in stdin.readline().rstrip().split()] u, d, r, l, k, p = [int(x) for x in stdin.readline().rstrip().split()] xs, ys, xt, yt = [int(x) for x in stdin.readline().rstrip().split()] c = [stdin.readline().rstrip() for _ in range(h)] kabe = ["#" for i in range(w+2)] data = [kabe] for i in range(h): kari = ["#"] for j in range(w): kari.append(c[i][j]) kari.append("#") data.append(kari) data.append(kabe) hq = [(0,xs,ys)] infty = 10**18 dist = [[infty for i in range(w+2)] for j in range(h+2)] done = [[False for i in range(w+2)] for j in range(h+2)] dist[xs][ys] = 0 while hq: cost, nowx, nowy = heappop(hq) if not done[nowx][nowy]: if (nowx == xt) & (nowy == yt): if cost <= k: print("Yes") else: print("No") exit() done[nowx][nowy] = True if (data[nowx-1][nowy] != "#") & (not done[nowx-1][nowy]): nextcost = cost + u if data[nowx-1][nowy] == "@": nextcost += p if (dist[nowx-1][nowy] > nextcost): dist[nowx-1][nowy] = nextcost heappush(hq, (nextcost, nowx-1, nowy)) if (data[nowx+1][nowy] != "#") & (not done[nowx+1][nowy]): nextcost = cost + d if data[nowx+1][nowy] == "@": nextcost += p if (dist[nowx+1][nowy] > nextcost): dist[nowx+1][nowy] = nextcost heappush(hq, (nextcost, nowx+1, nowy)) if (data[nowx][nowy-1] != "#") & (not done[nowx][nowy-1]): nextcost = cost + l if data[nowx][nowy-1] == "@": nextcost += p if (dist[nowx][nowy-1] > nextcost): dist[nowx][nowy-1] = nextcost heappush(hq, (nextcost, nowx, nowy-1)) if (data[nowx][nowy+1] != "#") & (not done[nowx][nowy+1]): nextcost = cost + r if data[nowx][nowy+1] == "@": nextcost += p if (dist[nowx][nowy+1] > nextcost): dist[nowx][nowy+1] = nextcost heappush(hq, (nextcost, nowx, nowy+1)) print("No")