結果
問題 | No.2405 Minimal Matrix Decomposition |
ユーザー | chineristAC |
提出日時 | 2023-08-04 22:26:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 429 ms / 2,000 ms |
コード長 | 1,404 bytes |
コンパイル時間 | 509 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 81,880 KB |
最終ジャッジ日時 | 2024-04-22 20:43:42 |
合計ジャッジ時間 | 8,119 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
52,480 KB |
testcase_01 | AC | 34 ms
52,608 KB |
testcase_02 | AC | 33 ms
52,480 KB |
testcase_03 | AC | 36 ms
52,608 KB |
testcase_04 | AC | 64 ms
77,312 KB |
testcase_05 | AC | 429 ms
81,880 KB |
testcase_06 | AC | 31 ms
52,608 KB |
testcase_07 | AC | 31 ms
52,352 KB |
testcase_08 | AC | 31 ms
52,352 KB |
testcase_09 | AC | 32 ms
52,864 KB |
testcase_10 | AC | 210 ms
79,580 KB |
testcase_11 | AC | 249 ms
80,156 KB |
testcase_12 | AC | 51 ms
68,224 KB |
testcase_13 | AC | 85 ms
77,472 KB |
testcase_14 | AC | 97 ms
77,500 KB |
testcase_15 | AC | 68 ms
77,056 KB |
testcase_16 | AC | 59 ms
72,704 KB |
testcase_17 | AC | 132 ms
78,264 KB |
testcase_18 | AC | 100 ms
77,324 KB |
testcase_19 | AC | 103 ms
77,696 KB |
testcase_20 | AC | 50 ms
66,560 KB |
testcase_21 | AC | 63 ms
75,136 KB |
testcase_22 | AC | 204 ms
79,000 KB |
testcase_23 | AC | 54 ms
65,792 KB |
testcase_24 | AC | 51 ms
66,560 KB |
testcase_25 | AC | 63 ms
74,496 KB |
testcase_26 | AC | 161 ms
78,796 KB |
testcase_27 | AC | 85 ms
77,368 KB |
testcase_28 | AC | 140 ms
78,676 KB |
testcase_29 | AC | 76 ms
77,484 KB |
testcase_30 | AC | 183 ms
79,204 KB |
testcase_31 | AC | 100 ms
77,696 KB |
testcase_32 | AC | 55 ms
69,632 KB |
testcase_33 | AC | 159 ms
78,424 KB |
testcase_34 | AC | 71 ms
76,928 KB |
testcase_35 | AC | 36 ms
59,520 KB |
testcase_36 | AC | 83 ms
77,696 KB |
testcase_37 | AC | 114 ms
77,696 KB |
testcase_38 | AC | 112 ms
78,276 KB |
testcase_39 | AC | 152 ms
78,592 KB |
testcase_40 | AC | 95 ms
77,312 KB |
testcase_41 | AC | 57 ms
68,992 KB |
testcase_42 | AC | 188 ms
78,976 KB |
testcase_43 | AC | 85 ms
77,708 KB |
testcase_44 | AC | 81 ms
77,076 KB |
testcase_45 | AC | 61 ms
72,960 KB |
testcase_46 | AC | 80 ms
77,364 KB |
testcase_47 | AC | 86 ms
77,432 KB |
testcase_48 | AC | 60 ms
72,960 KB |
testcase_49 | AC | 49 ms
66,688 KB |
ソースコード
import sys input = lambda :sys.stdin.readline().rstrip() mod = int(input()) N,M = map(int,input().split()) A = [list(map(int,input().split())) for i in range(N)] original = [[A[i][j] for j in range(M)] for i in range(N)] rank = 0 B = [[] for i in range(N)] C = [] for j in range(M): pivot = -1 for i in range(j,N): if A[i][j]!=0: pivot = i break if pivot == -1: continue rank += 1 C.append([A[pivot][j] for j in range(M)]) inv = pow(A[pivot][j],mod-2,mod) for i in range(N): if i == pivot: continue t = A[i][j] * inv % mod B[i].append(t) for k in range(j,M): A[i][k] -= A[pivot][k] * t % mod A[i][k] %= mod #print(A[i]) B[pivot].append(1) for j in range(M): A[pivot][j] = 0 #print() if rank == 0: if N*M >= N+M: print(2) print(N,1) for i in range(N): print(0) print(1,M) print(*[0]*M) exit() else: print(1) print(N,M) for i in range(N): print(*[0]*M) exit() if N*M <= rank * (N+M): print(1) print(N,M) for i in range(N): print(*original[i]) else: print(2) print(N,rank) for i in range(N): print(*B[i]) print(rank,M) for i in range(rank): print(*C[i])