結果
問題 | No.1560 majority x majority |
ユーザー | 37zigen |
提出日時 | 2021-04-16 13:51:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 799 ms / 2,000 ms |
コード長 | 2,872 bytes |
コンパイル時間 | 2,432 ms |
コンパイル使用メモリ | 75,068 KB |
実行使用メモリ | 56,152 KB |
最終ジャッジ日時 | 2023-09-07 13:54:09 |
合計ジャッジ時間 | 10,390 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 657 ms
56,152 KB |
testcase_01 | AC | 799 ms
55,216 KB |
testcase_02 | AC | 45 ms
49,196 KB |
testcase_03 | AC | 360 ms
55,120 KB |
testcase_04 | AC | 281 ms
54,760 KB |
testcase_05 | AC | 318 ms
55,404 KB |
testcase_06 | AC | 138 ms
54,720 KB |
testcase_07 | AC | 106 ms
52,672 KB |
testcase_08 | AC | 343 ms
55,044 KB |
testcase_09 | AC | 163 ms
54,376 KB |
testcase_10 | AC | 48 ms
49,232 KB |
testcase_11 | AC | 125 ms
52,444 KB |
testcase_12 | AC | 80 ms
52,012 KB |
testcase_13 | AC | 93 ms
52,248 KB |
testcase_14 | AC | 75 ms
52,116 KB |
testcase_15 | AC | 151 ms
54,484 KB |
testcase_16 | AC | 51 ms
49,368 KB |
testcase_17 | AC | 385 ms
55,260 KB |
testcase_18 | AC | 164 ms
52,180 KB |
testcase_19 | AC | 46 ms
49,216 KB |
testcase_20 | AC | 50 ms
49,088 KB |
testcase_21 | AC | 51 ms
49,160 KB |
testcase_22 | AC | 253 ms
54,900 KB |
testcase_23 | AC | 50 ms
49,144 KB |
testcase_24 | AC | 49 ms
49,212 KB |
testcase_25 | AC | 236 ms
54,296 KB |
testcase_26 | AC | 45 ms
49,164 KB |
testcase_27 | AC | 44 ms
49,196 KB |
testcase_28 | AC | 45 ms
49,068 KB |
testcase_29 | AC | 44 ms
48,992 KB |
testcase_30 | AC | 45 ms
49,548 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.math.BigInteger; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.Random; public class Main { public static void main(String[] args) { new Main().run(); } void run() { FastScanner sc = new FastScanner(); int N=sc.nextInt(); int M=sc.nextInt(); boolean[][] S=new boolean[N][M]; for (int i=0;i<N;++i) { for (int j=0;j<M;++j) { S[i][j]=sc.nextInt()==1; } } long[] dp=new long[1<<M]; dp[0]=1; for (int s=0;s<1<<M;++s) { boolean[] alive=new boolean[N]; out:for (int i=0;i<N;++i) { for (int j=0;j<M;++j) { if ((s>>j)%2==0) continue; if (!S[i][j]) continue out; } alive[i]=true; } for (int next=0;next<M;++next) { if ((s>>next)%2==1) continue; int ok=0; int ng=0; for (int i=0;i<N;++i) { if (!alive[i]) continue; if (S[i][next]) ++ok; else ++ng; } if (ok>=ng) { dp[s|1<<next] += dp[s]; } } } System.out.println(dp[(1<<M)-1]); } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } 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; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; 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() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }