結果

問題 No.179 塗り分け
ユーザー threepipes_s
提出日時 2015-04-06 00:21:06
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,434 bytes
コンパイル時間 2,601 ms
コンパイル使用メモリ 78,492 KB
実行使用メモリ 45,572 KB
最終ジャッジ日時 2024-10-02 13:25:41
合計ジャッジ時間 8,956 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 6
other AC * 31 WA * 9
権限があれば一括ダウンロードができます

ソースコード

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]=='.') 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-w > 0 && copy[k-i][l-j]!=3){
								isok = false;
								break notok;
							}
						}else if(copy[k][l] == 3){
							if(k+i > 0 && l+w > 0 && 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