結果
問題 | No.2255 Determinant Sum |
ユーザー | tassei903 |
提出日時 | 2023-03-24 22:26:15 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,376 bytes |
コンパイル時間 | 156 ms |
コンパイル使用メモリ | 81,756 KB |
実行使用メモリ | 76,544 KB |
最終ジャッジ日時 | 2023-10-18 21:15:50 |
合計ジャッジ時間 | 3,375 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
53,496 KB |
testcase_01 | AC | 38 ms
53,496 KB |
testcase_02 | AC | 62 ms
68,608 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 191 ms
76,332 KB |
testcase_07 | AC | 115 ms
76,380 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 140 ms
76,332 KB |
testcase_11 | AC | 75 ms
75,992 KB |
testcase_12 | WA | - |
testcase_13 | AC | 84 ms
76,352 KB |
testcase_14 | AC | 113 ms
76,344 KB |
testcase_15 | WA | - |
testcase_16 | AC | 115 ms
76,184 KB |
testcase_17 | AC | 121 ms
76,308 KB |
testcase_18 | AC | 104 ms
76,228 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 102 ms
76,280 KB |
testcase_22 | AC | 113 ms
76,144 KB |
ソースコード
import sys input = lambda :sys.stdin.readline()[:-1] ni = lambda :int(input()) na = lambda :list(map(int,input().split())) yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES") no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO") ####################################################################### #2D matrix def E(n): A = [[0 for j in range(n)]for i in range(n)] for i in range(n): A[i][i] = 1 return A def add(x,y): return x + y def mul(x, y): return x * y def mat_add(A, B, replace=False): assert len(A)==len(B) and len(A[0]) == len(B[0]) if not replace: A = [a.copy() for a in A] n = len(A) m = len(A[0]) for i in range(n): for j in range(m): A[i][j] = add(A[i][j], B[i][j]) return A def mat_mul(A,B): assert len(A[0]) == len(B) n = len(A) m = len(B[0]) p = len(A[0]) R = [[0 for j in range(m)]for i in range(n)] for i in range(n): for j in range(m): for k in range(p): R[i][j] += mul(A[i][k],B[k][j]) return R def mat_pow(A, x): assert len(A)==len(A[0]) n = len(A) R = E(n) while x > 0: if x&1: R = mat_mul(R, A) A = mat_mul(A,A) x >>= 1 return R def determinant(A, replace=False): if not replace: A = [a.copy() for a in A] n = len(A) res = 1 for i, a_i in enumerate(A): if a_i[i] == 0: for j in range(i+1, n): if A[j][i]: break else: return 0 A[i], A[j] = A[j], A[i] a_i = A[i] res = -res inv = pow(a_i[i], mod-2, mod) for j in range(i+1, n): a_j = A[j] t = a_j[i] * inv % mod for k in range(i+1, n): a_j[k] -= t * a_i[k] a_j[k] %= mod for i in range(n): res *= A[i][i] res %= mod return res def mat_pri(A): for i in A: print(*i) for _ in range(ni()): n, p = na() mod = p a = [na() for i in range(n)] for i in range(n): c = a[i].count(-1) for j in range(n): if a[i][j] == -1: a[i][j] = p * (p-1)//2%p elif c >= 1: a[i][j] = 0 print(determinant(a))