結果
問題 | No.1141 田グリッド |
ユーザー | 37zigen |
提出日時 | 2020-07-31 23:24:14 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 260 ms / 2,000 ms |
コード長 | 3,412 bytes |
コンパイル時間 | 3,607 ms |
コンパイル使用メモリ | 74,136 KB |
実行使用メモリ | 58,060 KB |
最終ジャッジ日時 | 2023-09-21 02:55:58 |
合計ジャッジ時間 | 10,371 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,272 KB |
testcase_01 | AC | 41 ms
49,088 KB |
testcase_02 | AC | 43 ms
49,556 KB |
testcase_03 | AC | 42 ms
49,020 KB |
testcase_04 | AC | 43 ms
49,144 KB |
testcase_05 | AC | 43 ms
49,140 KB |
testcase_06 | AC | 44 ms
49,424 KB |
testcase_07 | AC | 42 ms
49,076 KB |
testcase_08 | AC | 52 ms
49,028 KB |
testcase_09 | AC | 49 ms
49,208 KB |
testcase_10 | AC | 58 ms
50,092 KB |
testcase_11 | AC | 60 ms
50,884 KB |
testcase_12 | AC | 54 ms
50,124 KB |
testcase_13 | AC | 258 ms
57,296 KB |
testcase_14 | AC | 260 ms
58,060 KB |
testcase_15 | AC | 247 ms
57,476 KB |
testcase_16 | AC | 252 ms
57,476 KB |
testcase_17 | AC | 239 ms
57,724 KB |
testcase_18 | AC | 163 ms
56,648 KB |
testcase_19 | AC | 172 ms
56,496 KB |
testcase_20 | AC | 170 ms
56,604 KB |
testcase_21 | AC | 254 ms
57,656 KB |
testcase_22 | AC | 251 ms
57,152 KB |
testcase_23 | AC | 251 ms
57,820 KB |
testcase_24 | AC | 180 ms
56,640 KB |
testcase_25 | AC | 190 ms
56,792 KB |
testcase_26 | AC | 170 ms
57,040 KB |
testcase_27 | AC | 170 ms
54,628 KB |
testcase_28 | AC | 186 ms
57,188 KB |
testcase_29 | AC | 167 ms
56,772 KB |
testcase_30 | AC | 173 ms
57,148 KB |
testcase_31 | AC | 164 ms
55,212 KB |
testcase_32 | AC | 172 ms
55,144 KB |
testcase_33 | AC | 172 ms
56,892 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) { new Main().run(); } long inv(long a) { return pow(a,MOD-2); } long pow(long a,long n) { return n!=0?pow(a*a%MOD,n/2)*(n%2==1?a:1)%MOD:1; } final long MOD=(long)1e9+7; void run() { FastScanner sc=new FastScanner(); int H=sc.nextInt(); int W=sc.nextInt(); long[][] A=new long[H][W]; long[] AH=new long[H]; long[] AW=new long[W]; long[] zH=new long[H]; long[] zW=new long[W]; int zeros=0; long tot=1; Arrays.fill(AH, 1); Arrays.fill(AW, 1); for (int i=0;i<H;++i) { for (int j=0;j<W;++j) { A[i][j]=sc.nextLong(); if (A[i][j]==0) { zeros++; zH[i]++; zW[j]++; } else { AH[i]=AH[i]*A[i][j]%MOD; AW[j]=AW[j]*A[i][j]%MOD; tot=tot*A[i][j]%MOD; } } } PrintWriter pw=new PrintWriter(System.out); int Q=sc.nextInt(); while (Q-->0) { int r=sc.nextInt()-1; int c=sc.nextInt()-1; if (zH[r]+zW[c]-(A[r][c]==0?1:0)!=zeros) { pw.println(0); } else { long ans=tot*inv(AH[r])%MOD*inv(AW[c])%MOD; if (A[r][c]!=0) { ans=ans*A[r][c]%MOD; } pw.println(ans); } } pw.close(); } 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 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(); } } }