結果
問題 | No.34 砂漠の行商人 |
ユーザー | uwi |
提出日時 | 2015-02-19 00:49:10 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,598 ms / 5,000 ms |
コード長 | 2,708 bytes |
コンパイル時間 | 5,038 ms |
コンパイル使用メモリ | 79,448 KB |
実行使用メモリ | 227,108 KB |
最終ジャッジ日時 | 2023-09-10 19:04:00 |
合計ジャッジ時間 | 15,065 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
50,568 KB |
testcase_01 | AC | 69 ms
50,572 KB |
testcase_02 | AC | 72 ms
50,584 KB |
testcase_03 | AC | 71 ms
50,788 KB |
testcase_04 | AC | 142 ms
67,700 KB |
testcase_05 | AC | 143 ms
71,044 KB |
testcase_06 | AC | 74 ms
54,660 KB |
testcase_07 | AC | 177 ms
83,888 KB |
testcase_08 | AC | 207 ms
100,300 KB |
testcase_09 | AC | 561 ms
130,296 KB |
testcase_10 | AC | 336 ms
226,676 KB |
testcase_11 | AC | 797 ms
226,884 KB |
testcase_12 | AC | 129 ms
67,472 KB |
testcase_13 | AC | 1,598 ms
227,108 KB |
testcase_14 | AC | 1,302 ms
218,608 KB |
testcase_15 | AC | 143 ms
82,972 KB |
testcase_16 | AC | 231 ms
75,412 KB |
testcase_17 | AC | 201 ms
126,192 KB |
testcase_18 | AC | 99 ms
55,180 KB |
testcase_19 | AC | 519 ms
140,624 KB |
testcase_20 | AC | 776 ms
171,440 KB |
testcase_21 | AC | 107 ms
125,768 KB |
testcase_22 | AC | 225 ms
161,708 KB |
testcase_23 | AC | 148 ms
96,116 KB |
testcase_24 | AC | 955 ms
205,476 KB |
testcase_25 | AC | 204 ms
90,404 KB |
ソースコード
package q0xx; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; 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 lim = 9*(2*n-2); v = Math.min(v, lim); int[][][] dp = new int[v][n][n]; int I = 99999999; for(int i = 0;i < v;i++){ for(int j = 0;j < n;j++){ Arrays.fill(dp[i][j], I); } } int[] q = new int[lim*n*n+1]; int p = 0; int o = 0; q[p++] = 0<<14|sr<<7|sc; dp[0][sr][sc] = 0; int[] dr = { 1, 0, -1, 0 }; int[] dc = { 0, 1, 0, -1 }; int mind = I; while(o < p){ int cur = q[o++]; int dmg = cur>>>14, r = cur>>>7&127, c = cur&127; if(r == tr && c == tc && dp[dmg][tr][tc] < mind){ mind = dp[dmg][tr][tc]; } if(dp[dmg][r][c]+1 < mind){ 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 < v && dp[ndmg][nr][nc] > dp[dmg][r][c] + 1){ dp[ndmg][nr][nc] = dp[dmg][r][c] + 1; q[p++] = ndmg<<14|nr<<7|nc; } } } } } 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 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 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 void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }