結果
問題 | No.1648 Sum of Powers |
ユーザー | tamato |
提出日時 | 2021-08-13 23:03:16 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,977 bytes |
コンパイル時間 | 150 ms |
コンパイル使用メモリ | 82,408 KB |
実行使用メモリ | 92,040 KB |
最終ジャッジ日時 | 2024-04-14 20:02:24 |
合計ジャッジ時間 | 16,611 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 196 ms
91,644 KB |
testcase_01 | AC | 165 ms
77,052 KB |
testcase_02 | AC | 45 ms
64,072 KB |
testcase_03 | AC | 46 ms
64,040 KB |
testcase_04 | AC | 46 ms
64,360 KB |
testcase_05 | AC | 46 ms
65,188 KB |
testcase_06 | AC | 46 ms
63,972 KB |
testcase_07 | AC | 46 ms
63,968 KB |
testcase_08 | AC | 46 ms
63,820 KB |
testcase_09 | AC | 46 ms
64,956 KB |
testcase_10 | AC | 45 ms
63,580 KB |
testcase_11 | AC | 45 ms
63,828 KB |
testcase_12 | AC | 46 ms
64,528 KB |
testcase_13 | AC | 45 ms
64,592 KB |
testcase_14 | AC | 44 ms
63,496 KB |
testcase_15 | AC | 45 ms
65,168 KB |
testcase_16 | AC | 45 ms
65,664 KB |
testcase_17 | AC | 46 ms
64,128 KB |
testcase_18 | AC | 44 ms
64,728 KB |
testcase_19 | AC | 46 ms
64,476 KB |
testcase_20 | AC | 44 ms
63,004 KB |
testcase_21 | AC | 47 ms
63,780 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | AC | 168 ms
77,076 KB |
testcase_49 | AC | 47 ms
65,356 KB |
testcase_50 | AC | 47 ms
65,356 KB |
testcase_51 | AC | 42 ms
60,212 KB |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | AC | 39 ms
59,708 KB |
ソースコード
mod = 998244353 eps = 10**-9 def main(): import sys input = sys.stdin.readline def matmul(A, B): C = [[0] * len(B[0]) for _ 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 def matpow(A, p): n = len(A) B = [[0] * n for _ in range(n)] for i in range(n): B[i][i] = 1 while p > 0: if p & 1: B = matmul(B, A) A = matmul(A, A) p >>= 1 return B # x**k == y % mod # O(mod**0.5) def DiscreteLog(x, y, mod): m = int(mod ** 0.5) + 1 dic = {1: 0} # baby-step xi = 1 for i in range(1, m + 1): xi = (xi * x) % mod dic[xi] = i if y in dic: return dic[y] # giant-step r = pow(xi, mod - 2, mod) for a in range(1, m + 1): y = (y * r) % mod if y in dic: return a * m + dic[y] return -1 A, B, P, Q = map(int, input().split()) if B == 0: print(DiscreteLog(A, P, mod)) exit() M = [[A, -B], [1, 0]] B_inv = pow(B, mod-2, mod) M_inv = [[0, 1], [(-B_inv)%mod, (A * B_inv)%mod]] M_pow = {} M_cur = [[1, 0], [0, 1]] initial_vec = [[A], [2]] for i in range(1, 10 ** 5 + 1): M_cur = matmul(M_cur, M) U = matmul(M_cur, initial_vec) U_hash = U[0][0] * mod + U[1][0] M_pow[U_hash] = i M_inv_cur = [[1, 0], [0, 1]] last_vec = [[P], [Q]] for i in range(1, 10 ** 5 + 1): M_inv_cur = matmul(M_inv_cur, M_inv) V = matmul(M_inv_cur, last_vec) V_hash = V[0][0] * mod + V[1][0] if V_hash in M_pow: j = M_pow[V_hash] print(i + j + 1) exit() if __name__ == '__main__': main()