結果

問題 No.402 最も海から遠い場所
ユーザー uwiuwi
提出日時 2016-07-23 00:12:59
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,018 ms / 3,000 ms
コード長 3,976 bytes
コンパイル時間 3,910 ms
コンパイル使用メモリ 85,792 KB
実行使用メモリ 160,548 KB
最終ジャッジ日時 2024-11-06 13:59:32
合計ジャッジ時間 10,085 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
50,336 KB
testcase_01 AC 55 ms
50,344 KB
testcase_02 AC 57 ms
50,024 KB
testcase_03 AC 54 ms
50,260 KB
testcase_04 AC 55 ms
50,284 KB
testcase_05 AC 56 ms
50,424 KB
testcase_06 AC 55 ms
50,228 KB
testcase_07 AC 56 ms
50,112 KB
testcase_08 AC 55 ms
49,984 KB
testcase_09 AC 55 ms
49,928 KB
testcase_10 AC 55 ms
50,036 KB
testcase_11 AC 57 ms
49,804 KB
testcase_12 AC 55 ms
49,924 KB
testcase_13 AC 94 ms
51,380 KB
testcase_14 AC 71 ms
50,840 KB
testcase_15 AC 131 ms
54,524 KB
testcase_16 AC 189 ms
56,060 KB
testcase_17 AC 501 ms
101,732 KB
testcase_18 AC 1,018 ms
159,036 KB
testcase_19 AC 680 ms
160,128 KB
testcase_20 AC 766 ms
160,500 KB
testcase_21 AC 754 ms
160,548 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class N402 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		char[][] map = nm(n,m);
		int[][] d = new int[n+2][m+2];
		for(int i = 0;i < n+2;i++){
			Arrays.fill(d[i], 99999999);
		}
		int[] q = new int[(n+2)*(m+2)+5];
		int p = 0;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				if(map[i][j] == '.'){
					q[p++] = i+1<<15|j+1;
					d[i+1][j+1] = 0;
				}
			}
		}
		for(int i = 0;i < n+2;i++){
			q[p++] = i<<15|0;
			d[i][0] = 0;
			q[p++] = i<<15|m+1;
			d[i][m+1] = 0;
		}
		for(int i = 0;i < m+2;i++){
			q[p++] = 0<<15|i;
			d[0][i] = 0;
			q[p++] = n+1<<15|i;
			d[n+1][i] = 0;
		}
		int max = 0;
		for(int z = 0;z < p;z++){
			int cur = q[z];
			int r = cur>>>15, c = cur&(1<<15)-1;
			max = Math.max(max, d[r][c]);
			for(int nr = r-1;nr <= r+1;nr++){
				for(int nc = c-1;nc <= c+1;nc++){
					if(nr >= 0 && nr < n+2 && nc >= 0 && nc < m+2 && d[nr][nc] > d[r][c] + 1){
						d[nr][nc] = d[r][c] + 1;
						q[p++] = nr<<15|nc;
					}
				}
			}
		}
		out.println(max);
	}
	
	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 N402().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