結果
問題 | No.1638 Robot Maze |
ユーザー | nishi5451 |
提出日時 | 2021-08-07 11:43:19 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 103 ms / 2,000 ms |
コード長 | 3,939 bytes |
コンパイル時間 | 3,535 ms |
コンパイル使用メモリ | 79,432 KB |
実行使用メモリ | 55,192 KB |
最終ジャッジ日時 | 2023-10-17 18:13:02 |
合計ジャッジ時間 | 9,471 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
52,468 KB |
testcase_01 | AC | 54 ms
53,568 KB |
testcase_02 | AC | 54 ms
53,576 KB |
testcase_03 | AC | 97 ms
54,836 KB |
testcase_04 | AC | 56 ms
53,580 KB |
testcase_05 | AC | 56 ms
52,524 KB |
testcase_06 | AC | 55 ms
53,572 KB |
testcase_07 | AC | 57 ms
52,532 KB |
testcase_08 | AC | 55 ms
53,568 KB |
testcase_09 | AC | 55 ms
53,572 KB |
testcase_10 | AC | 54 ms
53,568 KB |
testcase_11 | AC | 55 ms
53,588 KB |
testcase_12 | AC | 54 ms
53,572 KB |
testcase_13 | AC | 55 ms
53,580 KB |
testcase_14 | AC | 81 ms
54,932 KB |
testcase_15 | AC | 73 ms
53,696 KB |
testcase_16 | AC | 72 ms
53,676 KB |
testcase_17 | AC | 74 ms
53,676 KB |
testcase_18 | AC | 67 ms
53,680 KB |
testcase_19 | AC | 74 ms
54,160 KB |
testcase_20 | AC | 75 ms
53,696 KB |
testcase_21 | AC | 70 ms
53,612 KB |
testcase_22 | AC | 71 ms
53,684 KB |
testcase_23 | AC | 71 ms
53,596 KB |
testcase_24 | AC | 71 ms
54,160 KB |
testcase_25 | AC | 70 ms
54,116 KB |
testcase_26 | AC | 72 ms
54,176 KB |
testcase_27 | AC | 72 ms
54,160 KB |
testcase_28 | AC | 73 ms
54,164 KB |
testcase_29 | AC | 72 ms
54,108 KB |
testcase_30 | AC | 54 ms
53,568 KB |
testcase_31 | AC | 56 ms
53,572 KB |
testcase_32 | AC | 83 ms
54,468 KB |
testcase_33 | AC | 90 ms
54,848 KB |
testcase_34 | AC | 95 ms
54,736 KB |
testcase_35 | AC | 83 ms
54,468 KB |
testcase_36 | AC | 100 ms
55,192 KB |
testcase_37 | AC | 98 ms
52,820 KB |
testcase_38 | AC | 85 ms
54,872 KB |
testcase_39 | AC | 90 ms
54,668 KB |
testcase_40 | AC | 84 ms
54,960 KB |
testcase_41 | AC | 103 ms
54,736 KB |
testcase_42 | AC | 101 ms
54,452 KB |
testcase_43 | AC | 92 ms
55,172 KB |
testcase_44 | AC | 100 ms
54,840 KB |
testcase_45 | AC | 98 ms
54,732 KB |
testcase_46 | AC | 90 ms
54,496 KB |
testcase_47 | AC | 96 ms
54,816 KB |
testcase_48 | AC | 90 ms
54,796 KB |
testcase_49 | AC | 82 ms
54,796 KB |
testcase_50 | AC | 101 ms
54,936 KB |
testcase_51 | AC | 94 ms
54,900 KB |
ソースコード
import java.util.*; import java.io.*; class Node implements Comparable<Node>{ int x,y; long cost; Node(int x, int y, long cost){ this.x = x; this.y = y; this.cost = cost; } @Override public int compareTo(Node another){ if(this.cost > another.cost) return 1; else if(this.cost < another.cost) return -1; else return 0; } } public class Main { static final int INF = 1<<30; static final long INFL = 1L<<60; static final int MOD = 1000000007; static final int MOD2 = 998244353; static List<List<Integer>> g; public static void main(String[] args) { FastScanner fs = new FastScanner(); PrintWriter pw = new PrintWriter(System.out); int h = fs.nextInt(); int w = fs.nextInt(); int U = fs.nextInt(); int D = fs.nextInt(); int R = fs.nextInt(); int L = fs.nextInt(); long K = fs.nextLong(); long P = fs.nextLong(); int sy = fs.nextInt() - 1; int sx = fs.nextInt() - 1; int ty = fs.nextInt() - 1; int tx = fs.nextInt() - 1; char[][] s = fs.nextCharMat(h, w); int[] dx = {1,-1,0,0}; int[] dy = {0,0,1,-1}; long[][] dist = new long[h][w]; for(int i = 0; i < h; i++) Arrays.fill(dist[i],INFL); Queue<Node> que = new PriorityQueue<>(); que.add(new Node(sx,sy,0)); dist[sy][sx] = 0; while(!que.isEmpty()){ Node node = que.poll(); int x = node.x; int y = node.y; long cost = node.cost; if(cost > dist[y][x]) continue; for(int i = 0; i < 4; i++){ int nx = x + dx[i]; int ny = y + dy[i]; if(nx < 0 || ny < 0 || nx > w-1 || ny > h-1) continue; if(s[ny][nx] == '#') continue; long ncost = 0; if(s[ny][nx] == '@') ncost += P; if(i == 0) ncost += R; else if(i == 1) ncost += L; else if(i == 2) ncost += D; else ncost += U; if(dist[ny][nx] > dist[y][x] + ncost){ dist[ny][nx] = dist[y][x] + ncost; que.add(new Node(nx,ny,dist[ny][nx])); } } } if(dist[ty][tx] <= K) pw.println("Yes"); else pw.println("No"); pw.close(); } } class FastScanner { private InputStream in = System.in; private byte[] buffer = new byte[1024]; private int length = 0, p = 0; private boolean hasNextByte() { if (p < length) return true; else{ p = 0; try{ length = in.read(buffer); }catch(Exception e){ e.printStackTrace(); } if(length == 0) return false; } return true; } private int readByte() { if (hasNextByte() == true) return buffer[p++]; return -1; } private static boolean isPrintable(int n) { return 33 <= n && n <= 126; } private void skip() { while (hasNextByte() && !isPrintable(buffer[p])) p++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int temp = readByte(); while (isPrintable(temp)) { sb.appendCodePoint(temp); temp = readByte(); } return sb.toString(); } public int nextInt() { return Math.toIntExact(nextLong()); } public int[] nextInts(int n) { int[] ar = new int[n]; for (int i = 0; i < n; i++) ar[i] = nextInt(); return ar; } public long[] nextLongs(int n) { long[] ar = new long[n]; for (int i = 0; i < n; i++) ar[i] = nextLong(); return ar; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); boolean minus = false; int temp = readByte(); if (temp == '-') { minus = true; temp = readByte(); } if (temp < '0' || '9' < temp) throw new NumberFormatException(); long n = 0; while (isPrintable(temp)) { if ('0' <= temp && temp <= '9') { n *= 10; n += temp - '0'; } temp = readByte(); } return minus ? -n : n; } public char[] nextChars() { String s = next(); return s.toCharArray(); } public char[][] nextCharMat(int h, int w) { char[][] ar = new char[h][w]; for(int i = 0; i < h; i++){ String s = next(); for(int j = 0; j < w; j++){ ar[i][j] = s.charAt(j); } } return ar; } }