#18870 (Java21) No.179 塗り分け

提出ソース

結果

問題	No.179 塗り分け
ユーザー	uwi
提出日時	2015-04-06 02:16:42
言語	Java21 (openjdk 21)
結果	AC
実行時間	182 ms / 3,000 ms
コード長	4,480 bytes
コンパイル時間	6,562 ms
コンパイル使用メモリ	80,332 KB
実行使用メモリ	56,544 KB
最終ジャッジ日時	2023-09-30 20:38:44
合計ジャッジ時間	8,828 ms
ジャッジサーバーID （参考情報）	judge12 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	44 ms 47,116 KB
testcase_01	AC	44 ms 49,084 KB
testcase_02	AC	44 ms 49,324 KB
testcase_03	AC	44 ms 49,188 KB
testcase_04	AC	43 ms 49,120 KB
testcase_05	AC	44 ms 49,188 KB
testcase_06	AC	44 ms 49,204 KB
testcase_07	AC	45 ms 49,140 KB
testcase_08	AC	44 ms 49,024 KB
testcase_09	AC	44 ms 49,548 KB
testcase_10	AC	46 ms 49,196 KB
testcase_11	AC	45 ms 49,172 KB
testcase_12	AC	143 ms 55,844 KB
testcase_13	AC	44 ms 49,156 KB
testcase_14	AC	43 ms 49,128 KB
testcase_15	AC	43 ms 49,176 KB
testcase_16	AC	43 ms 49,160 KB
testcase_17	AC	46 ms 49,244 KB
testcase_18	AC	54 ms 50,640 KB
testcase_19	AC	51 ms 49,176 KB
testcase_20	AC	45 ms 49,404 KB
testcase_21	AC	44 ms 49,168 KB
testcase_22	AC	86 ms 54,796 KB
testcase_23	AC	46 ms 49,248 KB
testcase_24	AC	63 ms 51,444 KB
testcase_25	AC	45 ms 49,328 KB
testcase_26	AC	49 ms 49,080 KB
testcase_27	AC	133 ms 56,124 KB
testcase_28	AC	50 ms 49,136 KB
testcase_29	AC	141 ms 55,932 KB
testcase_30	AC	119 ms 55,576 KB
testcase_31	AC	151 ms 55,664 KB
testcase_32	AC	101 ms 54,868 KB
testcase_33	AC	176 ms 56,544 KB
testcase_34	AC	93 ms 54,544 KB
testcase_35	AC	182 ms 56,308 KB
testcase_36	AC	45 ms 47,236 KB
testcase_37	AC	44 ms 49,140 KB
testcase_38	AC	44 ms 49,168 KB
testcase_39	AC	45 ms 48,960 KB
testcase_40	AC	44 ms 49,188 KB
testcase_41	AC	44 ms 49,212 KB
testcase_42	AC	44 ms 49,136 KB
testcase_43	AC	49 ms 49,272 KB
testcase_44	AC	79 ms 51,256 KB
testcase_45	AC	45 ms 49,244 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package q4xx;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q454 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		char[][] map = nm(n,m);
		int br = -1, bc = -1;
		int nb = 0;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				if(map[i][j] == '#'){
					if(br == -1){
						br = i; bc = j;
					}
					nb++;
				}
			}
		}
		if(nb % 2 == 1 || nb == 0){
			out.println("NO");
			return;
		}
		
		for(int i = 0;i < n;i++){
			inner:
			for(int j = 0;j < m;j++){
				if(map[i][j] == '#' && !(i == br && j == bc)){
					int dr = i - br, dc = j - bc;
					DJSet ds = new DJSet(n*m);
					for(int k = 0;k < n;k++){
						for(int l = 0;l < m;l++){
							if(map[k][l] == '#'){
								int nr = k + dr, nc = l + dc;
								if(nr >= 0 && nr < n && nc >= 0 && nc < m && map[nr][nc] == '#'){
									ds.union(k*m+l, nr*m+nc);
								}
							}
						}
					}
					for(int k = 0;k < n;k++){
						for(int l = 0;l < m;l++){
							if(map[k][l] == '#' && ds.upper[k*m+l] < 0){
								if(ds.upper[k*m+l] % 2 != 0){
									continue inner;
								}
							}
						}
					}
					out.println("YES");
					return;
				}
			}
		}
		out.println("NO");
	}
	
	public static class DJSet {
		public int[] upper;

		public DJSet(int n) {
			upper = new int[n];
			Arrays.fill(upper, -1);
		}

		public int root(int x) {
			return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
		}

		public boolean equiv(int x, int y) {
			return root(x) == root(y);
		}

		public boolean union(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (upper[y] < upper[x]) {
					int d = x;
					x = y;
					y = d;
				}
				upper[x] += upper[y];
				upper[y] = x;
			}
			return x == y;
		}

		public int count() {
			int ct = 0;
			for (int u : upper)
				if (u < 0)
					ct++;
			return ct;
		}
	}
	
	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 Q454().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))){ // when nextLine, (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)); }
}

yukicoder

結果

テストケース

ソースコード