結果

問題 No.452 横着者のビンゴゲーム
ユーザー hiromi_ayasehiromi_ayase
提出日時 2016-12-26 14:58:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 938 ms / 3,000 ms
コード長 3,900 bytes
コンパイル時間 3,480 ms
コンパイル使用メモリ 75,072 KB
実行使用メモリ 62,008 KB
最終ジャッジ日時 2023-08-21 12:33:31
合計ジャッジ時間 21,003 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
49,248 KB
testcase_01 AC 46 ms
49,064 KB
testcase_02 AC 51 ms
49,696 KB
testcase_03 AC 96 ms
52,524 KB
testcase_04 AC 52 ms
49,424 KB
testcase_05 AC 110 ms
52,240 KB
testcase_06 AC 49 ms
49,224 KB
testcase_07 AC 63 ms
50,876 KB
testcase_08 AC 88 ms
51,532 KB
testcase_09 AC 50 ms
49,272 KB
testcase_10 AC 52 ms
49,632 KB
testcase_11 AC 81 ms
50,792 KB
testcase_12 AC 49 ms
49,424 KB
testcase_13 AC 41 ms
49,208 KB
testcase_14 AC 758 ms
61,796 KB
testcase_15 AC 709 ms
62,008 KB
testcase_16 AC 545 ms
59,692 KB
testcase_17 AC 200 ms
57,124 KB
testcase_18 AC 279 ms
57,580 KB
testcase_19 AC 262 ms
57,660 KB
testcase_20 AC 191 ms
56,876 KB
testcase_21 AC 413 ms
57,192 KB
testcase_22 AC 242 ms
57,256 KB
testcase_23 AC 626 ms
60,036 KB
testcase_24 AC 237 ms
57,592 KB
testcase_25 AC 181 ms
56,828 KB
testcase_26 AC 430 ms
57,544 KB
testcase_27 AC 367 ms
57,964 KB
testcase_28 AC 341 ms
57,872 KB
testcase_29 AC 253 ms
57,624 KB
testcase_30 AC 495 ms
57,524 KB
testcase_31 AC 188 ms
56,668 KB
testcase_32 AC 191 ms
57,276 KB
testcase_33 AC 287 ms
57,576 KB
testcase_34 AC 341 ms
57,988 KB
testcase_35 AC 268 ms
57,648 KB
testcase_36 AC 197 ms
57,464 KB
testcase_37 AC 216 ms
57,240 KB
testcase_38 AC 938 ms
59,648 KB
testcase_39 AC 801 ms
60,328 KB
testcase_40 AC 763 ms
58,392 KB
testcase_41 AC 793 ms
60,552 KB
testcase_42 AC 724 ms
60,436 KB
testcase_43 AC 781 ms
60,184 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