結果
問題 | No.1141 田グリッド |
ユーザー | kimiyuki |
提出日時 | 2020-07-31 21:52:29 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 591 ms / 2,000 ms |
コード長 | 1,740 bytes |
コンパイル時間 | 230 ms |
コンパイル使用メモリ | 10,908 KB |
実行使用メモリ | 31,368 KB |
最終ジャッジ日時 | 2023-09-20 23:00:08 |
合計ジャッジ時間 | 13,713 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
9,828 KB |
testcase_01 | AC | 33 ms
9,820 KB |
testcase_02 | AC | 34 ms
9,928 KB |
testcase_03 | AC | 33 ms
9,816 KB |
testcase_04 | AC | 33 ms
9,772 KB |
testcase_05 | AC | 34 ms
9,964 KB |
testcase_06 | AC | 33 ms
9,980 KB |
testcase_07 | AC | 33 ms
9,764 KB |
testcase_08 | AC | 38 ms
10,588 KB |
testcase_09 | AC | 37 ms
10,352 KB |
testcase_10 | AC | 40 ms
10,532 KB |
testcase_11 | AC | 40 ms
10,648 KB |
testcase_12 | AC | 39 ms
10,540 KB |
testcase_13 | AC | 507 ms
26,960 KB |
testcase_14 | AC | 591 ms
31,368 KB |
testcase_15 | AC | 503 ms
29,224 KB |
testcase_16 | AC | 507 ms
29,216 KB |
testcase_17 | AC | 504 ms
29,388 KB |
testcase_18 | AC | 508 ms
29,420 KB |
testcase_19 | AC | 505 ms
29,164 KB |
testcase_20 | AC | 505 ms
29,200 KB |
testcase_21 | AC | 506 ms
29,164 KB |
testcase_22 | AC | 505 ms
29,180 KB |
testcase_23 | AC | 506 ms
29,100 KB |
testcase_24 | AC | 501 ms
29,012 KB |
testcase_25 | AC | 507 ms
29,360 KB |
testcase_26 | AC | 507 ms
29,480 KB |
testcase_27 | AC | 508 ms
29,604 KB |
testcase_28 | AC | 495 ms
29,340 KB |
testcase_29 | AC | 503 ms
29,076 KB |
testcase_30 | AC | 508 ms
29,352 KB |
testcase_31 | AC | 504 ms
29,384 KB |
testcase_32 | AC | 500 ms
28,968 KB |
testcase_33 | AC | 498 ms
29,004 KB |
ソースコード
#!/usr/bin/env python3 from typing import * MOD = 1000000007 def solve(h: int, w: int, a: List[List[int]], q: int, r: List[int], c: List[int]) -> List[int]: all_prod = 1 all_zero = 0 row_prod = [1] * h col_prod = [1] * w row_zero = [0] * h col_zero = [0] * w for y in range(h): for x in range(w): if a[y][x] == 0: row_zero[y] += 1 col_zero[x] += 1 else: row_prod[y] = row_prod[y] * a[y][x] % MOD col_prod[x] = col_prod[x] * a[y][x] % MOD all_prod = all_prod * row_prod[y] % MOD all_zero += row_zero[y] ans = [] for y, x in zip(r, c): prod = all_prod * pow(row_prod[y], MOD - 2, MOD) * pow(col_prod[x], MOD - 2, MOD) zero = all_zero - row_zero[y] - col_zero[x] if a[y][x] == 0: zero += 1 else: prod *= a[y][x] prod %= MOD if zero: ans.append(0) else: ans.append(prod) return ans # generated by online-judge-template-generator v4.4.0 (https://github.com/kmyk/online-judge-template-generator) def main(): import sys tokens = iter(sys.stdin.read().split()) H = int(next(tokens)) W = int(next(tokens)) A = [[None for _ in range(W)] for _ in range(H)] for j in range(H): for i in range(W): A[j][i] = int(next(tokens)) Q = int(next(tokens)) r = [None for _ in range(Q)] c = [None for _ in range(Q)] for i in range(Q): r[i] = int(next(tokens)) - 1 c[i] = int(next(tokens)) - 1 assert next(tokens, None) is None ans = solve(H, W, A, Q, r, c) print(*ans, sep='\n') if __name__ == '__main__': main()