結果

問題 No.1141 田グリッド
ユーザー buey_t
提出日時 2023-03-28 11:27:44
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 494 ms / 2,000 ms
コード長 2,911 bytes
コンパイル時間 172 ms
コンパイル使用メモリ 82,280 KB
実行使用メモリ 116,532 KB
最終ジャッジ日時 2024-09-20 02:15:21
合計ジャッジ時間 11,768 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

diff # 

def main():
    from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum
    from heapq import heapify, heappop, heappush
    from bisect import bisect_left, bisect_right
    from copy import deepcopy
    import copy
    import random
    from collections import deque,Counter,defaultdict
    from itertools import permutations,combinations
    from decimal import Decimal,ROUND_HALF_UP
    #tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
    from functools import lru_cache, reduce
    #@lru_cache(maxsize=None)
    from operator import add,sub,mul,xor,and_,or_,itemgetter
    INF = 10**18
    mod1 = 10**9+7
    mod2 = 998244353
    
    #DecimalならPython
    #再帰ならPython!!!!!!!!!!!!!!!!!!!!!!!!!!
    
    
    '''
    または、か
    
    0が含まれてるパターンがえぐい
    
    二次元を1次元に変えてしまえばセグメントツリーが使えるのかな
    
    だから田なのか
    '''
    
    H,W = map(int, input().split())
    A = [list(map(int, input().split())) for _ in range(H)]
    
    acm1 = [[1]*(W+1) for _ in range(H+1)]
    acm2 = [[1]*(W+1) for _ in range(H+1)]
    acm3 = [[1]*(W+1) for _ in range(H+1)]
    acm4 = [[1]*(W+1) for _ in range(H+1)]
    
    for i in range(H):
        for j in range(W):
            acm1[i][j] = A[i][j]
            acm2[i][j] = A[i][j]
            acm3[i][j] = A[i][j]
            acm4[i][j] = A[i][j]
    
    for i in range(H):
        for j in range(W-1):
            acm1[i][j+1] *= acm1[i][j]
            acm1[i][j+1] %= mod1
    for j in range(W):
        for i in range(H-1):
            acm1[i+1][j] *= acm1[i][j]
            acm1[i+1][j] %= mod1
    
    for i in reversed(range(H)):
        for j in range(W-1):
            acm3[i][j+1] *= acm3[i][j]
            acm3[i][j+1] %= mod1
    for j in range(W):
        for i in reversed(range(1,H)):
            acm3[i-1][j] *= acm3[i][j]
            acm3[i-1][j] %= mod1
    
    for i in range(H):
        for j in reversed(range(1,W)):
            acm2[i][j-1] *= acm2[i][j]
            acm2[i][j-1] %= mod1
    for j in reversed(range(W)):
        for i in range(H-1):
            acm2[i+1][j] *= acm2[i][j]
            acm2[i+1][j] %= mod1
    
    for i in reversed(range(H)):
        for j in reversed(range(1,W)):
            acm4[i][j-1] *= acm4[i][j]
            acm4[i][j-1] %= mod1
    for j in reversed(range(W)):
        for i in reversed(range(1,H)):
            acm4[i-1][j] *= acm4[i][j]
            acm4[i-1][j] %= mod1
    
    Q = int(input())
    for _ in range(Q):
        r,c = map(int, input().split())
        
        print(acm1[r-2][c-2]%mod1*acm2[r-2][c]%mod1*acm3[r][c-2]%mod1*acm4[r][c]%mod1)
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
if __name__ == '__main__':
    main()
0