結果

問題 No.34 砂漠の行商人
ユーザー fujisufujisu
提出日時 2015-03-06 06:26:30
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,840 ms / 5,000 ms
コード長 4,310 bytes
コンパイル時間 2,627 ms
コンパイル使用メモリ 80,896 KB
実行使用メモリ 176,912 KB
最終ジャッジ日時 2023-09-10 19:06:56
合計ジャッジ時間 9,818 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
49,368 KB
testcase_01 AC 48 ms
49,444 KB
testcase_02 AC 67 ms
51,000 KB
testcase_03 AC 50 ms
49,444 KB
testcase_04 AC 182 ms
56,332 KB
testcase_05 AC 199 ms
55,900 KB
testcase_06 AC 77 ms
52,192 KB
testcase_07 AC 230 ms
58,004 KB
testcase_08 AC 232 ms
60,356 KB
testcase_09 AC 123 ms
111,388 KB
testcase_10 AC 174 ms
176,312 KB
testcase_11 AC 174 ms
176,912 KB
testcase_12 AC 160 ms
58,064 KB
testcase_13 AC 127 ms
81,292 KB
testcase_14 AC 122 ms
74,028 KB
testcase_15 AC 86 ms
59,828 KB
testcase_16 AC 96 ms
75,012 KB
testcase_17 AC 85 ms
60,448 KB
testcase_18 AC 49 ms
49,676 KB
testcase_19 AC 1,489 ms
102,716 KB
testcase_20 AC 1,840 ms
113,976 KB
testcase_21 AC 110 ms
53,756 KB
testcase_22 AC 87 ms
61,296 KB
testcase_23 AC 100 ms
83,680 KB
testcase_24 AC 126 ms
108,416 KB
testcase_25 AC 287 ms
65,584 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.Queue;

public class Main {
	int n, v;
	int sx, sy, gx, gy;
	int[][] g;
	int max;

	class D implements Comparable<D> {
		int x, y;
		int r;
		int min;

		public D(int x, int y, int r, int min) {
			this.x = x;
			this.y = y;
			this.r = r;
			this.min = min;
		}

		@Override
		public int compareTo(D o) {
			if (this.min != o.min) {
				return this.min - o.min;
			}
			if (this.x != o.x) {
				return this.x - o.x;
			}
			if (this.y != o.y) {
				return this.y - o.y;
			}
			if (this.r != o.r) {
				return this.r - o.r;
			}
			return 0;
		}

		@Override
		public String toString() {
			return "(" + x + ", " + y + ", " + r + ", " + min + ")";
		}
	}

	int dijkstra() {
		//		PriorityQueue<D> queue = new PriorityQueue<D>();
		Queue<D> queue = new LinkedList<D>();
		queue.add(new D(sx, sy, v, 0));
		boolean[][][] vis = new boolean[n][n][v + 1];

		int[] dx = { 0, -1, 1, 0 };
		int[] dy = { -1, 0, 0, 1 };

		int res = 1 << 25;

		while (!queue.isEmpty()) {
			D d = queue.poll();
			int x = d.x;
			int y = d.y;
			int r = d.r;
			int min = d.min;

			if (vis[x][y][r]) {
				continue;
			}
			vis[x][y][r] = true;
			if (x == gx && y == gy) {
				res = Math.min(res, min);
				//				return min;
				continue;
			}
			if (res <= min) {
				continue;
			}
			int mhd = Math.abs(gx - x) + Math.abs(gy - y);
			if (mhd * max < r) {
				//				queue.add(new D(gx, gy, 1, min + mhd));
				res = Math.min(res, min + mhd);
				continue;
			}

			for (int i = 0; i < 4; i++) {
				int nx = x + dx[i];
				int ny = y + dy[i];
				if (nx < 0 || n <= nx || ny < 0 || n <= ny) {
					continue;
				}
				int nr = r - g[ny][nx];
				if (nr <= 0) {
					continue;
				}
				int nmin = min + 1;
				if (!vis[nx][ny][nr]) {
					queue.add(new D(nx, ny, nr, nmin));
				}
			}
		}

		//		return -1;
		return res;
	}

	void run() {
		MyScanner sc = new MyScanner();

		n = sc.nextInt();
		v = sc.nextInt();
		sx = sc.nextInt() - 1;
		sy = sc.nextInt() - 1;
		gx = sc.nextInt() - 1;
		gy = sc.nextInt() - 1;
		g = new int[n][n];
		max = 0;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				g[i][j] = sc.nextInt();
				max = Math.max(max, g[i][j]);
			}
		}

		int ans = dijkstra();
		System.out.println(ans < 100000 ? ans : -1);
	}

	public static void main(String[] args) {
		new Main().run();
	}

	public void mapDebug(int[][] a) {
		System.out.println("--------map display---------");
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.printf("%3d ", a[i][j]);
			}
			System.out.println();
		}
		System.out.println("----------------------------" + '\n');
	}

	class MyScanner {
		int read() {
			try {
				return System.in.read();
			} catch (IOException e) {
				throw new InputMismatchException();
			}
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();
			return array;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		long[] nextLongArray(int n) {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();
			return array;
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		double[] nextDoubleArray(int n) {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();
			return array;
		}

		String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		String[] nextStringArray(int n) {
			String[] array = new String[n];
			for (int i = 0; i < n; i++)
				array[i] = next();

			return array;
		}

		String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}
}
0