結果

問題 No.1638 Robot Maze
ユーザー nishi5451
提出日時 2021-08-07 11:43:19
言語 Java
(openjdk 23)
結果
AC  
実行時間 98 ms / 2,000 ms
コード長 3,939 bytes
コンパイル時間 2,522 ms
コンパイル使用メモリ 79,332 KB
実行使用メモリ 51,772 KB
最終ジャッジ日時 2024-09-17 15:29:51
合計ジャッジ時間 7,279 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 49
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0