結果

問題 No.348 カゴメカゴメ
ユーザー 37zigen37zigen
提出日時 2016-06-14 23:18:49
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,176 ms / 2,000 ms
コード長 5,079 bytes
コンパイル時間 2,711 ms
コンパイル使用メモリ 81,516 KB
実行使用メモリ 169,140 KB
最終ジャッジ日時 2024-10-09 13:50:23
合計ジャッジ時間 26,153 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 948 ms
150,988 KB
testcase_01 AC 66 ms
50,536 KB
testcase_02 AC 1,111 ms
151,956 KB
testcase_03 AC 984 ms
169,140 KB
testcase_04 AC 88 ms
51,920 KB
testcase_05 AC 87 ms
52,584 KB
testcase_06 AC 60 ms
50,388 KB
testcase_07 AC 58 ms
50,580 KB
testcase_08 AC 60 ms
50,496 KB
testcase_09 AC 62 ms
50,384 KB
testcase_10 AC 61 ms
50,144 KB
testcase_11 AC 58 ms
50,228 KB
testcase_12 AC 160 ms
55,780 KB
testcase_13 AC 120 ms
53,292 KB
testcase_14 AC 78 ms
51,020 KB
testcase_15 AC 644 ms
105,880 KB
testcase_16 AC 60 ms
50,496 KB
testcase_17 AC 60 ms
50,456 KB
testcase_18 AC 59 ms
50,460 KB
testcase_19 AC 58 ms
50,420 KB
testcase_20 AC 65 ms
50,516 KB
testcase_21 AC 60 ms
50,464 KB
testcase_22 AC 61 ms
50,032 KB
testcase_23 AC 1,134 ms
151,852 KB
testcase_24 AC 1,115 ms
149,740 KB
testcase_25 AC 1,176 ms
152,144 KB
testcase_26 AC 1,143 ms
151,860 KB
testcase_27 AC 1,118 ms
146,604 KB
testcase_28 AC 1,123 ms
151,972 KB
testcase_29 AC 1,129 ms
151,516 KB
testcase_30 AC 1,133 ms
148,492 KB
testcase_31 AC 1,121 ms
149,692 KB
testcase_32 AC 1,114 ms
149,612 KB
testcase_33 AC 279 ms
61,052 KB
testcase_34 AC 279 ms
61,132 KB
testcase_35 AC 278 ms
60,600 KB
testcase_36 AC 258 ms
61,228 KB
testcase_37 AC 286 ms
61,184 KB
testcase_38 AC 260 ms
61,228 KB
testcase_39 AC 271 ms
60,484 KB
testcase_40 AC 300 ms
61,312 KB
testcase_41 AC 286 ms
61,188 KB
testcase_42 AC 277 ms
60,836 KB
testcase_43 AC 134 ms
55,068 KB
testcase_44 AC 135 ms
55,388 KB
testcase_45 AC 136 ms
55,156 KB
testcase_46 AC 133 ms
55,248 KB
testcase_47 AC 131 ms
55,296 KB
testcase_48 AC 128 ms
55,116 KB
testcase_49 AC 130 ms
55,296 KB
testcase_50 AC 133 ms
55,140 KB
testcase_51 AC 135 ms
55,616 KB
testcase_52 AC 129 ms
55,268 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package yukicoder;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

public class Main {
	public static void main(String[] args) {
		new Main().solver();
	}

