結果
問題 | No.34 砂漠の行商人 |
ユーザー | ぴろず |
提出日時 | 2015-03-06 02:38:41 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 95 ms / 5,000 ms |
コード長 | 4,937 bytes |
コンパイル時間 | 2,638 ms |
コンパイル使用メモリ | 76,628 KB |
実行使用メモリ | 52,756 KB |
最終ジャッジ日時 | 2023-09-10 19:06:25 |
合計ジャッジ時間 | 5,122 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
49,812 KB |
testcase_01 | AC | 45 ms
49,488 KB |
testcase_02 | AC | 50 ms
49,456 KB |
testcase_03 | AC | 45 ms
49,388 KB |
testcase_04 | AC | 61 ms
50,916 KB |
testcase_05 | AC | 63 ms
50,572 KB |
testcase_06 | AC | 54 ms
49,588 KB |
testcase_07 | AC | 84 ms
50,044 KB |
testcase_08 | AC | 87 ms
52,040 KB |
testcase_09 | AC | 82 ms
51,680 KB |
testcase_10 | AC | 59 ms
50,016 KB |
testcase_11 | AC | 70 ms
51,500 KB |
testcase_12 | AC | 50 ms
49,576 KB |
testcase_13 | AC | 95 ms
52,700 KB |
testcase_14 | AC | 85 ms
52,756 KB |
testcase_15 | AC | 48 ms
49,244 KB |
testcase_16 | AC | 57 ms
49,620 KB |
testcase_17 | AC | 49 ms
49,300 KB |
testcase_18 | AC | 50 ms
49,488 KB |
testcase_19 | AC | 85 ms
52,100 KB |
testcase_20 | AC | 93 ms
52,548 KB |
testcase_21 | AC | 54 ms
49,464 KB |
testcase_22 | AC | 54 ms
49,544 KB |
testcase_23 | AC | 50 ms
49,232 KB |
testcase_24 | AC | 92 ms
52,648 KB |
testcase_25 | AC | 58 ms
50,436 KB |
ソースコード
package no034b; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.InputMismatchException; import java.util.NoSuchElementException; import java.util.Queue; public class Main { public static final int[] D = { 1, 0, -1, 0 }; public static final int INF = 20000; public static void main(String[] args) { IO io = new IO(); int n = io.nextInt(); int v = Math.min(2010, io.nextInt()); int sj = io.nextInt() - 1; int si = io.nextInt() - 1; int gj = io.nextInt() - 1; int gi = io.nextInt() - 1; int[][] map = io.matrixInt(n, n); int[][] vmax = new int[n][n]; int ans = -1; Queue<Integer> q = new ArrayDeque<Integer>(); vmax[si][sj] = v; q.offer(0 << 14 | si << 7 | sj); while (!q.isEmpty()) { int t = q.poll(); int td = t >> 14; int ti = t >> 7 & 0b1111111; int tj = t & 0b1111111; //System.out.println(td + "," + ti + "," + tj + "," + ); if (ti == gi && tj == gj) { ans = td; break; } for (int i = 0; i < 4; i++) { int ni = ti + D[i]; int nj = tj + D[i^1]; if (ni < 0 || ni >= n || nj < 0 || nj >= n) { continue; } int nv = vmax[ti][tj] - map[ni][nj]; if (nv <= vmax[ni][nj]) { continue; } vmax[ni][nj] = nv; q.offer((td+1) << 14 | ni << 7 | nj); } } System.out.println(ans); } } class IO extends PrintWriter { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public IO() { this(System.in);} public IO(InputStream source) { super(System.out); this.in = source;} private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private static boolean isNewLine(int c) { return c == '\n' || c == '\r';} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public boolean hasNextLine() { skipNewLine(); return hasNextByte();} public String next() { if (!hasNext()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public char[] nextCharArray(int len) { if (!hasNext()) { throw new NoSuchElementException(); } char[] s = new char[len]; int i = 0; int b = readByte(); while(isPrintableChar(b)) { if (i == len) { throw new InputMismatchException(); } s[i++] = (char) b; b = readByte(); } return s; } public String nextLine() { if (!hasNextLine()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(!isNewLine(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) { throw new NoSuchElementException(); } long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) { throw new NumberFormatException(); } return (int) nl; } public char nextChar() { if (!hasNext()) { throw new NoSuchElementException(); } return (char) readByte(); } public double nextDouble() { return Double.parseDouble(next());} public int[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;} public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;} public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;} public void arrayInt(int[]... a) {for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();} public int[][] matrixInt(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;} public char[][] charMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;} public void close() { super.close(); try { in.close(); } catch (IOException e) {} } }