結果
問題 | No.1141 田グリッド |
ユーザー | aaaaaaaaaa2230 |
提出日時 | 2022-03-07 23:40:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 299 ms / 2,000 ms |
コード長 | 1,612 bytes |
コンパイル時間 | 482 ms |
コンパイル使用メモリ | 86,952 KB |
実行使用メモリ | 111,108 KB |
最終ジャッジ日時 | 2023-09-30 02:49:50 |
合計ジャッジ時間 | 10,511 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,372 KB |
testcase_01 | AC | 72 ms
71,304 KB |
testcase_02 | AC | 73 ms
71,684 KB |
testcase_03 | AC | 73 ms
71,376 KB |
testcase_04 | AC | 71 ms
71,336 KB |
testcase_05 | AC | 71 ms
71,168 KB |
testcase_06 | AC | 71 ms
71,300 KB |
testcase_07 | AC | 71 ms
71,172 KB |
testcase_08 | AC | 123 ms
78,496 KB |
testcase_09 | AC | 115 ms
77,824 KB |
testcase_10 | AC | 121 ms
78,072 KB |
testcase_11 | AC | 116 ms
78,324 KB |
testcase_12 | AC | 126 ms
78,472 KB |
testcase_13 | AC | 202 ms
91,756 KB |
testcase_14 | AC | 299 ms
111,108 KB |
testcase_15 | AC | 233 ms
92,972 KB |
testcase_16 | AC | 240 ms
92,376 KB |
testcase_17 | AC | 239 ms
92,604 KB |
testcase_18 | AC | 213 ms
88,304 KB |
testcase_19 | AC | 212 ms
87,060 KB |
testcase_20 | AC | 219 ms
89,312 KB |
testcase_21 | AC | 231 ms
92,848 KB |
testcase_22 | AC | 233 ms
92,616 KB |
testcase_23 | AC | 238 ms
92,536 KB |
testcase_24 | AC | 232 ms
89,712 KB |
testcase_25 | AC | 221 ms
89,844 KB |
testcase_26 | AC | 241 ms
89,760 KB |
testcase_27 | AC | 231 ms
89,368 KB |
testcase_28 | AC | 219 ms
89,508 KB |
testcase_29 | AC | 218 ms
89,268 KB |
testcase_30 | AC | 227 ms
89,472 KB |
testcase_31 | AC | 219 ms
89,068 KB |
testcase_32 | AC | 225 ms
89,564 KB |
testcase_33 | AC | 223 ms
89,552 KB |
ソースコード
h,w = map(int,input().split()) A = [list(map(int,input().split())) for i in range(h)] mod = 10**9+7 q = int(input()) Q = [list(map(int,input().split())) for i in range(q)] ans = [1]*q accum = [[1]*(w+2) for i in range(h+2)] for i in range(h): for j in range(w): accum[i+1][j+1] = accum[i+1][j]*A[i][j] accum[i+1][j+1] %= mod for i in range(h): for j in range(w): accum[i+1][j+1] *= accum[i][j+1] accum[i+1][j+1] %= mod for i,(r,c) in enumerate(Q): ans[i] *= accum[r-1][c-1] accum = [[1]*(w+2) for i in range(h+2)] for i in range(h)[::-1]: for j in range(w)[::-1]: accum[i+1][j+1] = accum[i+1][j+2]*A[i][j] accum[i+1][j+1] %= mod for i in range(h)[::-1]: for j in range(w)[::-1]: accum[i+1][j+1] *= accum[i+2][j+1] accum[i+1][j+1] %= mod for i,(r,c) in enumerate(Q): ans[i] *= accum[r+1][c+1] accum = [[1]*(w+2) for i in range(h+2)] for i in range(h): for j in range(w)[::-1]: accum[i+1][j+1] = accum[i+1][j+2]*A[i][j] accum[i+1][j+1] %= mod for i in range(h): for j in range(w)[::-1]: accum[i+1][j+1] *= accum[i][j+1] accum[i+1][j+1] %= mod for i,(r,c) in enumerate(Q): ans[i] *= accum[r-1][c+1] accum = [[1]*(w+2) for i in range(h+2)] for i in range(h)[::-1]: for j in range(w): accum[i+1][j+1] = accum[i+1][j]*A[i][j] accum[i+1][j+1] %= mod for i in range(h)[::-1]: for j in range(w): accum[i+1][j+1] *= accum[i+2][j+1] accum[i+1][j+1] %= mod for i,(r,c) in enumerate(Q): ans[i] *= accum[r+1][c-1] for i in ans: print(i%mod)