結果

問題 No.179 塗り分け
ユーザー yuya178yuya178
提出日時 2017-11-14 17:22:04
言語 Java21
(openjdk 21)
結果
AC  
実行時間 366 ms / 3,000 ms
コード長 5,123 bytes
コンパイル時間 3,054 ms
コンパイル使用メモリ 91,636 KB
実行使用メモリ 47,776 KB
最終ジャッジ日時 2024-07-23 14:45:16
合計ジャッジ時間 12,483 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
44,232 KB
testcase_01 AC 53 ms
44,148 KB
testcase_02 AC 54 ms
44,308 KB
testcase_03 AC 53 ms
44,720 KB
testcase_04 AC 53 ms
44,208 KB
testcase_05 AC 151 ms
46,784 KB
testcase_06 AC 91 ms
45,332 KB
testcase_07 AC 151 ms
46,256 KB
testcase_08 AC 204 ms
46,612 KB
testcase_09 AC 218 ms
47,676 KB
testcase_10 AC 241 ms
47,776 KB
testcase_11 AC 182 ms
47,632 KB
testcase_12 AC 251 ms
47,024 KB
testcase_13 AC 54 ms
44,312 KB
testcase_14 AC 54 ms
44,208 KB
testcase_15 AC 53 ms
44,292 KB
testcase_16 AC 53 ms
44,152 KB
testcase_17 AC 52 ms
43,844 KB
testcase_18 AC 206 ms
46,980 KB
testcase_19 AC 167 ms
46,872 KB
testcase_20 AC 257 ms
46,896 KB
testcase_21 AC 356 ms
46,812 KB
testcase_22 AC 366 ms
46,772 KB
testcase_23 AC 199 ms
46,740 KB
testcase_24 AC 235 ms
46,648 KB
testcase_25 AC 210 ms
46,820 KB
testcase_26 AC 225 ms
46,780 KB
testcase_27 AC 314 ms
46,720 KB
testcase_28 AC 246 ms
46,532 KB
testcase_29 AC 303 ms
46,604 KB
testcase_30 AC 289 ms
46,840 KB
testcase_31 AC 335 ms
46,852 KB
testcase_32 AC 280 ms
46,724 KB
testcase_33 AC 332 ms
46,504 KB
testcase_34 AC 275 ms
46,540 KB
testcase_35 AC 327 ms
46,732 KB
testcase_36 AC 52 ms
43,788 KB
testcase_37 AC 53 ms
44,364 KB
testcase_38 AC 51 ms
36,820 KB
testcase_39 AC 54 ms
36,552 KB
testcase_40 AC 53 ms
37,112 KB
testcase_41 AC 52 ms
36,808 KB
testcase_42 AC 53 ms
37,128 KB
testcase_43 AC 71 ms
37,640 KB
testcase_44 AC 213 ms
39,856 KB
testcase_45 AC 57 ms
36,880 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;
    void solve()
    {
        int h = ni();
        int w = ni();
        char[][] map = nm(h,w);
        boolean[][] seen = new boolean[h][w];
        boolean ok = true;
        boolean no = false;
        for(int i = -h+1 ; i < h; i++){
            for(int j = -w+1; j < w; j++){
                if(i==0 && j==0) continue;
                for(int k = 0; k < h; k++){
                    for(int l = 0; l < w; l++){
                        seen[k][l] = false;
                    }
                }
                ok = true;
                no = false;
                for(int k = 0; k < h; k++){
                    for(int l = 0; l < w; l++){
                        boolean tmp = true;
                        if(map[k][l]=='#' && !seen[k][l]){
                            tmp = false;
                            no = true;
                            seen[k][l] = true;
                            int x = k+i;
                            int y = l+j;
                            if(x>=0 && x<h && y>=0 && y<w){
                                if(map[x][y]=='#' && !seen[x][y]){
                                    seen[x][y] = true;
                                    tmp = true;
                                }
                            }
                        }
                        ok = ok && tmp;
                    }
                }
                if(ok && no){
                    out.println("YES");
                    return;
                }
            }
        }
        out.println("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");
    }
    
    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