結果
問題 | No.1112 冥界の音楽 |
ユーザー | brthyyjp |
提出日時 | 2020-07-10 22:56:26 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,755 bytes |
コンパイル時間 | 485 ms |
コンパイル使用メモリ | 86,300 KB |
実行使用メモリ | 88,112 KB |
最終ジャッジ日時 | 2023-08-01 13:13:29 |
合計ジャッジ時間 | 9,875 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
79,996 KB |
testcase_01 | AC | 68 ms
70,776 KB |
testcase_02 | AC | 66 ms
70,772 KB |
testcase_03 | AC | 64 ms
70,988 KB |
testcase_04 | AC | 63 ms
70,948 KB |
testcase_05 | AC | 69 ms
75,156 KB |
testcase_06 | AC | 144 ms
76,084 KB |
testcase_07 | AC | 64 ms
70,912 KB |
testcase_08 | AC | 64 ms
70,980 KB |
testcase_09 | AC | 73 ms
76,028 KB |
testcase_10 | AC | 64 ms
70,988 KB |
testcase_11 | AC | 81 ms
75,724 KB |
testcase_12 | AC | 62 ms
70,984 KB |
testcase_13 | AC | 65 ms
70,904 KB |
testcase_14 | AC | 381 ms
76,780 KB |
testcase_15 | AC | 113 ms
75,928 KB |
testcase_16 | AC | 64 ms
70,952 KB |
testcase_17 | AC | 155 ms
76,764 KB |
testcase_18 | AC | 148 ms
76,628 KB |
testcase_19 | AC | 63 ms
71,200 KB |
testcase_20 | AC | 83 ms
75,748 KB |
testcase_21 | AC | 297 ms
76,804 KB |
testcase_22 | AC | 437 ms
76,856 KB |
testcase_23 | AC | 133 ms
76,052 KB |
testcase_24 | AC | 64 ms
70,776 KB |
testcase_25 | AC | 66 ms
70,600 KB |
testcase_26 | AC | 72 ms
75,944 KB |
testcase_27 | AC | 73 ms
75,796 KB |
testcase_28 | AC | 80 ms
75,944 KB |
testcase_29 | AC | 65 ms
70,932 KB |
testcase_30 | AC | 274 ms
76,592 KB |
testcase_31 | AC | 72 ms
75,972 KB |
testcase_32 | AC | 294 ms
76,712 KB |
testcase_33 | AC | 71 ms
75,876 KB |
testcase_34 | AC | 63 ms
70,756 KB |
testcase_35 | AC | 69 ms
75,936 KB |
testcase_36 | TLE | - |
ソースコード
import sys input = sys.stdin.buffer.readline def main(): k, m, n = map(int, input().split()) #mod =10**9+7 PQR = [] for i in range(m): p, q, r = map(int, input().split()) p, q, r = p-1, q-1, r-1 PQR.append((p, q, r)) if n == 3: ans = 0 for i in range(m): p1, q1, r1 = PQR[i] if p1 == 0 and r1 == 0: ans += 1 print(ans) exit() A = [[0]*m for _ in range(m)] for i in range(m): p1, q1, r1 = PQR[i] for j in range(m): p2, q2, r2 = PQR[j] if q1 == p2 and r1 == q2: A[i][j] = 1 C = [[0]*m for _ in range(m)] for i in range(m): p1, q1, r1 = PQR[i] if p1 != 0: continue for j in range(m): p2, q2, r2 = PQR[j] if q1 == p2 and r1 == q2: C[i][j] = 1 # A*B def mul(a, b): c = [[0]*len(b[0]) for i in range(len(a))] for i in range(len(a)): for k in range(len(b)): for j in range(len(b[0])): c[i][j] = (c[i][j] + a[i][k]*b[k][j])%mod return c #A**n def pow(a, n): b = [[0]*len(a) for i in range(len(a))] for i in range(len(a)): b[i][i] = 1 while n > 0: if n & 1 == 1: b = mul(a, b) a = mul(a, a) n = n>>1 return b #print(C) B = mul(C, pow(A, n-4)) #print(B) ans = 0 for i in range(m): p1, q1, r1 = PQR[i] if r1 == 0: for j in range(m): ans += B[j][i] ans %= mod print(ans) if __name__ == '__main__': mod =10**9+7 main()