#78435 (Java21) No.348 カゴメカゴメ

提出ソース

結果

問題	No.348 カゴメカゴメ
ユーザー	uwi
提出日時	2016-02-26 22:59:55
言語	Java21 (openjdk 21)
結果	AC
実行時間	593 ms / 2,000 ms
コード長	6,543 bytes
コンパイル時間	4,206 ms
コンパイル使用メモリ	87,188 KB
実行使用メモリ	73,200 KB
最終ジャッジ日時	2024-09-22 22:38:35
合計ジャッジ時間	17,555 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	404 ms 62,852 KB
testcase_01	AC	56 ms 50,020 KB
testcase_02	AC	593 ms 73,200 KB
testcase_03	AC	491 ms 64,564 KB
testcase_04	AC	56 ms 50,312 KB
testcase_05	AC	57 ms 50,408 KB
testcase_06	AC	54 ms 50,236 KB
testcase_07	AC	53 ms 50,364 KB
testcase_08	AC	53 ms 50,280 KB
testcase_09	AC	54 ms 50,360 KB
testcase_10	AC	53 ms 50,068 KB
testcase_11	AC	53 ms 50,040 KB
testcase_12	AC	109 ms 52,392 KB
testcase_13	AC	87 ms 51,700 KB
testcase_14	AC	59 ms 50,452 KB
testcase_15	AC	279 ms 61,536 KB
testcase_16	AC	53 ms 50,336 KB
testcase_17	AC	54 ms 50,072 KB
testcase_18	AC	53 ms 50,088 KB
testcase_19	AC	53 ms 50,244 KB
testcase_20	AC	55 ms 50,192 KB
testcase_21	AC	54 ms 50,044 KB
testcase_22	AC	53 ms 50,236 KB
testcase_23	AC	525 ms 64,936 KB
testcase_24	AC	545 ms 64,968 KB
testcase_25	AC	530 ms 64,656 KB
testcase_26	AC	532 ms 64,816 KB
testcase_27	AC	525 ms 64,944 KB
testcase_28	AC	482 ms 64,868 KB
testcase_29	AC	548 ms 64,704 KB
testcase_30	AC	539 ms 64,668 KB
testcase_31	AC	478 ms 64,948 KB
testcase_32	AC	518 ms 64,788 KB
testcase_33	AC	158 ms 53,520 KB
testcase_34	AC	164 ms 53,468 KB
testcase_35	AC	163 ms 52,716 KB
testcase_36	AC	164 ms 53,492 KB
testcase_37	AC	170 ms 53,420 KB
testcase_38	AC	163 ms 53,016 KB
testcase_39	AC	161 ms 53,088 KB
testcase_40	AC	193 ms 53,144 KB
testcase_41	AC	162 ms 53,004 KB
testcase_42	AC	163 ms 53,832 KB
testcase_43	AC	101 ms 51,960 KB
testcase_44	AC	105 ms 52,372 KB
testcase_45	AC	104 ms 52,032 KB
testcase_46	AC	93 ms 52,212 KB
testcase_47	AC	102 ms 52,244 KB
testcase_48	AC	101 ms 51,928 KB
testcase_49	AC	103 ms 52,432 KB
testcase_50	AC	97 ms 52,204 KB
testcase_51	AC	104 ms 52,028 KB
testcase_52	AC	91 ms 52,060 KB

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

ソースコード

raw source code

package contest;

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

public class Q795_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		char[][] map = nm(n,m);
		char[][] nmap = new char[n+2][m+2];
		for(int i = 0;i < n+2;i++)Arrays.fill(nmap[i], '.');
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				nmap[i+1][j+1] = map[i][j];
			}
		}
		map = nmap;
		n += 2; m += 2;
		
		DJSet ds = new DJSet(n*m);
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m-1;j++){
				if(map[i][j] == '.' && map[i][j+1] == '.'){
					ds.union(i*m+j, i*m+j+1);
				}
			}
		}
		for(int i = 0;i < n-1;i++){
			for(int j = 0;j < m;j++){
				if(map[i][j] == '.' && map[i+1][j] == '.'){
					ds.union(i*m+j, (i+1)*m+j);
				}
			}
		}
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				for(int k = i-1;k <= i+1;k++){
					for(int l = j-1;l <= j+1;l++){
						if(k >= 0 && k < n && l >= 0 && l < m && map[i][j] == 'x' && map[k][l] == 'x'){
							ds.union(i*m+j, k*m+l);
						}
					}
				}
			}
		}
		
		int z = ds.count();
		Set<Integer> set = new HashSet<Integer>();
		int[] from = new int[z-1];
		int[] to = new int[z-1];
		
		int[] ind = new int[z];
		int[] size = new int[z];
		{
			int p = 0;
			for(int i = 0;i < n*m;i++){
				if(ds.upper[i] < 0){
					ind[p] = i;
					size[p] = -ds.upper[i];
					p++;
				}
			}
		}
		
		int[] dr = { 1, 0, -1, 0 };
		int[] dc = { 0, 1, 0, -1 };
		int p = 0;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				if(map[i][j] == '.'){
					for(int k = 0;k < 4;k++){
						int nr = i + dr[k], nc = j + dc[k];
						if(nr >= 0 && nr < n && nc >= 0 && nc < m && map[nr][nc] == 'x'){
							int ix = Arrays.binarySearch(ind, ds.root(i*m+j));
							int iy = Arrays.binarySearch(ind, ds.root(nr*m+nc));
							if(set.add(ix*z+iy)){
								from[p] = ix; to[p] = iy;
								p++;
							}
						}
					}
				}
			}
		}
		int[][] g = packU(z, from, to);
		
		int root = ind[ds.root(0)];
		int[] res = dfs(root, -1, g, size);
		out.println(Math.max(res[0], res[1]));
	}
	
	static int[][] packU(int n, int[] from, int[] to) {
		int[][] g = new int[n][];
		int[] p = new int[n];
		for (int f : from)
			p[f]++;
		for (int t : to)
			p[t]++;
		for (int i = 0; i < n; i++)
			g[i] = new int[p[i]];
		for (int i = 0; i < from.length; i++) {
			g[from[i]][--p[from[i]]] = to[i];
			g[to[i]][--p[to[i]]] = from[i];
		}
		return g;
	}
	
	public static void tf(boolean[][] b) {
		for (boolean[] r : b) {
			char[] s = new char[r.length];
			for (int i = 0; i < r.length; i++)
				s[i] = r[i] ? '#' : '.';
			System.out.println(new String(s));
		}
		System.out.println();
	}
	
	static int[] dfs(int cur, int pre, int[][] g, int[] size)
	{
		int n = g.length;
		int r1 = 0;
		int r0 = 0;
		for(int i : g[cur]){
			if(i != pre){
				int v = 0, w = 0;
				int ap = 0;
				for(int j : g[i]){
					if(j != cur){
						int[] res = dfs(j, i, g, size);
						v = Math.max(v, res[1]);
						v = Math.max(v, res[0] + size[i]);
						w = Math.max(w, res[1]);
						w = Math.max(w, res[0]);
						if(++ap > 1)throw new RuntimeException();
					}
				}
				r1 += v;
				r0 += w;
				if(ap == 0){
					r1 += size[i];
				}
			}
		}
		return new int[]{r0, r1};
	}
	
	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 Q795_2().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

結果

テストケース

ソースコード