結果
問題 | No.34 砂漠の行商人 |
ユーザー | uafr_cs |
提出日時 | 2015-09-16 20:56:57 |
言語 | Java21 (openjdk 21) |
結果 |
MLE
|
実行時間 | - |
コード長 | 2,810 bytes |
コンパイル時間 | 2,203 ms |
コンパイル使用メモリ | 75,176 KB |
実行使用メモリ | 686,108 KB |
最終ジャッジ日時 | 2023-09-26 12:15:35 |
合計ジャッジ時間 | 20,831 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
49,592 KB |
testcase_01 | AC | 46 ms
49,680 KB |
testcase_02 | AC | 63 ms
50,832 KB |
testcase_03 | AC | 49 ms
49,804 KB |
testcase_04 | AC | 185 ms
59,720 KB |
testcase_05 | AC | 188 ms
59,112 KB |
testcase_06 | AC | 81 ms
51,732 KB |
testcase_07 | AC | 302 ms
59,236 KB |
testcase_08 | AC | 275 ms
61,596 KB |
testcase_09 | AC | 1,102 ms
444,320 KB |
testcase_10 | AC | 623 ms
475,264 KB |
testcase_11 | MLE | - |
testcase_12 | AC | 206 ms
59,620 KB |
testcase_13 | AC | 2,728 ms
248,548 KB |
testcase_14 | AC | 2,152 ms
239,372 KB |
testcase_15 | AC | 156 ms
93,504 KB |
testcase_16 | AC | 394 ms
174,092 KB |
testcase_17 | AC | 126 ms
84,268 KB |
testcase_18 | AC | 126 ms
62,684 KB |
testcase_19 | AC | 891 ms
121,692 KB |
testcase_20 | AC | 1,324 ms
161,908 KB |
testcase_21 | AC | 101 ms
54,396 KB |
testcase_22 | AC | 216 ms
108,264 KB |
testcase_23 | AC | 200 ms
192,268 KB |
testcase_24 | AC | 1,573 ms
365,956 KB |
testcase_25 | AC | 273 ms
67,024 KB |
ソースコード
import java.io.BufferedReader; import java.io.Closeable; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.util.Arrays; import java.util.HashSet; import java.util.LinkedList; import java.util.Scanner; import java.util.Set; import java.util.StringTokenizer; public class Main { public static final int[][] move_dir = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}}; public static void main(String[] args) throws IOException { Scanner sc = new Scanner(System.in); final int N = sc.nextInt(); final int V = sc.nextInt(); final int Sx = sc.nextInt() - 1; final int Sy = sc.nextInt() - 1; final int Gx = sc.nextInt() - 1; final int Gy = sc.nextInt() - 1; int[][] damage = new int[N][N]; for(int i = 0; i < N; i++){ for(int j = 0; j < N; j++){ damage[i][j] = sc.nextInt(); } } int[][][] min_steps = new int[N][N][V + 1]; for(int i = 0; i < N; i++){ for(int j = 0; j < N; j++){ Arrays.fill(min_steps[i][j], Integer.MAX_VALUE); } } LinkedList<Integer> x_queue = new LinkedList<Integer>(); LinkedList<Integer> y_queue = new LinkedList<Integer>(); LinkedList<Integer> hp_queue = new LinkedList<Integer>(); min_steps[Sy][Sx][V] = 0; x_queue.add(Sx); y_queue.add(Sy); hp_queue.add(V); while(!hp_queue.isEmpty()){ final int x = x_queue.poll(); final int y = y_queue.poll(); final int hp = hp_queue.poll(); if(x == Gx && y == Gy){ System.out.println(min_steps[y][x][hp]); return; } for(final int[] move : move_dir){ final int nx = x + move[0]; final int ny = y + move[1]; if(nx < 0 || nx >= N || ny < 0 || ny >= N){ continue; } final int next_hp = hp - damage[ny][nx]; if(next_hp <= 0){ continue; } final int next_step = min_steps[y][x][hp] + 1; if(next_step < min_steps[ny][nx][next_hp]){ min_steps[ny][nx][next_hp] = next_step; x_queue.add(nx); y_queue.add(ny); hp_queue.add(next_hp); } } } System.out.println(-1); } public static class Scanner implements Closeable { private BufferedReader br; private StringTokenizer tok; public Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is)); } private void getLine() throws IOException { while (!hasNext()) { tok = new StringTokenizer(br.readLine()); } } private boolean hasNext() { return tok != null && tok.hasMoreTokens(); } public String next() throws IOException { getLine(); return tok.nextToken(); } public int nextInt() throws IOException { return Integer.parseInt(next()); } public long nextLong() throws IOException { return Long.parseLong(next()); } public void close() throws IOException { br.close(); } } }