結果
問題 |
No.1141 田グリッド
|
ユーザー |
|
提出日時 | 2022-03-07 23:40:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 265 ms / 2,000 ms |
コード長 | 1,612 bytes |
コンパイル時間 | 313 ms |
コンパイル使用メモリ | 82,676 KB |
実行使用メモリ | 109,568 KB |
最終ジャッジ日時 | 2024-07-22 20:46:22 |
合計ジャッジ時間 | 8,152 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 |
ソースコード
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)