#852667 (PyPy3) No.2255 Determinant Sum

• 問題: No.2255 Determinant Sum
• ユーザー: tassei903
• 提出日時: 2023-03-24 22:26:15
• 言語: PyPy3 (7.3.15)
• 結果: WA
• 実行時間: -
• コード長: 2,376 bytes
• コンパイル時間: 139 ms
• コンパイル使用メモリ: 82,196 KB
• 実行使用メモリ: 77,192 KB
• 最終ジャッジ日時: 2024-09-18 17:18:02
• 合計ジャッジ時間: 3,010 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

ファイルパターン	結果
other	AC * 14 WA * 9

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
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))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX