結果
問題 | No.179 塗り分け |
ユーザー | threepipes_s |
提出日時 | 2015-04-06 00:46:48 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,525 bytes |
コンパイル時間 | 2,299 ms |
コンパイル使用メモリ | 78,716 KB |
実行使用メモリ | 57,632 KB |
最終ジャッジ日時 | 2024-04-10 11:35:38 |
合計ジャッジ時間 | 9,244 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
50,372 KB |
testcase_01 | AC | 53 ms
50,020 KB |
testcase_02 | AC | 53 ms
50,240 KB |
testcase_03 | AC | 53 ms
49,924 KB |
testcase_04 | AC | 53 ms
50,436 KB |
testcase_05 | AC | 94 ms
54,044 KB |
testcase_06 | AC | 53 ms
50,372 KB |
testcase_07 | WA | - |
testcase_08 | AC | 137 ms
54,912 KB |
testcase_09 | WA | - |
testcase_10 | AC | 54 ms
50,252 KB |
testcase_11 | AC | 54 ms
50,252 KB |
testcase_12 | AC | 223 ms
56,412 KB |
testcase_13 | AC | 54 ms
50,348 KB |
testcase_14 | AC | 53 ms
50,272 KB |
testcase_15 | AC | 53 ms
50,428 KB |
testcase_16 | AC | 53 ms
50,300 KB |
testcase_17 | AC | 53 ms
50,528 KB |
testcase_18 | AC | 64 ms
51,028 KB |
testcase_19 | AC | 64 ms
50,900 KB |
testcase_20 | AC | 246 ms
56,404 KB |
testcase_21 | AC | 181 ms
56,164 KB |
testcase_22 | AC | 238 ms
56,452 KB |
testcase_23 | AC | 54 ms
50,012 KB |
testcase_24 | AC | 214 ms
57,324 KB |
testcase_25 | AC | 57 ms
50,288 KB |
testcase_26 | WA | - |
testcase_27 | AC | 205 ms
56,308 KB |
testcase_28 | WA | - |
testcase_29 | AC | 280 ms
56,132 KB |
testcase_30 | WA | - |
testcase_31 | AC | 187 ms
56,092 KB |
testcase_32 | AC | 133 ms
56,132 KB |
testcase_33 | AC | 340 ms
56,388 KB |
testcase_34 | WA | - |
testcase_35 | AC | 331 ms
57,632 KB |
testcase_36 | AC | 54 ms
50,256 KB |
testcase_37 | AC | 54 ms
50,468 KB |
testcase_38 | AC | 53 ms
50,476 KB |
testcase_39 | AC | 53 ms
50,384 KB |
testcase_40 | AC | 54 ms
50,396 KB |
testcase_41 | AC | 53 ms
50,424 KB |
testcase_42 | AC | 53 ms
50,416 KB |
testcase_43 | AC | 65 ms
50,564 KB |
testcase_44 | AC | 100 ms
54,224 KB |
testcase_45 | AC | 55 ms
50,420 KB |
ソースコード
import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.FileWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.Comparator; import java.util.HashSet; import java.util.TreeSet; public class Main { public static void main(String[] args) throws NumberFormatException, IOException { ContestScanner in = new ContestScanner(); int h = in.nextInt(); int w = in.nextInt(); char[][] s = new char[h][w]; for(int i=0; i<h; i++){ s[i] = in.nextToken().toCharArray(); } for(int i=0; i<h; i++){ for(int j=0; j<w; j++){ int[][] copy = new int[h][w]; for(int k=0; k<h; k++){ for(int l=0; l<w; l++){ copy[k][l] = s[k][l]=='#'?1:0; } } if(i==0 && j==0) continue; for(int k=0; k<h; k++){ for(int l=0; l<w; l++){ if(s[k][l]=='.') continue; if(k+i >= h || j+l >= w || s[k+i][l+j]=='.' || copy[k][l] != 1) continue; copy[k][l] = 3; copy[k+i][l+j] = 2; } } boolean isok = true; notok:for(int k=0; k<h; k++){ for(int l=0; l<w; l++){ if(copy[k][l] == 2){ if(k-i < 0 || l-j < 0 || copy[k-i][l-j] != 3){ isok = false; break notok; } }else if(copy[k][l] == 3){ if(k+i >= h || l+j >= w || copy[k+i][l+j] != 2){ isok = false; break notok; } }else if(copy[k][l] == 1){ isok = false; break notok; } } } if(isok){ System.out.println("YES"); return; } } } // for(int i=0; i<h; i++){ // for(int j=0; j<w; j++){ // int[][] copy = new int[h][w]; // for(int k=0; k<h; k++){ // for(int l=0; l<w; l++){ // copy[k][l] = s[k][l]=='#'?1:0; // } // } // if(i==0 && j==0) continue; // for(int k=0; k<h; k++){ // for(int l=0; l<w; l++){ // if(s[k][l]=='.') continue; // if(k-i < 0 || l-j < 0 || s[k-i][l-j]=='.' || copy[k][l] != 1) continue; // copy[k][l] = 2; // copy[k-i][l-j] = 3; // } // } // boolean isok = true; // notok:for(int k=0; k<h; k++){ // for(int l=0; l<w; l++){ // if(copy[k][l] == 2){ // if(k-i < 0 || l-j < 0 || copy[k-i][l-j] != 3){ // isok = false; // break notok; // } // }else if(copy[k][l] == 3){ // if(k+i >= h || l+j >= w || copy[k+i][l+j] != 2){ // isok = false; // break notok; // } // }else if(copy[k][l] == 1){ // isok = false; // break notok; // } // } // } // if(isok){ // System.out.println("YES"); // return; // } // } // } System.out.println("NO"); return; } } class Node{ int id; HashSet<Node> edge = new HashSet<Node>(); public Node(int id) { this.id = id; } public void createEdge(Node node) { edge.add(node); } } class MyComp implements Comparator<int[]> { final int idx; public MyComp(int idx){ this.idx = idx; } public int compare(int[] a, int[] b) { return a[idx] - b[idx]; } } class Reverse implements Comparator<Integer> { public int compare(Integer arg0, Integer arg1) { return arg1 - arg0; } } class ContestWriter { private PrintWriter out; public ContestWriter(String filename) throws IOException { out = new PrintWriter(new BufferedWriter(new FileWriter(filename))); } public ContestWriter() throws IOException { out = new PrintWriter(System.out); } public void println(String str) { out.println(str); } public void print(String str) { out.print(str); } public void close() { out.close(); } } class ContestScanner { private BufferedReader reader; private String[] line; private int idx; public ContestScanner() throws FileNotFoundException { reader = new BufferedReader(new InputStreamReader(System.in)); } public ContestScanner(String filename) throws FileNotFoundException { reader = new BufferedReader(new InputStreamReader(new FileInputStream( filename))); } public String nextToken() throws IOException { if (line == null || line.length <= idx) { line = reader.readLine().trim().split(" "); idx = 0; } return line[idx++]; } public long nextLong() throws IOException, NumberFormatException { return Long.parseLong(nextToken()); } public int nextInt() throws NumberFormatException, IOException { return (int) nextLong(); } public double nextDouble() throws NumberFormatException, IOException { return Double.parseDouble(nextToken()); } }