結果
問題 | No.1846 Good Binary Matrix |
ユーザー | 37zigen |
提出日時 | 2022-02-18 23:03:17 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,676 ms / 2,000 ms |
コード長 | 3,549 bytes |
コンパイル時間 | 2,190 ms |
コンパイル使用メモリ | 74,644 KB |
実行使用メモリ | 100,796 KB |
最終ジャッジ日時 | 2023-09-11 19:59:53 |
合計ジャッジ時間 | 28,175 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 320 ms
99,772 KB |
testcase_01 | AC | 326 ms
99,612 KB |
testcase_02 | AC | 312 ms
100,016 KB |
testcase_03 | AC | 323 ms
99,624 KB |
testcase_04 | AC | 307 ms
99,544 KB |
testcase_05 | AC | 311 ms
99,700 KB |
testcase_06 | AC | 323 ms
99,496 KB |
testcase_07 | AC | 306 ms
99,676 KB |
testcase_08 | AC | 324 ms
97,932 KB |
testcase_09 | AC | 311 ms
99,728 KB |
testcase_10 | AC | 312 ms
99,612 KB |
testcase_11 | AC | 318 ms
99,888 KB |
testcase_12 | AC | 317 ms
99,660 KB |
testcase_13 | AC | 328 ms
99,580 KB |
testcase_14 | AC | 321 ms
99,632 KB |
testcase_15 | AC | 326 ms
99,620 KB |
testcase_16 | AC | 1,676 ms
100,232 KB |
testcase_17 | AC | 1,569 ms
100,156 KB |
testcase_18 | AC | 1,585 ms
100,276 KB |
testcase_19 | AC | 1,610 ms
100,568 KB |
testcase_20 | AC | 1,646 ms
100,348 KB |
testcase_21 | AC | 280 ms
100,012 KB |
testcase_22 | AC | 272 ms
99,476 KB |
testcase_23 | AC | 663 ms
100,456 KB |
testcase_24 | AC | 521 ms
100,796 KB |
testcase_25 | AC | 1,470 ms
100,268 KB |
testcase_26 | AC | 1,028 ms
100,108 KB |
testcase_27 | AC | 1,444 ms
100,236 KB |
testcase_28 | AC | 839 ms
100,456 KB |
testcase_29 | AC | 1,053 ms
100,192 KB |
testcase_30 | AC | 650 ms
100,464 KB |
testcase_31 | AC | 502 ms
100,324 KB |
testcase_32 | AC | 1,321 ms
100,464 KB |
testcase_33 | AC | 494 ms
100,428 KB |
testcase_34 | AC | 312 ms
99,620 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; class Main { public static void main(String[] args) { new Main().run(); } void run() { solve(); } long mod=(long)1e9+7; long pow(long a, long n) { if (n==0) return 1; return pow(a*a%mod,n/2) * (n%2==1?a:1) %mod; } long inv(long a) { return pow(a, mod-2); } long c(int n, int k) { // if (n==k) return 1; if (n<0||k<0||n-k<0) return 0; // return (c(n-1,k)+c(n-1,k-1))%mod; return fac[n]*ifac[k]%mod*ifac[n-k]%mod; } long slow(int H, int W) { long ans=0; for (int i=0;i<=H;++i) { for (int j=0;j<=W;++j) { ans+=pow(2,i*j)*pow(-1,i+j)%mod*c(H,i)%mod*c(W,j)%mod; ans%=mod; } } ans=ans*pow(-1,H+W)%mod; ans=(ans+mod)%mod; return ans; } int MAX=2000000; long[] fac=new long[MAX]; long[] ifac=new long[MAX]; long[] inv=new long[MAX]; { fac[0]=fac[1]=ifac[0]=ifac[1]=inv[0]=inv[1]=1; for (int i=2;i<MAX;++i) { fac[i]=i*fac[i-1]%mod; inv[i]=mod-(mod/i)*inv[(int)(mod%i)]%mod; ifac[i]=inv[i]*ifac[i-1]%mod; } } void solve() { FastScanner sc=new FastScanner(); PrintWriter pw=new PrintWriter(System.out); int H=sc.nextInt(); int W=sc.nextInt(); long ans=0; for (int i=0;i<=W;++i) { ans+=pow(1-pow(2,i),H)*(i%2==0?1:-1)%mod*c(W,i)%mod; ans%=mod; } ans=ans*pow(-1,H+W)%mod; ans=(ans+mod)%mod; System.out.println(ans); pw.close(); } 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;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); 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() { return (int)nextLong(); } }