結果

問題 No.452 横着者のビンゴゲーム
ユーザー hiromi_ayasehiromi_ayase
提出日時 2016-12-26 14:58:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 986 ms / 3,000 ms
コード長 3,900 bytes
コンパイル時間 2,776 ms
コンパイル使用メモリ 79,880 KB
実行使用メモリ 51,424 KB
最終ジャッジ日時 2024-12-14 23:51:03
合計ジャッジ時間 19,437 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
36,908 KB
testcase_01 AC 54 ms
36,860 KB
testcase_02 AC 55 ms
36,612 KB
testcase_03 AC 113 ms
39,600 KB
testcase_04 AC 58 ms
36,668 KB
testcase_05 AC 111 ms
40,320 KB
testcase_06 AC 55 ms
36,832 KB
testcase_07 AC 66 ms
36,976 KB
testcase_08 AC 96 ms
38,260 KB
testcase_09 AC 55 ms
36,876 KB
testcase_10 AC 58 ms
36,800 KB
testcase_11 AC 79 ms
38,008 KB
testcase_12 AC 58 ms
36,492 KB
testcase_13 AC 53 ms
36,732 KB
testcase_14 AC 767 ms
51,424 KB
testcase_15 AC 786 ms
50,912 KB
testcase_16 AC 515 ms
47,776 KB
testcase_17 AC 246 ms
45,732 KB
testcase_18 AC 288 ms
46,020 KB
testcase_19 AC 235 ms
45,284 KB
testcase_20 AC 234 ms
46,052 KB
testcase_21 AC 470 ms
46,664 KB
testcase_22 AC 228 ms
45,440 KB
testcase_23 AC 568 ms
47,916 KB
testcase_24 AC 276 ms
45,908 KB
testcase_25 AC 202 ms
45,332 KB
testcase_26 AC 433 ms
47,308 KB
testcase_27 AC 350 ms
45,936 KB
testcase_28 AC 393 ms
47,676 KB
testcase_29 AC 285 ms
46,652 KB
testcase_30 AC 532 ms
47,824 KB
testcase_31 AC 212 ms
45,392 KB
testcase_32 AC 210 ms
45,296 KB
testcase_33 AC 311 ms
46,216 KB
testcase_34 AC 347 ms
46,640 KB
testcase_35 AC 265 ms
45,800 KB
testcase_36 AC 222 ms
46,132 KB
testcase_37 AC 223 ms
45,764 KB
testcase_38 AC 986 ms
50,068 KB
testcase_39 AC 790 ms
49,076 KB
testcase_40 AC 797 ms
48,724 KB
testcase_41 AC 836 ms
49,152 KB
testcase_42 AC 752 ms
48,220 KB
testcase_43 AC 798 ms
48,956 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.Set;


public class Main {

	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		int N = sc.nextInt();
		int M = sc.nextInt();
		int n = 2 * N + 2;

		List<List<Set<Integer>>> list = new ArrayList<>();
		for (int i = 0; i < M; i ++) {
			list.add(new ArrayList<>());
			for (int j = 0; j < n; j ++) {
				list.get(i).add(new HashSet<>());
			}
		}

		
		for (int i = 0; i < M; i ++) {
			List<Set<Integer>> now = list.get(i);

			int[][] b = sc.nextIntTable(N, N);
			for (int j = 0; j < N; j ++) {
				for (int k = 0; k < N; k ++) {
					now.get(j).add(b[j][k]);
					now.get(N + k).add(b[j][k]);
				}
			}
			for (int j = 0; j < N; j ++) {
				now.get(N * 2).add(b[j][j]);
				now.get(N * 2 + 1).add(b[j][N - j - 1]);
			}
		}

		int ret = N * 2 - 1;
		for (int p1 = 0; p1 < M; p1 ++) {
			for (int p2 = p1 + 1; p2 < M; p2 ++) {
				List<Set<Integer>> now1 = list.get(p1);
				List<Set<Integer>> now2 = list.get(p2);
				for (int i = 0; i < n; i ++) {
					for (int j = 0; j < n; j ++) {
						int count = 0;
						for (int v : now1.get(i)) {
							if (now2.get(j).contains(v)) {
								count ++;
							}
						}
						ret = Math.min(ret, N + (N - count - 1));
					}
				}
			}
		}

		System.out.println(ret);
	}
}



class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0