結果

問題 No.157 2つの空洞
ユーザー yuya178yuya178
提出日時 2017-11-13 20:06:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 53 ms / 2,000 ms
コード長 5,060 bytes
コンパイル時間 2,149 ms
コンパイル使用メモリ 82,940 KB
実行使用メモリ 50,368 KB
最終ジャッジ日時 2024-11-25 00:28:02
合計ジャッジ時間 3,946 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
49,764 KB
testcase_01 AC 49 ms
49,772 KB
testcase_02 AC 49 ms
49,880 KB
testcase_03 AC 49 ms
49,744 KB
testcase_04 AC 50 ms
49,852 KB
testcase_05 AC 49 ms
49,788 KB
testcase_06 AC 49 ms
50,052 KB
testcase_07 AC 49 ms
50,040 KB
testcase_08 AC 49 ms
50,108 KB
testcase_09 AC 49 ms
49,792 KB
testcase_10 AC 50 ms
50,368 KB
testcase_11 AC 50 ms
49,940 KB
testcase_12 AC 50 ms
49,956 KB
testcase_13 AC 51 ms
49,868 KB
testcase_14 AC 51 ms
50,056 KB
testcase_15 AC 50 ms
49,784 KB
testcase_16 AC 51 ms
49,912 KB
testcase_17 AC 53 ms
50,112 KB
testcase_18 AC 50 ms
50,128 KB
testcase_19 AC 50 ms
49,856 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1_000_000_007;
    int inf = 10000000;
    int w,h;
    char[][] board;
    boolean[][] seen;
    void solve()
    {
        w = ni();
        h = ni();
        // board = new char[h][w];
        board = nm(h,w);
        seen = new boolean[h][w];
        int flag = 0;
        for(int i = 0; i < h; i++){
            for(int j = 0; j < w; j++){
                if(board[i][j]=='.'){
                    f(i,j);
                    flag = 1;
                    break;
                }
            }
            if(flag == 1) break;
        }
        int ans = inf;
        for(int i = 0; i < h; i++){
            for(int j = 0; j < w; j++){
                if(seen[i][j] && board[i][j]=='.'){
                    for(int k = 0; k < h; k++){
                        for(int l = 0; l < w; l++){
                            if(!seen[k][l] && board[k][l]=='.'){
                                int res = Math.abs(k-i)+Math.abs(l-j);
                                ans = Math.min(ans,res);
                            }
                        }
                    }
                }
            }
        }
        out.println(ans-1);

    }
    void f(int x, int y){
        seen[x][y] = true;
        if(board[x][y]=='#'){
            return;
        }
        int[] dx = {1,0,-1,0};
        int[] dy = {0,1,0,-1};
        for(int i = 0; i < 4; i++){
            int nx = x+dx[i];
            int ny = y+dy[i];
            if(nx>=0 && nx<=h-1 && ny>=0 && ny<=w-1 && !seen[nx][ny]) f(nx,ny);
        }
    }

   
    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");
    }
    
    public static void main(String[] args) throws Exception { new Main().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) && 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 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[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private 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 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)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0