結果

問題 No.452 横着者のビンゴゲーム
ユーザー uwiuwi
提出日時 2016-12-03 00:07:14
言語 Java21
(openjdk 21)
結果
AC  
実行時間 457 ms / 3,000 ms
コード長 4,346 bytes
コンパイル時間 6,969 ms
コンパイル使用メモリ 82,084 KB
実行使用メモリ 54,456 KB
最終ジャッジ日時 2023-08-19 06:55:25
合計ジャッジ時間 12,336 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge10
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,572 KB
testcase_01 AC 43 ms
49,456 KB
testcase_02 AC 42 ms
49,456 KB
testcase_03 AC 46 ms
49,636 KB
testcase_04 AC 43 ms
49,396 KB
testcase_05 AC 51 ms
49,720 KB
testcase_06 AC 43 ms
49,436 KB
testcase_07 AC 43 ms
49,344 KB
testcase_08 AC 45 ms
49,412 KB
testcase_09 AC 42 ms
49,492 KB
testcase_10 AC 44 ms
49,408 KB
testcase_11 AC 44 ms
49,352 KB
testcase_12 AC 43 ms
49,508 KB
testcase_13 AC 43 ms
49,612 KB
testcase_14 AC 142 ms
53,384 KB
testcase_15 AC 135 ms
53,084 KB
testcase_16 AC 115 ms
53,016 KB
testcase_17 AC 85 ms
52,412 KB
testcase_18 AC 90 ms
50,432 KB
testcase_19 AC 97 ms
52,328 KB
testcase_20 AC 89 ms
51,776 KB
testcase_21 AC 162 ms
52,776 KB
testcase_22 AC 88 ms
52,340 KB
testcase_23 AC 283 ms
54,304 KB
testcase_24 AC 84 ms
52,324 KB
testcase_25 AC 82 ms
52,124 KB
testcase_26 AC 159 ms
52,552 KB
testcase_27 AC 133 ms
52,408 KB
testcase_28 AC 92 ms
50,676 KB
testcase_29 AC 97 ms
52,316 KB
testcase_30 AC 170 ms
52,328 KB
testcase_31 AC 76 ms
51,096 KB
testcase_32 AC 98 ms
52,388 KB
testcase_33 AC 119 ms
52,060 KB
testcase_34 AC 109 ms
51,804 KB
testcase_35 AC 106 ms
52,912 KB
testcase_36 AC 88 ms
52,316 KB
testcase_37 AC 82 ms
52,236 KB
testcase_38 AC 457 ms
54,400 KB
testcase_39 AC 333 ms
54,456 KB
testcase_40 AC 353 ms
54,020 KB
testcase_41 AC 337 ms
54,388 KB
testcase_42 AC 337 ms
54,088 KB
testcase_43 AC 334 ms
54,068 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2016;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class N452 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	int[][] bingosets(int[][] a)
	{
		int n = a.length;
		int[][] bs = new int[2*n+2][];
		int p = 0;
		for(int i = 0;i < n;i++){
			bs[p] = new int[n];
			for(int j = 0;j < n;j++){
				bs[p][j] = a[i][j];
			}
			p++;
		}
		for(int i = 0;i < n;i++){
			bs[p] = new int[n];
			for(int j = 0;j < n;j++){
				bs[p][j] = a[j][i];
			}
			p++;
		}
		{
			bs[p] = new int[n];
			for(int j = 0;j < n;j++){
				bs[p][j] = a[j][j];
			}
			p++;
		}
		{
			bs[p] = new int[n];
			for(int j = 0;j < n;j++){
				bs[p][j] = a[j][n-1-j];
			}
			p++;
		}
		for(int i = 0;i < p;i++){
			Arrays.sort(bs[i]);
		}
		return bs;
	}
	
	void solve()
	{
		int n = ni(), m = ni();
		int[][][] a = new int[m][][];
		for(int i = 0;i < m;i++){
			a[i] = new int[n][];
			for(int j = 0;j < n;j++){
				a[i][j] = na(n);
			}
		}
		int[][][] bss = new int[m][][];
		for(int i = 0;i < m;i++){
			bss[i] = bingosets(a[i]);
		}
		int min = n+n-1;
		for(int i = 0;i < m;i++){
			for(int j = i+1;j < m;j++){
				for(int[] bi : bss[i]){
					for(int[] bj : bss[j]){
						min = Math.min(min, uniqcount(bi, bj)-1);
					}
				}
			}
		}
		out.println(min);
	}
	
	int uniqcount(int[] a, int[] b)
	{
		int p = 0;
		int ret = a.length+b.length;
		for(int v : a){
			while(p < b.length && b[p] < v){
				p++;
			}
			if(p < b.length && b[p] == v){
				ret--;
				p++;
			}
		}
		return ret;
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new N452().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0