結果
問題 | No.452 横着者のビンゴゲーム |
ユーザー | threepipes_s |
提出日時 | 2016-12-16 22:25:49 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 253 ms / 3,000 ms |
コード長 | 8,161 bytes |
コンパイル時間 | 4,081 ms |
コンパイル使用メモリ | 87,908 KB |
実行使用メモリ | 56,500 KB |
最終ジャッジ日時 | 2023-08-20 09:10:54 |
合計ジャッジ時間 | 11,312 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
49,228 KB |
testcase_01 | AC | 47 ms
49,352 KB |
testcase_02 | AC | 48 ms
49,448 KB |
testcase_03 | AC | 66 ms
51,940 KB |
testcase_04 | AC | 55 ms
49,936 KB |
testcase_05 | AC | 68 ms
51,836 KB |
testcase_06 | AC | 47 ms
49,260 KB |
testcase_07 | AC | 52 ms
47,948 KB |
testcase_08 | AC | 63 ms
51,572 KB |
testcase_09 | AC | 47 ms
49,264 KB |
testcase_10 | AC | 55 ms
49,900 KB |
testcase_11 | AC | 63 ms
51,732 KB |
testcase_12 | AC | 53 ms
49,932 KB |
testcase_13 | AC | 47 ms
49,352 KB |
testcase_14 | AC | 249 ms
56,496 KB |
testcase_15 | AC | 253 ms
56,476 KB |
testcase_16 | AC | 204 ms
56,156 KB |
testcase_17 | AC | 81 ms
51,932 KB |
testcase_18 | AC | 134 ms
54,016 KB |
testcase_19 | AC | 105 ms
51,824 KB |
testcase_20 | AC | 96 ms
52,204 KB |
testcase_21 | AC | 174 ms
53,836 KB |
testcase_22 | AC | 101 ms
52,352 KB |
testcase_23 | AC | 191 ms
56,100 KB |
testcase_24 | AC | 79 ms
51,716 KB |
testcase_25 | AC | 81 ms
51,936 KB |
testcase_26 | AC | 150 ms
53,672 KB |
testcase_27 | AC | 150 ms
53,516 KB |
testcase_28 | AC | 136 ms
53,448 KB |
testcase_29 | AC | 106 ms
51,976 KB |
testcase_30 | AC | 172 ms
54,048 KB |
testcase_31 | AC | 85 ms
51,956 KB |
testcase_32 | AC | 84 ms
52,596 KB |
testcase_33 | AC | 114 ms
52,216 KB |
testcase_34 | AC | 112 ms
52,252 KB |
testcase_35 | AC | 101 ms
51,920 KB |
testcase_36 | AC | 82 ms
52,048 KB |
testcase_37 | AC | 75 ms
51,560 KB |
testcase_38 | AC | 247 ms
56,500 KB |
testcase_39 | AC | 214 ms
56,316 KB |
testcase_40 | AC | 194 ms
55,776 KB |
testcase_41 | AC | 215 ms
55,884 KB |
testcase_42 | AC | 208 ms
56,236 KB |
testcase_43 | AC | 212 ms
56,028 KB |
ソースコード
import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.Closeable; import java.io.FileInputStream; import java.io.FileWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.HashMap; import java.util.List; import java.util.Queue; import java.util.TreeMap; public class Main implements Runnable{ static ContestScanner in;static Writer out; public static void main(String[] args) { new Thread(null, new Main(), "", 16 * 1024 * 1024).start(); } public void run() { try { in = new ContestScanner(); out = new Writer(); Main solve = new Main(); solve.solve(); in.close(); out.flush(); out.close(); } catch (IOException e) { e.printStackTrace(); } } static void dump(int[]a){StringBuilder s=new StringBuilder();for(int i=0;i<a.length;i++) s.append(a[i]).append(" ");out.println(s.toString().trim());} static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();} static void dump(long[]a){StringBuilder s=new StringBuilder();for(int i=0;i<a.length;i++) s.append(a[i]).append(" ");out.println(s.toString().trim());} static void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();} static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;} static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');} static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);} static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);} static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);} static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);} static void m_sort(int[]a,int s,int sz,int[]b) {if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;} m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz; while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];} while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i]; } /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */ static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);} static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);} static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);} static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);} static void m_sort(long[]a,int s,int sz,long[]b) {if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;} m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz; while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];} while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];} static void swap(long[] a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;} static void swap(int[] a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;} static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v {int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;} static int binarySearchSmallerMax(int[]a,int v,int l,int r) {int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;} @SuppressWarnings("unchecked") static List<Integer>[]createGraph(int n) {List<Integer>[]g=new List[n];for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;} void solve() throws IOException{ int n = in.nextInt(); int m = in.nextInt(); Bingo.used = new int[n*n*m]; Card[] card = new Card[m]; for(int i=0; i<m; i++){ int[][] map = new int[n][n]; for(int j=0; j<n; j++){ for(int k=0; k<n; k++){ map[j][k] = in.nextInt()-1; } } card[i] = new Card(map); } int min = n*2; for(int i=0; i<m; i++){ for(int j=i+1; j<m; j++){ min = Math.min(min, card[i].getMinUnion(card[j])); } } System.out.println(min-1); } } class Card{ Bingo[] bg; int n; Card(int[][] map){ n = map.length; bg = new Bingo[n*2+2]; int id = 0; int[] cross0 = new int[n]; int[] cross1 = new int[n]; for(int i=0; i<n; i++){ bg[id++] = new Bingo(map[i].clone()); cross0[i] = map[i][i]; cross1[i] = map[n-1-i][i]; int[] col = new int[n]; for(int j=0; j<n; j++){ col[j] = map[j][i]; } bg[id++] = new Bingo(col); } bg[id++] = new Bingo(cross0); bg[id++] = new Bingo(cross1); } int getMinUnion(Card c){ int min = 2*n; for(int i=0; i<bg.length; i++){ for(int j=0; j<bg.length; j++){ min = Math.min(min, bg[i].union(c.bg[j])); } } return min; } } class Bingo{ static int[] used; static int id; int[] num; Bingo(int[] a){ num = a; } int union(Bingo b){ int[] a = b.num; id++; int ans = a.length; for(int i=0; i<num.length; i++){ used[num[i]] = id; } for(int i=0; i<a.length; i++){ if(used[a[i]]!=id) ans++; } return ans; } } @SuppressWarnings("serial") class MultiSet<T> extends HashMap<T, Integer>{ @Override public Integer get(Object key){return containsKey(key)?super.get(key):0;} public void add(T key,int v){put(key,get(key)+v);} public void add(T key){put(key,get(key)+1);} public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);} public MultiSet<T> merge(MultiSet<T> set) {MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;} for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;} } @SuppressWarnings("serial") class OrderedMultiSet<T> extends TreeMap<T, Integer>{ @Override public Integer get(Object key){return containsKey(key)?super.get(key):0;} public void add(T key,int v){put(key,get(key)+v);} public void add(T key){put(key,get(key)+1);} public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);} public OrderedMultiSet<T> merge(OrderedMultiSet<T> set) {OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;} while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;} } class Pair implements Comparable<Pair>{ int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;} public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;} public int hashCode(){return hash;} public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;} } class Timer{ long time;public void set(){time=System.currentTimeMillis();} public long stop(){return time=System.currentTimeMillis()-time;} public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");} @Override public String toString(){return"Time: "+time+"ms";} } class Writer extends PrintWriter{ public Writer(String filename)throws IOException {super(new BufferedWriter(new FileWriter(filename)));} public Writer()throws IOException{super(System.out);} } class ContestScanner implements Closeable{ private BufferedReader in;private int c=-2; public ContestScanner()throws IOException {in=new BufferedReader(new InputStreamReader(System.in));} public ContestScanner(String filename)throws IOException {in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));} public String nextToken()throws IOException { StringBuilder sb=new StringBuilder(); while((c=in.read())!=-1&&Character.isWhitespace(c)); while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();} return sb.toString(); } public String readLine()throws IOException{ StringBuilder sb=new StringBuilder();if(c==-2)c=in.read(); while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();} return sb.toString(); } public long nextLong()throws IOException,NumberFormatException {return Long.parseLong(nextToken());} public int nextInt()throws NumberFormatException,IOException {return(int)nextLong();} public double nextDouble()throws NumberFormatException,IOException {return Double.parseDouble(nextToken());} public void close() throws IOException {in.close();} }