結果

問題 No.421 しろくろチョコレート
ユーザー 37zigen37zigen
提出日時 2016-09-09 01:37:04
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,923 bytes
コンパイル時間 3,953 ms
コンパイル使用メモリ 91,792 KB
実行使用メモリ 54,204 KB
最終ジャッジ日時 2024-04-28 00:55:20
合計ジャッジ時間 11,917 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
50,212 KB
testcase_01 AC 108 ms
54,052 KB
testcase_02 AC 94 ms
54,044 KB
testcase_03 AC 49 ms
49,812 KB
testcase_04 AC 92 ms
53,812 KB
testcase_05 AC 55 ms
50,180 KB
testcase_06 AC 47 ms
50,020 KB
testcase_07 AC 93 ms
54,008 KB
testcase_08 WA -
testcase_09 AC 51 ms
37,320 KB
testcase_10 AC 50 ms
37,672 KB
testcase_11 AC 92 ms
41,700 KB
testcase_12 AC 49 ms
37,068 KB
testcase_13 AC 47 ms
37,220 KB
testcase_14 AC 47 ms
36,688 KB
testcase_15 AC 48 ms
36,964 KB
testcase_16 AC 114 ms
42,848 KB
testcase_17 AC 127 ms
43,220 KB
testcase_18 AC 136 ms
43,464 KB
testcase_19 AC 46 ms
37,064 KB
testcase_20 AC 116 ms
42,336 KB
testcase_21 AC 131 ms
42,956 KB
testcase_22 AC 96 ms
42,192 KB
testcase_23 AC 49 ms
37,048 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 100 ms
42,572 KB
testcase_29 AC 121 ms
42,816 KB
testcase_30 AC 106 ms
43,140 KB
testcase_31 AC 152 ms
45,132 KB
testcase_32 AC 111 ms
43,240 KB
testcase_33 AC 115 ms
42,976 KB
testcase_34 AC 118 ms
42,560 KB
testcase_35 AC 109 ms
42,704 KB
testcase_36 AC 96 ms
42,472 KB
testcase_37 AC 139 ms
43,404 KB
testcase_38 AC 145 ms
44,896 KB
testcase_39 AC 103 ms
41,980 KB
testcase_40 AC 111 ms
43,592 KB
testcase_41 AC 75 ms
38,732 KB
testcase_42 AC 56 ms
37,864 KB
testcase_43 AC 104 ms
42,176 KB
testcase_44 AC 142 ms
44,500 KB
testcase_45 AC 91 ms
41,260 KB
testcase_46 AC 76 ms
39,196 KB
testcase_47 WA -
testcase_48 AC 145 ms
44,844 KB
testcase_49 AC 102 ms
42,600 KB
testcase_50 WA -
testcase_51 AC 142 ms
44,560 KB
testcase_52 AC 89 ms
40,944 KB
testcase_53 AC 84 ms
40,524 KB
testcase_54 AC 112 ms
42,568 KB
testcase_55 AC 52 ms
37,200 KB
testcase_56 AC 50 ms
37,300 KB
testcase_57 AC 54 ms
39,156 KB
testcase_58 AC 101 ms
42,288 KB
testcase_59 AC 75 ms
39,108 KB
testcase_60 AC 152 ms
44,784 KB
testcase_61 AC 148 ms
43,664 KB
testcase_62 AC 50 ms
36,884 KB
testcase_63 AC 50 ms
37,084 KB
testcase_64 AC 115 ms
42,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package No400番台;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;

public class Q421 {

	int[] dx = { 1, -1, 0, 0 };
	int[] dy = { 0, 0, 1, -1 };
	int h, w;
	char[][] choco;
	int[][] comp;

	@SuppressWarnings("unchecked")
	void solver() {
		h = ni();
		w = ni();
		choco = new char[h][w];
		for (int i = 0; i < h; i++) {
			choco[i] = ns().toCharArray();
		}

		comp = new int[h][w];
		for (int i = 0; i < h; i++) {
			Arrays.fill(comp[i], -1);
		}

		int color = 0;
		int ans = 0;
		int odd = 0, even = 0;

		ArrayList<Integer>[] g = new ArrayList[h * w];
		for (int i = 0; i < h * w; i++) {
			g[i] = new ArrayList<>();
		}
		for (int y = 0; y < h; y++) {
			for (int x = 0; x < w; x++) {
				if (on_filed(x, y) && comp[y][x] == -1) {

					ArrayDeque<Pair> que = new ArrayDeque<>();
					que.add(new Pair(x, y));
					while (!que.isEmpty()) {
						Pair p = que.poll();
						if (comp[p.y][p.x] != -1)
							continue;
						comp[p.y][p.x] = color;

						if ((p.x + p.y) % 2 == 0)
							even++;
						else
							odd++;

						for (int i = 0; i < 4; i++) {
							int nx = p.x + dx[i];
							int ny = p.y + dy[i];
							if (on_filed(nx, ny) && comp[ny][nx] == -1) {

								int a = id(p.x, p.y);
								int b = id(nx, ny);
								g[a].add(b);
								g[b].add(a);

								que.add(new Pair(nx, ny));
							}
						}
					}
					color++;
				}
			}
		}
		int the_number_of_matchings = bipartiteMatching(g, (h * w) / 2);
		ans += the_number_of_matchings * 100;
		even -= the_number_of_matchings;
		odd -= the_number_of_matchings;


//		 show_comp();

		int common = Math.min(even, odd);
		ans += common * 10;
		even -= common;
		odd -= common;
		ans += even + odd;
		out.println(ans);
	}

	int id(int x, int y) {
		if ((y + x) % 2 == 0)
			return (y * w + x) / 2;
		else
			return (y * w + x) / 2 + (h * w - 1) / 2 + 1;
	}

	boolean on_filed(int x, int y) {
		if (0 <= x && x < w && 0 <= y && y < h && choco[y][x] != '.') {
			return true;
		} else
			return false;
	}

	class Pair {
		int x;
		int y;

		Pair(int x, int y) {
			this.x = x;
			this.y = y;
		}
	}

	boolean augment(ArrayList<Integer>[] g, int u, Integer[] matchTo, Boolean[] visited) {
		if (u < 0)
			return true;
		for (int v : g[u]) {
			if (!visited[v]) {
				visited[v] = true;
				if (augment(g, matchTo[v], matchTo, visited)) {
					matchTo[u] = v;
					matchTo[v] = u;
					return true;
				}
			}
		}
		return false;
	}

	int bipartiteMatching(ArrayList<Integer>[] g, int L) {
		final int n = g.length;
		Integer[] matchTo = new Integer[n];
		Arrays.fill(matchTo, -1);
		matching = new ArrayList<>();
		int match = 0;

		for (int i = 0; i < L; i++) {
			Boolean[] visited = new Boolean[n];
			Arrays.fill(visited, false);
			if (augment(g, i, matchTo, visited))
				match++;
		}
		for (int i = 0; i < L; i++) {
			if (matchTo[i] > 0)
				matching.add(new Edge(i, matchTo[i]));
		}

		return match;
	}

	ArrayList<Edge> matching;

	class Edge {
		int a;
		int b;

		Edge(int a, int b) {
			this.a = a;
			this.b = b;
		}
	}

	void show_comp() {
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				System.out.print((comp[i][j] == -1 ? "#" : comp[i][j]) + " ");
			}
			System.out.println();
		}
	}
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";


	public static void main(String[] args) throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);

		new Q421().solver();
		out.flush();
	}

	static long nl()
	{
		try {
			long num = 0;
			boolean minus = false;
			while((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'));
			if(num == '-'){
				num = 0;
				minus = true;
			}else{
				num -= '0';
			}

			while(true){
				int b = is.read();
				if(b >= '0' && b <= '9'){
					num = num * 10 + (b - '0');
				}else{
					return minus ? -num : num;
				}
			}
		} catch (IOException e) {
		}
		return -1;
	}

	static char nc()
	{
		try {
			int b = skip();
			if(b == -1)return 0;
			return (char)b;
		} catch (IOException e) {
		}
		return 0;
	}

	static double nd()
	{
		try {
			return Double.parseDouble(ns());
		}catch(Exception e) {
		}
		return 0;
	}

	static String ns()
	{
		try{
			int b = skip();
			StringBuilder sb = new StringBuilder();
			if(b == -1)return "";
			sb.append((char)b);
			while(true){
				b = is.read();
				if(b == -1)return sb.toString();
				if(b <= ' ')return sb.toString();
				sb.append((char)b);
			}
		} catch (IOException e) {
		}
		return "";
	}

	public static char[] ns(int n)
	{
		char[] buf = new char[n];
		try{
			int b = skip(), p = 0;
			if(b == -1)return null;
			buf[p++] = (char)b;
			while(p < n){
				b = is.read();
				if(b == -1 || b <= ' ')break;
				buf[p++] = (char)b;
			}
			return Arrays.copyOf(buf, p);
		} catch (IOException e) {
		}
		return null;
	}

	public static byte[] nse(int n)
	{
		byte[] buf = new byte[n];
		try{
			int b = skip();
			if(b == -1)return null;
			is.read(buf);
			return buf;
		} catch (IOException e) {
		}
		return null;
	}

	static int skip() throws IOException
	{
		int b;
		while((b = is.read()) != -1 && !(b >= 33 && b <= 126));
		return b;
	}

	static boolean eof()
	{
		try {
			is.mark(1000);
			int b = skip();
			is.reset();
			return b == -1;
		} catch (IOException e) {
			return true;
		}
	}

	static int ni()
	{
		try {
			int num = 0;
			boolean minus = false;
			while((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'));
			if(num == '-'){
				num = 0;
				minus = true;
			}else{
				num -= '0';
			}

			while(true){
				int b = is.read();
				if(b >= '0' && b <= '9'){
					num = num * 10 + (b - '0');
				}else{
					return minus ? -num : num;
				}
			}
		} catch (IOException e) {
		}
		return -1;
	}
}
0