結果
問題 | No.1141 田グリッド |
ユーザー | Coki628 |
提出日時 | 2020-11-27 02:24:39 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,884 bytes |
コンパイル時間 | 450 ms |
コンパイル使用メモリ | 87,456 KB |
実行使用メモリ | 97,472 KB |
最終ジャッジ日時 | 2023-10-01 03:51:04 |
合計ジャッジ時間 | 10,337 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 79 ms
71,384 KB |
testcase_01 | AC | 73 ms
71,468 KB |
testcase_02 | AC | 72 ms
71,396 KB |
testcase_03 | AC | 73 ms
71,728 KB |
testcase_04 | AC | 73 ms
71,396 KB |
testcase_05 | AC | 73 ms
71,804 KB |
testcase_06 | AC | 72 ms
71,420 KB |
testcase_07 | AC | 73 ms
71,624 KB |
testcase_08 | AC | 94 ms
77,372 KB |
testcase_09 | AC | 93 ms
77,260 KB |
testcase_10 | AC | 95 ms
77,344 KB |
testcase_11 | AC | 95 ms
77,096 KB |
testcase_12 | AC | 97 ms
77,460 KB |
testcase_13 | AC | 318 ms
96,364 KB |
testcase_14 | AC | 383 ms
97,472 KB |
testcase_15 | AC | 308 ms
81,228 KB |
testcase_16 | AC | 308 ms
80,948 KB |
testcase_17 | AC | 316 ms
81,592 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 310 ms
80,908 KB |
testcase_22 | AC | 310 ms
80,856 KB |
testcase_23 | AC | 310 ms
80,832 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
ソースコード
import sys def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for k in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for k in range(c)] for k in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10**9) INF = 10**19 MOD = 10**9 + 7 EPS = 10**-10 def div(x, y, MOD): return x * pow(y, MOD-2, MOD) % MOD H, W = MAP() grid = list2d(H+2 ,W+2, 1) zeros = list2d(H+2, W+2, 0) for i in range(1, H+1): grid[i] = [1] + LIST() + [1] for j in range(1, W+1): if grid[i][j] == 0: zeros[i][j] = 1 grid[i][j] = 1 for i in range(H+2): for j in range(W+1): grid[i][j+1] *= grid[i][j] grid[i][j+1] %= MOD zeros[i][j+1] += zeros[i][j] for j in range(W+2): for i in range(H+1): grid[i+1][j] *= grid[i][j] grid[i+1][j] %= MOD zeros[i+1][j] += zeros[i][j] Q = INT() for _ in range(Q): r, c = MAP() rd = div(grid[H+1][W+1] * grid[r][c], grid[H+1][c] * grid[r][W+1], MOD) ru = div(grid[r-1][W+1], grid[r-1][c], MOD) ld = div(grid[H+1][c-1], grid[r][c-1], MOD) lu = grid[r-1][c-1] rd_zero = zeros[H+1][W+1] + zeros[r][c] - zeros[H+1][c] - zeros[r][W+1] ru_zero = zeros[r-1][W+1] - zeros[r-1][c] ld_zero = zeros[H+1][c-1] - zeros[r][c-1] lu_zero = zeros[r-1][c-1] res = 1 if not rd_zero: res *= rd if not ru_zero: res *= ru if not ld_zero: res *= ld if not lu_zero: res *= lu res %= MOD print(res)