結果

問題 No.34 砂漠の行商人
ユーザー ぴろずぴろず
提出日時 2015-02-16 23:10:51
言語 Java21
(openjdk 21)
結果
AC  
実行時間 869 ms / 5,000 ms
コード長 5,505 bytes
コンパイル時間 2,380 ms
コンパイル使用メモリ 89,372 KB
実行使用メモリ 464,572 KB
最終ジャッジ日時 2024-06-23 20:47:52
合計ジャッジ時間 9,149 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
37,012 KB
testcase_01 AC 50 ms
36,696 KB
testcase_02 AC 61 ms
37,408 KB
testcase_03 AC 51 ms
37,008 KB
testcase_04 AC 138 ms
44,944 KB
testcase_05 AC 140 ms
45,728 KB
testcase_06 AC 78 ms
38,176 KB
testcase_07 AC 172 ms
47,260 KB
testcase_08 AC 197 ms
49,256 KB
testcase_09 AC 357 ms
355,696 KB
testcase_10 AC 517 ms
463,988 KB
testcase_11 AC 493 ms
464,572 KB
testcase_12 AC 138 ms
51,532 KB
testcase_13 AC 160 ms
136,776 KB
testcase_14 AC 156 ms
140,332 KB
testcase_15 AC 113 ms
83,780 KB
testcase_16 AC 148 ms
127,980 KB
testcase_17 AC 112 ms
79,944 KB
testcase_18 AC 83 ms
50,976 KB
testcase_19 AC 673 ms
81,136 KB
testcase_20 AC 869 ms
111,568 KB
testcase_21 AC 75 ms
47,596 KB
testcase_22 AC 111 ms
74,256 KB
testcase_23 AC 200 ms
189,252 KB
testcase_24 AC 259 ms
248,004 KB
testcase_25 AC 269 ms
58,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no034a;

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.NoSuchElementException;
import java.util.Queue;

public class Main {
	public static final int[] D = {1,0,-1,0};
	public static final int INF = 1 << 29;
	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		int v = 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[][][] d = new int[n][n][v+1]; //d[i][j][v] := 場所(i,j)に体力vでたどり着く場合の最短距離
		for(int i=0;i<n;i++) {
			for(int j=0;j<n;j++) {
				Arrays.fill(d[i][j], INF);
			}
		}
		Queue<Taro> q = new ArrayDeque<>();
		q.offer(new Taro(si, sj, v));
		d[si][sj][v] = 0;
		while(!q.isEmpty()) {
			Taro t = q.poll();
//			System.out.println(t + "," + d[t.i][t.j][t.vital]);
			if ((Math.abs(gi - t.i) + Math.abs(gj - t.j)) * 9 < t.vital) { //枝刈り
				d[gi][gj][1] = Math.min(d[gi][gj][1], d[t.i][t.j][t.vital] + (Math.abs(gi - t.i) + Math.abs(gj - t.j)));
				continue;
			}
			for(int k=0;k<4;k++) {
				int ni = t.i + D[k];
				int nj = t.j + D[3-k];
				if (ni < 0 || ni >= n || nj < 0 || nj >= n || t.vital <= map[ni][nj]) {
					continue;
				}
				if (d[t.i][t.j][t.vital] + 1 < d[ni][nj][t.vital - map[ni][nj]]) {
					d[ni][nj][t.vital - map[ni][nj]] = d[t.i][t.j][t.vital] + 1;
					q.offer(new Taro(ni,nj,t.vital - map[ni][nj]));
				}
			}
		}
		int ans = INF;
		for(int i=1;i<=v;i++) {
			ans = Math.min(ans,d[gi][gj][i]);
		}
		System.out.println(ans >= INF ? -1 : ans);
	}
}
class Taro {
	int i,j,vital;
	public Taro(int i,int j,int vital) {
		this.i = i;
		this.j = j;
		this.vital = vital;
	}
	public String toString() {
		return "[(" + i + "," + j + ")," + vital + "]";
	}
}
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) {
		char[] s = new char[len];
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		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][m]; 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][m]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() {
		super.close();
		try {
			in.close();
		} catch (IOException e) {}
	}
}
0