	void solver() {
		Scanner sc = new Scanner(System.in);
		int N, M;
		N = sc.nextInt();
		M = sc.nextInt();
		char[][] grid = new char[N + 2][M + 2];
		for (int i = 0; i < M + 2; i++) {
			grid[0][i] = '.';
			grid[N + 1][i] = '.';
		}
		for (int i = 0; i < N + 2; i++) {
			grid[i][0] = '.';
			grid[i][M + 1] = '.';
		}
		for (int i = 0; i < N; i++) {
			String s = sc.next();
			for (int j = 0; j < M; j++) {
				grid[i + 1][j + 1] = s.charAt(j);
			}
		}

		N += 2;
		M += 2;
		DJSet ds = new DJSet(N * M);
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				for (int dx = -1; dx <= 1; dx++) {
					for (int dy = -1; dy <= 1; dy++) {
						if (dx != 0 || dy != 0) {
							int yy = i + dy, xx = j + dx;
							if (yy == -1 || xx == -1 || yy == N || xx == M)
								continue;
							if (grid[i][j] == '.' && Math.abs(dx) + Math.abs(dy) > 1)
								continue;
							if (grid[i][j] != grid[yy][xx])
								continue;
							ds.setUnion(i * M + j, yy * M + xx);
						}
					}
				}
			}
		}
		ArrayList<Integer>[] edges = new ArrayList[N * M];
		for (int i = 0; i < N * M; i++)
			edges[i] = new ArrayList<Integer>();

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				for (int dx = -1; dx <= 1; dx++) {
					for (int dy = -1; dy <= 1; dy++) {
						if (dy != 0 || dx != 0) {
							int yy = i + dy, xx = j + dx;
							if (xx == -1 || yy == -1 || xx == M || yy == N)
								continue;
							if (Math.abs(dx) + Math.abs(dy) > 1)
								continue;
							if (grid[i][j] != grid[yy][xx]) {
								edges[ds.root(i * M + j)].add(ds.root(yy * M + xx));
							}
						}
					}
				}
			}
		}

		for (int i = 0; i < N * M; i++) {
			Set<Integer> set = new HashSet<Integer>();
			for (int j = 0; j < edges[i].size(); j++) {
				set.add(edges[i].get(j));
			}
			edges[i].clear();
			for (Iterator<Integer> it = set.iterator(); it.hasNext();) {
				edges[i].add(it.next());
			}
		}

		memo = new int[2 * N * M + 10];
		for (int i = 0; i < 2 * N * M + 10; i++)
			memo[i] = -1;

		System.out.println(rec(ds.root(0), -1, false, edges, grid, ds));
	}

	int rec(int i, int p, boolean b, ArrayList<Integer>[] edges, char[][] grid, DJSet ds) {
		int r = memo[2 * i + (b ? 1 : 0)];
		if (r == -2)
			throw new AssertionError("error");
		if (r != -1)
			return r;
		r = -2;
		if (grid[i / grid[0].length][i % grid[0].length] == '.') {
			int t = 0;
			for (Iterator<Integer> it = edges[i].iterator(); it.hasNext();) {
				int j = it.next();
				if (j != p) {
					t += rec(j, i, b, edges, grid, ds);
				}
			}
			r = t;
		} else {
			int t = 0, u = 0;
			// b=true:一つ外が囲まれている
			// b=false:一つ外が囲まれていない
			for (Iterator<Integer> it = edges[i].iterator(); it.hasNext();) {
				int j = it.next();
				if (j != p) {
					int x = rec(j, i, false, edges, grid, ds);
					int y = rec(j, i, true, edges, grid, ds);
					u += y;
					t += Math.max(x, y);
				}
			}
			r = t;
			u += ds.size(i);
			if (!b) {
				r = Math.max(r, u);
			}
		}
		return memo[2 * i + (b ? 1 : 0)] = r;
	}

	int[] memo;

	class DJSet {
		int n;// the number of vertices
		int[] d;

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

		int root(int x) {
			return d[x] < 0 ? x : root(d[x]);
		}

		boolean setUnion(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (x < y) {
					int d = x;
					x = y;
					y = d;
				}
				// x>y
				d[y] += d[x];
				d[x] = y;
			}
			return x != y;
		}

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

		// xを含む木のNodeの数
		int size(int x) {
			return d[root(x)] * (-1);
		}

		// 連結グラフの数
		int count() {
			int ct = 0;
			for (int u : d) {
				if (u < 0)
					ct++;
			}
			return ct;
		}
	}

	private static class Scanner {
		BufferedReader br;
		Iterator<String> it;

		Scanner(InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		String next() throws RuntimeException {
			try {
				if (it == null || !it.hasNext())
					it = Arrays.asList(br.readLine().split(" ")).iterator();
				return it.next();
			} catch (IOException e) {
				throw new IllegalStateException();
			}
		}

		int nextInt() throws RuntimeException {
			return Integer.parseInt(next());
		}

		long nextLong() throws RuntimeException {
			return Long.parseLong(next());
		}

		double nextDouble() throws RuntimeException {
			return Double.parseDouble(next());
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
				throw new IllegalStateException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0