結果

問題 No.157 2つの空洞
ユーザー uwiuwi
提出日時 2015-02-27 02:20:36
言語 Java21
(openjdk 21)
結果
AC  
実行時間 77 ms / 2,000 ms
コード長 4,711 bytes
コンパイル時間 4,284 ms
コンパイル使用メモリ 81,116 KB
実行使用メモリ 38,524 KB
最終ジャッジ日時 2024-06-23 22:24:56
合計ジャッジ時間 6,083 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 71 ms
38,308 KB
testcase_01 AC 68 ms
38,428 KB
testcase_02 AC 68 ms
37,720 KB
testcase_03 AC 77 ms
37,920 KB
testcase_04 AC 69 ms
38,524 KB
testcase_05 AC 68 ms
37,724 KB
testcase_06 AC 67 ms
38,196 KB
testcase_07 AC 70 ms
38,160 KB
testcase_08 AC 68 ms
38,296 KB
testcase_09 AC 69 ms
38,396 KB
testcase_10 AC 68 ms
37,564 KB
testcase_11 AC 68 ms
38,104 KB
testcase_12 AC 75 ms
37,692 KB
testcase_13 AC 67 ms
37,672 KB
testcase_14 AC 68 ms
37,828 KB
testcase_15 AC 69 ms
37,832 KB
testcase_16 AC 77 ms
38,292 KB
testcase_17 AC 67 ms
38,060 KB
testcase_18 AC 71 ms
37,876 KB
testcase_19 AC 68 ms
38,100 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q2xx;
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 Q233 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int m = ni(), n = ni();
		char[][] map = nm(n,m);
		int[] dr = { 1, 0, -1, 0 };
		int[] dc = { 0, 1, 0, -1 };
		out:
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				if(map[i][j] == '.'){
					map[i][j] = 'S';
					Queue<int[]> q = new ArrayDeque<int[]>();
					q.add(new int[]{i, j});
					while(!q.isEmpty()){
						int[] cur = q.poll();
						for(int k = 0;k < 4;k++){
							int nr = cur[0] + dr[k], nc = cur[1] + dc[k];
							if(nr >= 0 && nr < n && nc >= 0 && nc < m && map[nr][nc] == '.'){
								map[nr][nc] = 'S';
								q.add(new int[]{nr, nc});
							}
						}
					}
					break out;
				}
			}
		}
		
		
		int[][] d = new int[n][m];
		for(int i = 0;i < n;i++){
			Arrays.fill(d[i], 9999999);
		}
		Queue<int[]> q = new ArrayDeque<int[]>();
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				if(map[i][j] == 'S'){
					q.add(new int[]{i, j});
					d[i][j] = 0;
				}
			}
		}
		while(!q.isEmpty()){
			int[] cur = q.poll();
			for(int k = 0;k < 4;k++){
				int r = cur[0], c = cur[1];
				int nr = cur[0] + dr[k], nc = cur[1] + dc[k];
				if(nr >= 0 && nr < n && nc >= 0 && nc < m && d[nr][nc] > d[r][c] + 1){
					d[nr][nc] = d[r][c] + 1;
					q.add(new int[]{nr, nc});
				}
			}
		}
		
		int ret = 9999999;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				if(map[i][j] == '.'){
					ret = Math.min(ret, d[i][j]);
				}
			}
		}
		out.println(ret-1);
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static 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 static 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 static 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 static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static int ni()
	{
		int num = 0, 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 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0