#707952 (Java) No.1638 Robot Maze

• 問題: No.1638 Robot Maze
• ユーザー: watarimaycry2
• 提出日時: 2021-10-17 02:55:18
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 120 ms / 2,000 ms
• コード長: 5,653 bytes
• コンパイル時間: 2,608 ms
• コンパイル使用メモリ: 81,400 KB
• 実行使用メモリ: 53,160 KB
• 最終ジャッジ日時: 2024-09-17 19:36:21
• 合計ジャッジ時間: 8,759 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 49

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
import java.util.*; import java.io.*; import java.math.*;
public class Main{
    //見なくていいよ　ここから------------------------------------------
    static class InputIterator{
        ArrayList<String> inputLine = new ArrayList<>(buf);
        int index = 0; int max; String read;
        InputIterator(){
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            try{
                while((read = br.readLine()) != null){
                    inputLine.addAll(Arrays.asList(read.split(" ")));
                }
            }catch(IOException e){}
            max = inputLine.size();
        }
        boolean hasNext(){return (index < max);}
        String next(){
            if(hasNext()){
                return inputLine.get(index++);
            }else{
                throw new IndexOutOfBoundsException("There is no more input");
            }
        }
    }
    //入力バッファサイズのつもり。入力点数（スペース区切りでの要素数）が100万を超える場合はバッファサイズを100万にすること
    static int buf = 1024;
    static HashMap<Integer, String> CONVSTR = new HashMap<>();
    static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
    static PrintWriter out = new PrintWriter(System.out);
    static void flush(){out.flush();}
    static void myout(Object t){out.println(t);}
    static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
    static String next(){return ii.next();}
    static boolean hasNext(){return ii.hasNext();}
    static int nextInt(){return Integer.parseInt(next());}
    static long nextLong(){return Long.parseLong(next());}
    static double nextDouble(){return Double.parseDouble(next());}
    static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
    static ArrayList<String> nextStrArray(int size){
        ArrayList<String> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(next());
        }
        return ret;
    }
    static ArrayList<Integer> nextIntArray(int size){
        ArrayList<Integer> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(Integer.parseInt(next()));
        }
        return ret;
    }
    static ArrayList<Long> nextLongArray(int size){
        ArrayList<Long> ret = new ArrayList<>(size);
        for(int i = 0; i < size; i++){
            ret.add(Long.parseLong(next()));
        }
        return ret;
    }
    @SuppressWarnings("unchecked")
    static String myconv(Object list, int no){//only join
        StringBuilder sb = new StringBuilder("");
        String joinString = CONVSTR.get(no);
        if(list instanceof String[]){
            return String.join(joinString, (String[])list);
        }else if(list instanceof long[]){
            long[] tmp = (long[])list;
            if(tmp.length == 0){
                return "";
            }
            sb.append(String.valueOf(tmp[0]));
            for(int i = 1; i < tmp.length; i++){
                sb.append(joinString).append(String.valueOf(tmp[i]));
            }
            return sb.toString();
        }else if(list instanceof int[]){
            int[] tmp = (int[])list;
            if(tmp.length == 0){
                return "";
            }
            sb.append(String.valueOf(tmp[0]));
            for(int i = 1; i < tmp.length; i++){
                sb.append(joinString).append(String.valueOf(tmp[i]));
            }
            return sb.toString();
        }else if(list instanceof ArrayList){
            ArrayList tmp = (ArrayList)list;
            if(tmp.size() == 0){
                return "";
            }
            sb.append(tmp.get(0));
            for(int i = 1; i < tmp.size(); i++){
                sb.append(joinString).append(tmp.get(i));
            }
            return sb.toString();
        }else{
            throw new ClassCastException("Don't join");
        }
    }
    static ArrayList<String> myconv(String str, int no){//only split
        String splitString = CONVSTR.get(no);
        return new ArrayList<String>(Arrays.asList(str.split(splitString)));
    }
    static ArrayList<String> myconv(String str, String no){
        return new ArrayList<String>(Arrays.asList(str.split(no)));
    }
    public static void main(String[] args){
        CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
        solve();flush();
    }
    //見なくていいよ　ここまで------------------------------------------
    //このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
    static void solve(){//ここがメイン関数
        int H = nextInt();
        int W = nextInt();
        int[][] d = {{-1,0,nextInt()}, {1,0,nextInt()}, {0,1,nextInt()}, {0,-1,nextInt()}};//U, D, R, L
        long K = nextLong();
        int P = nextInt();
        int sy = nextInt() - 1;
        int sx = nextInt() - 1;
        int ey = nextInt() - 1;
        int ex = nextInt() - 1;
        Node[][] list = new Node[H][W];
        for(int i = 0; i < H; i++){
            String s = next();
            for(int j = 0; j < W; j++){
                list[i][j] = new Node(s.substring(j, j + 1));
            }
        }
        PriorityQueue<Q> pq = new PriorityQueue<>();
        pq.add(new Q(sy, sx, 0l));
        while(pq.size() > 0){
            Q now = pq.poll();
            int y = now.y;
            int x = now.x;
            long cost = now.cost;
            if(list[y][x].cost <= cost){
                continue;
            }
            list[y][x].cost = cost;
            for(int i = 0; i < d.length; i++){
                int nextY = y + d[i][0];
                int nextX = x + d[i][1];
                if(nextY >= 0 && nextY < H && nextX >= 0 && nextX < W){
                    if(list[nextY][nextX].s.equals("#")){
                        continue;
                    }
                    long nextCost = cost + d[i][2];
                    if(list[nextY][nextX].s.equals("@")){
                        nextCost += P;
                    }
                    if(list[nextY][nextX].cost > nextCost){
                        pq.add(new Q(nextY, nextX, nextCost));
                    }
                }
            }
        }
        
        if(list[ey][ex].cost <= K){
            myout("Yes");
        }else{
            myout("No");
        }
    }
    //メソッド追加エリア　ここから
static class Q implements Comparable<Q>{
    int y;
    int x;
    long cost;
    Q(int y, int x, long cost){
        this.x = x;
        this.y = y;
        this.cost = cost;
    }
    public int compareTo(Q ato){
        return Long.compare(this.cost, ato.cost);
    }
}
static class Node{
    long cost = 1l << 62;
    String s;
    Node(String s){
        this.s = s;
    }
}
    //メソッド追加エリア　ここまで
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX