結果

問題 No.452 横着者のビンゴゲーム
ユーザー GrenacheGrenache
提出日時 2016-12-03 13:27:20
言語 Java21
(openjdk 21)
結果
AC  
実行時間 247 ms / 3,000 ms
コード長 6,616 bytes
コンパイル時間 5,102 ms
コンパイル使用メモリ 82,044 KB
実行使用メモリ 50,432 KB
最終ジャッジ日時 2024-05-06 15:09:45
合計ジャッジ時間 12,257 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
37,536 KB
testcase_01 AC 50 ms
37,056 KB
testcase_02 AC 52 ms
37,340 KB
testcase_03 AC 58 ms
37,884 KB
testcase_04 AC 50 ms
37,328 KB
testcase_05 AC 80 ms
38,388 KB
testcase_06 AC 48 ms
37,568 KB
testcase_07 AC 50 ms
37,104 KB
testcase_08 AC 52 ms
37,396 KB
testcase_09 AC 46 ms
36,972 KB
testcase_10 AC 47 ms
37,424 KB
testcase_11 AC 50 ms
37,104 KB
testcase_12 AC 48 ms
37,344 KB
testcase_13 AC 47 ms
37,412 KB
testcase_14 AC 211 ms
49,068 KB
testcase_15 AC 209 ms
49,224 KB
testcase_16 AC 186 ms
47,024 KB
testcase_17 AC 152 ms
45,360 KB
testcase_18 AC 133 ms
44,716 KB
testcase_19 AC 145 ms
44,192 KB
testcase_20 AC 146 ms
44,420 KB
testcase_21 AC 149 ms
45,164 KB
testcase_22 AC 156 ms
44,752 KB
testcase_23 AC 171 ms
46,084 KB
testcase_24 AC 150 ms
44,792 KB
testcase_25 AC 130 ms
44,992 KB
testcase_26 AC 159 ms
45,500 KB
testcase_27 AC 169 ms
45,532 KB
testcase_28 AC 140 ms
44,896 KB
testcase_29 AC 131 ms
44,820 KB
testcase_30 AC 159 ms
45,924 KB
testcase_31 AC 128 ms
44,948 KB
testcase_32 AC 127 ms
44,644 KB
testcase_33 AC 153 ms
44,892 KB
testcase_34 AC 153 ms
44,812 KB
testcase_35 AC 158 ms
44,684 KB
testcase_36 AC 132 ms
44,192 KB
testcase_37 AC 139 ms
44,492 KB
testcase_38 AC 247 ms
50,432 KB
testcase_39 AC 196 ms
46,432 KB
testcase_40 AC 198 ms
46,068 KB
testcase_41 AC 198 ms
46,116 KB
testcase_42 AC 197 ms
46,280 KB
testcase_43 AC 189 ms
46,244 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder452 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int m = sc.nextInt();

		c = new int[m][n * n];
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				for (int k = 0; k < n; k++) {
					c[i][j * n + k] = sc.nextInt();
				}
			}
		}

		hm = new ArrayList<>();
		for (int i = 0; i < m; i++) {
			Map<Integer, Integer> tmp = new HashMap<>();
			hm.add(tmp);

			for (int j = 0; j < n * n; j++) {
				tmp.put(c[i][j], j);
			}
		}

		int ret = 2 * n;
		for (int i = 0; i < m; i++) {
			for (int j = i + 1; j < m; j++) {
				ret = Math.min(ret, f(i, j, n));
			}
		}

		pr.println(ret);
	}

	private static int[][] c;
	private static List<Map<Integer, Integer>> hm;

	private static int f(int c1, int c2, int n) {
		int ret = 0;
		for (int i = 0; i < n; i++) {
			List<Integer> al = new ArrayList<>();
			for (int j = 0; j < n; j++) {
				al.add(c[c1][i * n + j]);
			}
			ret = Math.max(ret, f2(c2, al, n));
		}
		for (int i = 0; i < n; i++) {
			List<Integer> al = new ArrayList<>();
			for (int j = 0; j < n; j++) {
				al.add(c[c1][j * n + i]);
			}
			ret = Math.max(ret, f2(c2, al, n));
		}
		{
			List<Integer> al = new ArrayList<>();
			List<Integer> al2 = new ArrayList<>();
			for (int i = 0; i < n; i++) {
				al.add(c[c1][i * n + i]);
				al2.add(c[c1][(n - 1 - i) * n + i]);
			}
			ret = Math.max(ret, f2(c2, al, n));
			ret = Math.max(ret, f2(c2, al2, n));
		}

		for (int i = 0; i < n; i++) {
			List<Integer> al = new ArrayList<>();
			for (int j = 0; j < n; j++) {
				al.add(c[c2][i * n + j]);
			}
			ret = Math.max(ret, f2(c1, al, n));
		}
		for (int i = 0; i < n; i++) {
			List<Integer> al = new ArrayList<>();
			for (int j = 0; j < n; j++) {
				al.add(c[c2][j * n + i]);
			}
			ret = Math.max(ret, f2(c1, al, n));
		}
		{
			List<Integer> al = new ArrayList<>();
			List<Integer> al2 = new ArrayList<>();
			for (int i = 0; i < n; i++) {
				al.add(c[c2][i * n + i]);
				al2.add(c[c2][(n - 1 - i) * n + i]);
			}
			ret = Math.max(ret, f2(c1, al, n));
			ret = Math.max(ret, f2(c1, al2, n));
		}

//		if (ret == 4) {
//			return 3;
//		} else if (ret == 3) {
//			return 4;
//		} else if (ret == 2) {
//			return 4 + 1;
//		} else {
//			return 4 + 2;
//		}
		return n - 1 + (n - ret);
	}

	private static int f2(int c1, List<Integer> al, int n) {
		int[] bx = new int[n];
		int[] by = new int[n];
		int b1 = 0;
		int b2 = 0;

		int max = 0;
		for (int e : al) {
			Integer ii = hm.get(c1).get(e);
			if (ii != null) {
				int i = ii.intValue();

				int x = i % n;
				int y = i / n;
				bx[x]++;
				by[y]++;
				if (x == y) {
					b1++;
				}
				if (n - 1 - y == x) {
					b2++;
				}

				max = Math.max(max, bx[x]);
				max = Math.max(max, by[y]);
				max = Math.max(max, b1);
				max = Math.max(max, b2);
			}
		}

		return max;
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

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

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

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

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

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

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