結果

問題 No.20 砂漠のオアシス
ユーザー fujisufujisu
提出日時 2015-02-08 04:39:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 374 ms / 5,000 ms
コード長 3,797 bytes
コンパイル時間 2,446 ms
コンパイル使用メモリ 75,492 KB
実行使用メモリ 57,652 KB
最終ジャッジ日時 2023-08-03 07:24:30
合計ジャッジ時間 6,819 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
49,640 KB
testcase_01 AC 48 ms
49,300 KB
testcase_02 AC 49 ms
49,364 KB
testcase_03 AC 100 ms
52,188 KB
testcase_04 AC 104 ms
52,144 KB
testcase_05 AC 334 ms
56,820 KB
testcase_06 AC 332 ms
57,652 KB
testcase_07 AC 341 ms
57,624 KB
testcase_08 AC 374 ms
57,380 KB
testcase_09 AC 340 ms
57,528 KB
testcase_10 AC 45 ms
49,528 KB
testcase_11 AC 46 ms
49,360 KB
testcase_12 AC 102 ms
52,516 KB
testcase_13 AC 101 ms
52,384 KB
testcase_14 AC 128 ms
52,492 KB
testcase_15 AC 116 ms
52,508 KB
testcase_16 AC 165 ms
55,668 KB
testcase_17 AC 150 ms
54,476 KB
testcase_18 AC 157 ms
54,600 KB
testcase_19 AC 166 ms
55,460 KB
testcase_20 AC 85 ms
52,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.util.InputMismatchException;
import java.util.PriorityQueue;

public class Main {
	int n;
	int[][] f;

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

		Point(int x, int y, int min) {
			this.x = x;
			this.y = y;
			this.min = min;
		}

		@Override
		public int compareTo(Point 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;
			}
			return 0;
		}
	}

	int bfs(int sx, int sy, int gx, int gy) {
		PriorityQueue<Point> queue = new PriorityQueue<Point>();
		queue.add(new Point(sx, sy, 0));
		int[] dx = { -1, 0, 0, 1 };
		int[] dy = { 0, -1, 1, 0 };
		boolean[][] vis = new boolean[n][n];

		while (!queue.isEmpty()) {
			Point p = queue.poll();
			int x = p.x;
			int y = p.y;
			int min = p.min;
			if (x == gx && y == gy) {
				return min;
			}
			if (vis[y][x]) {
				continue;
			}
			vis[y][x] = true;

			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;
				queue.add(new Point(nx, ny, min + f[ny][nx]));
			}
		}

		return -1;
	}

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

		n = sc.nextInt();
		int v = sc.nextInt();
		int ox = sc.nextInt() - 1;
		int oy = sc.nextInt() - 1;
		f = new int[n][n];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				f[i][j] = sc.nextInt();
			}
		}

		int a = bfs(0, 0, n - 1, n - 1);

		if (a < v) {
			System.out.println("YES");
		} else if (ox != -1 || oy != -1) {
			int b = bfs(0, 0, ox, oy);
			int c = bfs(ox, oy, n - 1, n - 1);
			int nv = (v - b) * 2;
			if (c < nv) {
				System.out.println("YES");
			} else {
				System.out.println("NO");
			}
		} else {
			System.out.println("NO");
		}
	}

	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