結果

問題 No.179 塗り分け
ユーザー threepipes_sthreepipes_s
提出日時 2015-04-06 00:39:32
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 4,447 bytes
コンパイル時間 2,482 ms
コンパイル使用メモリ 78,420 KB
実行使用メモリ 47,288 KB
最終ジャッジ日時 2024-10-02 13:29:14
合計ジャッジ時間 8,900 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
37,040 KB
testcase_01 RE -
testcase_02 AC 54 ms
36,928 KB
testcase_03 RE -
testcase_04 AC 53 ms
36,944 KB
testcase_05 RE -
testcase_06 AC 53 ms
36,660 KB
testcase_07 WA -
testcase_08 AC 191 ms
45,936 KB
testcase_09 RE -
testcase_10 AC 54 ms
36,928 KB
testcase_11 AC 54 ms
37,216 KB
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 AC 53 ms
36,616 KB
testcase_16 AC 52 ms
36,740 KB
testcase_17 AC 53 ms
37,028 KB
testcase_18 AC 63 ms
38,740 KB
testcase_19 AC 61 ms
38,704 KB
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 AC 53 ms
37,132 KB
testcase_24 RE -
testcase_25 AC 57 ms
37,296 KB
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 AC 138 ms
44,860 KB
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
testcase_45 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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-i; k++){
					for(int l=0; l<w-j; 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 >= h || j-l >= w || 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());
	}
}
0