結果

問題 No.452 横着者のビンゴゲーム
ユーザー uwi
提出日時 2016-12-03 00:07:14
言語 Java
(openjdk 23)
結果
AC  
実行時間 364 ms / 3,000 ms
コード長 4,346 bytes
コンパイル時間 8,007 ms
コンパイル使用メモリ 91,180 KB
実行使用メモリ 40,808 KB
最終ジャッジ日時 2024-11-28 21:18:37
合計ジャッジ時間 10,029 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

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