結果
問題 | No.34 砂漠の行商人 |
ユーザー | uwi |
提出日時 | 2015-02-17 02:43:41 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,949 ms / 5,000 ms |
コード長 | 4,348 bytes |
コンパイル時間 | 4,195 ms |
コンパイル使用メモリ | 80,512 KB |
実行使用メモリ | 178,104 KB |
最終ジャッジ日時 | 2023-09-10 19:02:26 |
合計ジャッジ時間 | 30,504 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 87 ms
52,460 KB |
testcase_01 | AC | 101 ms
54,436 KB |
testcase_02 | AC | 176 ms
60,632 KB |
testcase_03 | AC | 172 ms
60,516 KB |
testcase_04 | AC | 543 ms
87,380 KB |
testcase_05 | AC | 662 ms
98,280 KB |
testcase_06 | AC | 395 ms
76,632 KB |
testcase_07 | AC | 921 ms
114,516 KB |
testcase_08 | AC | 1,314 ms
147,392 KB |
testcase_09 | AC | 1,033 ms
117,796 KB |
testcase_10 | AC | 1,488 ms
173,752 KB |
testcase_11 | AC | 942 ms
175,944 KB |
testcase_12 | AC | 595 ms
90,504 KB |
testcase_13 | AC | 1,873 ms
178,104 KB |
testcase_14 | AC | 1,916 ms
174,308 KB |
testcase_15 | AC | 630 ms
94,824 KB |
testcase_16 | AC | 604 ms
90,280 KB |
testcase_17 | AC | 1,094 ms
117,084 KB |
testcase_18 | AC | 212 ms
60,820 KB |
testcase_19 | AC | 1,937 ms
167,964 KB |
testcase_20 | AC | 1,949 ms
173,872 KB |
testcase_21 | AC | 1,849 ms
176,016 KB |
testcase_22 | AC | 1,605 ms
165,616 KB |
testcase_23 | AC | 808 ms
106,508 KB |
testcase_24 | AC | 1,681 ms
169,636 KB |
testcase_25 | AC | 1,045 ms
116,860 KB |
ソースコード
package q0xx; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.Arrays; import java.util.InputMismatchException; import java.util.Queue; public class Q15_2 { static InputStream is; static PrintWriter out; static String INPUT = ""; static void solve() { int n = ni(), v = ni(); int sc = ni()-1, sr = ni()-1; int tc = ni()-1, tr = ni()-1; int[][] a = new int[n][]; for(int i = 0;i < n;i++){ a[i] = na(n); } int[][][] dp = new int[1801][n][n]; int I = 99999999; for(int i = 0;i < 1801;i++){ for(int j = 0;j < n;j++){ Arrays.fill(dp[i][j], I); } } Queue<Integer> q = new ArrayDeque<Integer>(); q.add(0<<14|sr<<7|sc); dp[0][sr][sc] = 0; int[] dr = { 1, 0, -1, 0 }; int[] dc = { 0, 1, 0, -1 }; while(!q.isEmpty()){ int cur = q.poll(); int dmg = cur>>>14, r = cur>>>7&127, c = cur&127; for(int k = 0;k < 4;k++){ int nr = r + dr[k], nc = c + dc[k]; if(nr >= 0 && nr < n && nc >= 0 && nc < n){ int ndmg = dmg + a[nr][nc]; if(ndmg <= 1800 && dp[ndmg][nr][nc] > dp[dmg][r][c] + 1){ dp[ndmg][nr][nc] = dp[dmg][r][c] + 1; q.add(ndmg<<14|nr<<7|nc); } } } } int mind = I; for(int i = Math.min(1800, v-1);i >= 0;i--){ mind = Math.min(mind, dp[i][tr][tc]); } out.println(mind == I ? -1 : mind); } public static void main(String[] args) throws Exception { long S = System.currentTimeMillis(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); tr(G-S+"ms"); } private static boolean eof() { if(lenbuf == -1)return true; int lptr = ptrbuf; while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false; try { is.mark(1000); while(true){ int b = is.read(); if(b == -1){ is.reset(); return true; }else if(!isSpaceChar(b)){ is.reset(); return false; } } } catch (IOException e) { return true; } } private static byte[] inbuf = new byte[1024]; static int lenbuf = 0, ptrbuf = 0; private static int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private static double nd() { return Double.parseDouble(ns()); } private static char nc() { return (char)skip(); } private static String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private static char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private static char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private static int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private static int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }