結果

問題 No.424 立体迷路
ユーザー uwiuwi
提出日時 2016-09-22 22:24:37
言語 Java21
(openjdk 21)
結果
AC  
実行時間 45 ms / 2,000 ms
コード長 3,993 bytes
コンパイル時間 3,826 ms
コンパイル使用メモリ 85,164 KB
実行使用メモリ 37,268 KB
最終ジャッジ日時 2024-07-05 06:58:51
合計ジャッジ時間 5,274 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
36,984 KB
testcase_01 AC 40 ms
36,892 KB
testcase_02 AC 40 ms
36,988 KB
testcase_03 AC 42 ms
37,268 KB
testcase_04 AC 42 ms
37,172 KB
testcase_05 AC 40 ms
36,684 KB
testcase_06 AC 42 ms
36,920 KB
testcase_07 AC 41 ms
37,056 KB
testcase_08 AC 41 ms
37,116 KB
testcase_09 AC 41 ms
37,220 KB
testcase_10 AC 41 ms
37,104 KB
testcase_11 AC 41 ms
36,804 KB
testcase_12 AC 40 ms
37,104 KB
testcase_13 AC 41 ms
36,884 KB
testcase_14 AC 41 ms
36,920 KB
testcase_15 AC 40 ms
37,076 KB
testcase_16 AC 40 ms
37,104 KB
testcase_17 AC 40 ms
37,152 KB
testcase_18 AC 41 ms
37,104 KB
testcase_19 AC 40 ms
37,024 KB
testcase_20 AC 41 ms
36,924 KB
testcase_21 AC 41 ms
36,684 KB
testcase_22 AC 41 ms
36,988 KB
testcase_23 AC 41 ms
36,932 KB
testcase_24 AC 45 ms
37,156 KB
testcase_25 AC 45 ms
36,792 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
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.Queue;

public class N424 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int sr = ni()-1, sc = ni()-1;
		int gr = ni()-1, gc = ni()-1;
		char[][] map = nm(n,m);
		Queue<int[]> q = new ArrayDeque<>();
		q.add(new int[]{sr, sc});
		boolean[][] ved = new boolean[n][m];
		ved[sr][sc] = true;
		int[] dr = { 1, 0, -1, 0 };
		int[] dc = { 0, 1, 0, -1 };
		while(!q.isEmpty()){
			int[] cur = q.poll();
			int r = cur[0], c = cur[1];
			for(int k = 0;k < 4;k++){
				int nr = r + dr[k], nc = c + dc[k];
				if(nr >= 0 && nr < n && nc >= 0 && nc < m && Math.abs(map[nr][nc] - map[r][c]) <= 1 && !ved[nr][nc]){
					ved[nr][nc] = true;
					q.add(new int[]{nr, nc});
				}
			}
			for(int k = 0;k < 4;k++){
				int nr = r + 2*dr[k], nc = c + 2*dc[k];
				if(nr >= 0 && nr < n && nc >= 0 && nc < m && map[nr][nc] == map[r][c] && map[r+dr[k]][c+dc[k]] < map[r][c] && !ved[nr][nc]){
					ved[nr][nc] = true;
					q.add(new int[]{nr, nc});
				}
			}
		}
		out.println(ved[gr][gc] ? "YES" : "NO");
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new N424().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0