結果
問題 | No.950 行列累乗 |
ユーザー | やむなく |
提出日時 | 2019-12-13 02:13:32 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,166 bytes |
コンパイル時間 | 2,636 ms |
コンパイル使用メモリ | 202,280 KB |
実行使用メモリ | 13,756 KB |
最終ジャッジ日時 | 2024-06-26 04:16:14 |
合計ジャッジ時間 | 6,466 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 28 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 25 ms
5,632 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 3 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | WA | - |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | TLE | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
testcase_48 | -- | - |
testcase_49 | -- | - |
testcase_50 | -- | - |
testcase_51 | -- | - |
testcase_52 | -- | - |
testcase_53 | -- | - |
testcase_54 | -- | - |
testcase_55 | -- | - |
testcase_56 | -- | - |
testcase_57 | -- | - |
testcase_58 | -- | - |
testcase_59 | -- | - |
testcase_60 | -- | - |
ソースコード
// // Created by yamunaku on 2019/12/13. // #include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < (n); i++) #define repl(i, l, r) for(int i = (l); i < (r); i++) #define per(i, n) for(int i = ((n)-1); i >= 0; i--) #define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--) #define all(x) (x).begin(),(x).end() #define MOD9 998244353 #define MOD1 1000000007 #define IINF 1000000000 #define LINF 1000000000000000000 #define SP <<" "<< #define CYES cout<<"Yes"<<endl #define CNO cout<<"No"<<endl #define CFS cin.tie(0);ios::sync_with_stdio(false) #define CST(x) cout<<fixed<<setprecision(x) using ll = long long; using ld = long double; using vi = vector<int>; using mti = vector<vector<int>>; using vl = vector<ll>; using mtl = vector<vector<ll>>; using pi = pair<int, int>; using pl = pair<ll, ll>; template<typename T> using heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>; ll p; mtl a, b; ll det(mtl &v, ll m){ return ((v[0][0] * v[1][1] % m - v[0][1] * v[1][0] % m) % m + m) % m; } mtl prod(mtl a, mtl b, ll m){ return { {(a[0][0] * b[0][0] % m + a[0][1] * b[1][0] % m) % m, (a[0][0] * b[0][1] % m + a[0][1] * b[1][1] % m) % m}, {(a[1][0] * b[0][0] % m + a[1][1] * b[1][0] % m) % m, (a[1][0] * b[0][1] % m + a[1][1] * b[1][1] % m) % m} }; } mtl mtpow(mtl v, ll x, ll m){ mtl ans = { {1, 0}, {0, 1} }; while(x){ if(x & 1) ans = prod(ans, v, m); x >>= 1; v = prod(v, v, m); } return ans; } ll modpow(ll x, ll a, ll m){ ll ans = 1; while(a){ if(a & 1) ans = ans * x % m; a >>= 1; x = x * x % m; } return ans; } ll inv(ll x, ll m){ return modpow(x, m - 2, m); } ll nlog(ll a, ll b, ll p){ // a^(i*r+j)=b // a^j = b/a^(i*r) ll r = sqrt(p) + 10; ll ar = inv(modpow(a, r, p), p); map<ll, ll> mp; ll tmp = b; rep(i, r){ auto itr = mp.find(tmp); if(itr == mp.end()) mp[tmp] = i; tmp = tmp * ar % p; } ll ans = LINF; tmp = 1; rep(i, r){ auto itr = mp.find(tmp); if(itr != mp.end()) ans = min(ans, (itr->second * r + i) % (p - 1)); tmp = tmp * a % p; } if(ans == LINF) return -1; return ans; } mtl mtinv(mtl a, ll p){ ll d = inv(det(a, p), p); return { {a[1][1] * d % p, (-a[0][1] * d % p + p) % p}, {(-a[1][0] * d % p + p) % p, a[0][0] * d % p}, }; } ll mtlog(mtl a, mtl b, ll p){ // a^(i*r+j)=b // a^j = b/a^(i*r) ll r = sqrt(p) + 1; mtl ar = mtinv(mtpow(a, r, p), p); map<mtl, ll> mp; mtl tmp = b; rep(i, r){ mp[tmp] = i; tmp = prod(tmp, ar, p); } ll ans = LINF; tmp = { {1, 0}, {0, 1} }; rep(i, r){ auto itr = mp.find(tmp); if(itr != mp.end()) ans = min(ans, itr->second * r + i); tmp = prod(tmp, a, p); } return ans; } int main(){ cin >> p; a = b = mtl(2, vl(2)); rep(i, 2) rep(j, 2) cin >> a[i][j]; rep(i, 2) rep(j, 2) cin >> b[i][j]; if(a == b){ cout << 1 << endl; return 0; } ll x = det(a, p), y = det(b, p); if(x == 0){ if(y > 0){ cout << -1 << endl; return 0; } ll ans = mtlog(a, b, p); if(ans == LINF) cout << -1 << endl; else cout << ans << endl; return 0; } if(y == 0){ cout << -1 << endl; return 0; } if(x == 1){ if(y > 1){ cout << -1 << endl; return 0; } ll ans = mtlog(a, b, p); if(ans == LINF) cout << -1 << endl; else cout << ans << endl; return 0; } ll l = nlog(x, y, p); mtl tmp = mtpow(a, l, p); if(tmp == b){ cout << l << endl; return 0; } a = mtpow(a, p - 1, p); b = prod(b, mtinv(tmp, p), p); if(a == b){ cout << p - 1 + l << endl; return 0; } ll ans = mtlog(a, b, p); if(ans == LINF) cout << -1 << endl; else cout << ans * (p - 1) + l << endl; return 0; }