結果

問題 No.424 立体迷路
ユーザー tanzakutanzaku
提出日時 2016-09-22 22:31:19
言語 Java21
(openjdk 21)
結果
AC  
実行時間 46 ms / 2,000 ms
コード長 6,506 bytes
コンパイル時間 2,487 ms
コンパイル使用メモリ 87,756 KB
実行使用メモリ 37,536 KB
最終ジャッジ日時 2024-07-05 06:59:19
合計ジャッジ時間 4,137 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
37,360 KB
testcase_01 AC 42 ms
36,928 KB
testcase_02 AC 42 ms
37,488 KB
testcase_03 AC 42 ms
37,220 KB
testcase_04 AC 43 ms
36,908 KB
testcase_05 AC 44 ms
37,172 KB
testcase_06 AC 43 ms
37,172 KB
testcase_07 AC 42 ms
37,404 KB
testcase_08 AC 42 ms
37,124 KB
testcase_09 AC 42 ms
37,176 KB
testcase_10 AC 43 ms
37,372 KB
testcase_11 AC 42 ms
37,276 KB
testcase_12 AC 44 ms
37,152 KB
testcase_13 AC 43 ms
37,040 KB
testcase_14 AC 43 ms
37,060 KB
testcase_15 AC 45 ms
37,316 KB
testcase_16 AC 43 ms
37,188 KB
testcase_17 AC 44 ms
37,412 KB
testcase_18 AC 42 ms
37,316 KB
testcase_19 AC 42 ms
37,284 KB
testcase_20 AC 42 ms
37,128 KB
testcase_21 AC 43 ms
37,164 KB
testcase_22 AC 43 ms
37,516 KB
testcase_23 AC 41 ms
37,160 KB
testcase_24 AC 46 ms
37,432 KB
testcase_25 AC 45 ms
37,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int h = io.nextInt();
			int w = io.nextInt();
			int sy = io.nextInt() - 1;
			int sx = io.nextInt() - 1;
			int gy = io.nextInt() - 1;
			int gx = io.nextInt() - 1;
			
			char[][] map = new char[h][];
			for(int i = 0; i < h; i++) {
				map[i] = io.next();
			}
			
			Queue<int[]> q = new ArrayDeque<>();
			q.add(new int[]{sx, sy});
			boolean[][] vis = new boolean[h][w];
			vis[sy][sx] = true;
			int[] dx = new int[]{1,0,-1,0,};
			int[] dy = new int[]{0,-1,0,1,};
			while(!q.isEmpty()) {
				int[] p = q.poll();
//				System.err.println(Arrays.toString(p));
				if(p[0] == gx && p[1] == gy) {
					io.out.println("YES");
					return;
				}
				for(int i = 0; i < 4; i++) {
					int x = p[0] + dx[i];
					int y = p[1] + dy[i];
					if(x < 0 || x >= w || y < 0 || y >= h) {
						continue;
					}
					if(Math.abs(map[y][x]-map[p[1]][p[0]]) <= 1) {
						if(!vis[y][x]) {
							vis[y][x] = true;
							q.add(new int[]{x,y});
						}
					}
					if(map[y][x] < map[p[1]][p[0]]) {
						x += dx[i];
						y += dy[i];
						if(x < 0 || x >= w || y < 0 || y >= h) {
							continue;
						}
						if(map[y][x] == map[p[1]][p[0]]) {
							if(!vis[y][x]) {
								vis[y][x] = true;
								q.add(new int[]{x,y});
							}
						}
					}
				}
			}
			io.out.println("NO");
		}
	}
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0