結果
問題 | No.950 行列累乗 |
ユーザー | convexineq |
提出日時 | 2020-01-31 00:52:45 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,292 bytes |
コンパイル時間 | 294 ms |
コンパイル使用メモリ | 87,268 KB |
実行使用メモリ | 122,188 KB |
最終ジャッジ日時 | 2023-10-14 09:08:27 |
合計ジャッジ時間 | 24,199 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 203 ms
87,428 KB |
testcase_01 | AC | 223 ms
87,412 KB |
testcase_02 | AC | 76 ms
71,676 KB |
testcase_03 | AC | 76 ms
71,748 KB |
testcase_04 | AC | 79 ms
71,616 KB |
testcase_05 | AC | 305 ms
91,884 KB |
testcase_06 | AC | 95 ms
76,668 KB |
testcase_07 | AC | 96 ms
76,656 KB |
testcase_08 | AC | 91 ms
76,808 KB |
testcase_09 | WA | - |
testcase_10 | AC | 81 ms
75,832 KB |
testcase_11 | AC | 86 ms
76,500 KB |
testcase_12 | AC | 84 ms
76,680 KB |
testcase_13 | AC | 93 ms
76,544 KB |
testcase_14 | AC | 95 ms
76,844 KB |
testcase_15 | AC | 78 ms
71,596 KB |
testcase_16 | AC | 87 ms
76,344 KB |
testcase_17 | AC | 77 ms
71,748 KB |
testcase_18 | AC | 84 ms
75,680 KB |
testcase_19 | AC | 77 ms
71,904 KB |
testcase_20 | AC | 77 ms
71,392 KB |
testcase_21 | WA | - |
testcase_22 | AC | 655 ms
111,576 KB |
testcase_23 | AC | 589 ms
106,260 KB |
testcase_24 | AC | 568 ms
108,888 KB |
testcase_25 | AC | 462 ms
100,292 KB |
testcase_26 | AC | 627 ms
108,496 KB |
testcase_27 | AC | 588 ms
103,584 KB |
testcase_28 | AC | 575 ms
110,548 KB |
testcase_29 | AC | 607 ms
105,512 KB |
testcase_30 | WA | - |
testcase_31 | AC | 558 ms
106,160 KB |
testcase_32 | AC | 767 ms
119,300 KB |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | AC | 602 ms
108,540 KB |
testcase_36 | AC | 209 ms
85,956 KB |
testcase_37 | AC | 204 ms
88,616 KB |
testcase_38 | AC | 211 ms
88,648 KB |
testcase_39 | AC | 208 ms
85,996 KB |
testcase_40 | AC | 642 ms
117,080 KB |
testcase_41 | AC | 658 ms
116,920 KB |
testcase_42 | WA | - |
testcase_43 | AC | 668 ms
121,224 KB |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | AC | 789 ms
122,120 KB |
testcase_47 | AC | 77 ms
71,740 KB |
testcase_48 | WA | - |
testcase_49 | AC | 779 ms
122,184 KB |
testcase_50 | AC | 788 ms
121,140 KB |
testcase_51 | AC | 777 ms
122,188 KB |
testcase_52 | AC | 260 ms
93,492 KB |
testcase_53 | AC | 261 ms
93,144 KB |
testcase_54 | AC | 74 ms
71,708 KB |
testcase_55 | AC | 73 ms
71,464 KB |
testcase_56 | AC | 227 ms
91,696 KB |
testcase_57 | AC | 360 ms
95,752 KB |
testcase_58 | WA | - |
testcase_59 | AC | 243 ms
93,420 KB |
testcase_60 | AC | 230 ms
93,340 KB |
ソースコード
def log_mod(a,b,MOD,permit0): a %= MOD; b %= MOD q = int(MOD**0.5)+2 # baby-step h = 1 if MOD != 1 else 0 memo = {} for i in range(q): if h==b and (permit0 or i): return i memo[h*b%MOD] = i h = h*a%MOD # giant-step #ここに来た時 h = a^q g = h for i in range(q): if g in memo: res = (i+1)*q-memo[g] if pow(a,res,MOD) == b: return res else: return -1 g = g*h%MOD return -1 #見つからない場合 def extgcd(x,y): if y==0: return 1,0 #g=x r0,r1,s0,s1 = x,y,1,0 while r1 != 0: r0,r1, s0,s1 = r1,r0%r1, s1,s0-r0//r1*s1 #g = r0 return s0,(r0-s0*x)//y def modinv(a,MOD): x,y = extgcd(a,MOD) return x%MOD def matmul(A,B,mod): # A,B: 行列 res = [[0]*len(B[0]) for _ in [None]*len(A)] for i, resi in enumerate(res): for k, aik in enumerate(A[i]): for j,bkj in enumerate(B[k]): resi[j] += aik*bkj resi[j] %= mod return res def matpow(A,p,M): #A^p mod M if p%2: return matmul(A, matpow(A,p-1,M), M) elif p > 0: b = matpow(A,p//2,M) return matmul(b,b,M) else: return [[1 if i == j else 0 for j in range(len(A))] for i in range(len(A))] # coding: utf-8 # Your code here! import sys sys.setrecursionlimit(10**6) readline = sys.stdin.readline read = sys.stdin.read def hash_projective(A): c = A[0]+A[1] for i in range(4): if c[i] != 0: cinv = modinv(c[i],MOD) return tuple([i*cinv%MOD for i in c]) else: return((0,0,0,0)) def hash_equal(A): return tuple(A[0]+A[1]) def discrete_logarithm(a,b,MOD,hashing,permit0): q = int(MOD**0.5)+10 # baby-step h = [[1,0],[0,1]] memo = {} for i in range(q): if hashing(h)==hashing(b) and (permit0 or i): return i memo[hashing(matmul(h,b,MOD))] = i h = matmul(h,a,MOD) # giant-step #ここに来た時 h = a^q g = [i[:] for i in h] for i in range(q): if hashing(g) in memo: res = (i+1)*q-memo[hashing(g)] if hashing(matpow(a,res,MOD)) == hashing(b): return res else: return -1 g = matmul(g,h,MOD) return -1 #見つからない場合 def det(A): return (A[0][0]*A[1][1]-A[1][0]*A[0][1])%MOD MOD = int(input()) A = [[int(i) for i in readline().split()] for _ in range(2)] B = [[int(i) for i in readline().split()] for _ in range(2)] E = [[1,0],[0,1]] if det(A) == 0: print(discrete_logarithm(A,B,MOD,hash_equal,0)) else: # A^ai == r E , A^bi == s B # A^(xai+bi) == B なら r^x E= (B (A^bi)^{-1}) ai = discrete_logarithm(A,E,MOD,hash_projective,0) Ar = matpow(A,ai,MOD) r = Ar[0][0] bi = discrete_logarithm(A,B,MOD,hash_projective,1) C = matpow(A,bi,MOD) dd = modinv(det(C),MOD) #print(C,B) Cinv = [[C[1][1]*dd%MOD,-C[0][1]*dd%MOD], [-C[1][0]*dd%MOD,C[0][0]*dd%MOD]] B = matmul(B,Cinv,MOD) s = B[0][0] #print(Ar,B) # r^x = s mod P を解く x = log_mod(r,s,MOD,1) #print(r,s,x,ai,bi) if x == -1: print(-1) else: ans = x*ai+bi if ans: print(ans) else: print(log_mod(r,s,MOD,0))