結果
| 問題 | No.3170 [Cherry 7th Tune KY] Even if you could say "See you ..." |
| コンテスト | |
| ユーザー |
 hint908
|
| 提出日時 | 2025-05-30 22:56:38 |
| 言語 | C++17 (gcc 15.2.0 + boost 1.90.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 5,848 bytes |
| 記録 | |
| コンパイル時間 | 1,117 ms |
| コンパイル使用メモリ | 209,240 KB |
| 最終ジャッジ日時 | 2026-07-11 07:30:54 |
| 合計ジャッジ時間 | 1,920 ms |
|
ジャッジサーバーID （参考情報） |
judge1_0 / judge3_0 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/unordered_map.h:33,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/unordered_map:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/functional:65,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/x86_64-pc-linux-gnu/bits/stdc++.h:55,
from main.cpp:6:
/home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/hashtable.h: In instantiation of 'class std::_Hashtable<__int128, std::pair<const __int128, int>, std::allocator<std::pair<const __int128, int> >, std::__detail::_Select1st, std::equal_to<__int128>, std::hash<__int128>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<true, false, true> >':
/home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/unordered_map.h:115:18: required from 'class std::unordered_map<__int128, int>'
115 | _Hashtable _M_h;
| ^~~~
main.cpp:158:34: required from here
158 | unordered_map<__int128, int> memo;
| ^~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/hashtable.h:210:51: error: static assertion failed: hash function must be copy constructible
210 | static_assert(is_copy_constructible<_Hash>::value,
| ^~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@15/15.3.0/include/c++/15/bits/hashtable.h:210:51: note: 'std::integral_constant<bool, false>::value' evaluates to false
main.cpp: In function 'void solve()':
main.cpp:158:34: error: use of deleted function 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = __int128; _Tp = int; _Hash = std::hash<__int128>; _Pred = std::equal_to<__int128>; _Alloc = std::allocator<std::pair<c
ソースコード
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout() cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))
template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }
ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}
VV<ll> matmul(VV<ll> v, VV<ll> w, ll p=(1ll<<60)){
ll n1 = v.size();
ll n2 = w.size();
ll n3 = w[0].size();
VV<ll> ret(n1, V<ll>(n3, 0));
rep(i, n1) rep(j,n2) rep(k,n3) (ret[i][k] += v[i][j]*w[j][k]) %= p;
return ret;
}
VV<ll> matpow(VV<ll> v, ll k, ll p){
if(k == 1) return v;
ll n = v.size();
VV<ll> ret(n, V<ll>(n, 0));
rep(i, n) ret[i][i] = 1;
if(k == 0) return ret;
VV<ll> w = matpow(v, k/2, p);
w = matmul(w, w, p);
if(k%2) w = matmul(w, v, p);
return w;
}
struct Combination{
vector<long long> fac, inv, finv;
long long MOD;
Combination(long long N = 200100, long long p = 998244353) : fac(N, 1), inv(N, 1), finv(N, 1), MOD(p){
for(long long i = 2; i < N; i++){
fac[i] = fac[i-1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
finv[i] = finv[i-1] * inv[i] % MOD;
}
}
long long com(long long n, long long k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}
long long per(long long n, long long k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n] * finv[n-k] % MOD;
}
};
long long modpow(long long n, long long k, long long p = mod){
long long a = n % p;
long long ans = 1;
while(k != 0) {
if(k & 1) ans = ans * a % p;
k /= 2;
a = a * a % p;
}
return ans;
}
// n^(-1) ≡ b (mod p) となる b を求める
long long modinv(long long n, long long p = mod) {
// if(n == 1) return 1;
// return p - modinv(p % n) * (p / n) % p;
return modpow(n, p - 2, p);
}
// n^k ≡ b (mod p) となる最小の k を求める
long long modlog(long long n, long long b, long long p = mod){
long long sqrt_p = sqrt(p);
unordered_map<long long , long long> n_pow;
long long memo = 1;
for(long long i = 0; i < sqrt_p; i ++){
if(!n_pow.count(memo)) n_pow[memo] = i;
memo = memo * n % p;
}
memo = modinv(memo, p);
long long ans = 0;
while(!n_pow.count(b)){
if(ans >= p) return -1;
ans += sqrt_p;
b = b * memo % p;
}
ans += n_pow[b];
return ans % (p - 1);
}
// ax + by = gcd(a, b) を満たす (x, y) が格納される
long long ext_gcd(long long a, long long b, long long &x, long long &y){
if(b == 0){
x = 1;
y = 0;
return a;
}
long long d = ext_gcd(b, a%b, y, x);
y -= a/b*x;
return d;
}
void solve(){
ll p;
cin >> p;
VV<ll> a(2, V<ll>(2)), b(2, V<ll>(2));
rep(i,2) rep(j,2) cin >> a[i][j];
rep(i,2) rep(j,2) cin >> b[i][j];
VV<ll> c = {{1, 0}, {0, 1}};
unordered_map<__int128, int> memo;
ll A = p+10;
rep(i, A){
if(c == b){
cout << i << endl;
return;
}
__int128 q = 0;
rep(x,2) rep(y,2){
q = q*p + c[x][y];
}
// cout << i << " " << (long long)(q/1000000000000000000) << " " << (long long)(q%(1000000000000000000)) << endl;
if(!memo.count(q))memo[q] = i;
c = matmul(c, a, p);
}
if((a[0][0]*a[1][1] - a[0][1]*a[1][0])%p==0){
cout << -1 << endl;
return;
}
ll ans = INF;
ll x = modinv((c[0][0]*c[1][1] - c[0][1]*c[1][0])%p+p, p);
VV<ll> inv = {{c[1][1], -c[0][1]},{-c[1][0], c[0][0]}};
rep(i,2) rep(j,2){
inv[i][j] *= x;
inv[i][j] %= p;
inv[i][j] += p;
inv[i][j] %= p;
}
ll xx = 0;
rep(i, p+10){
__int128 q = 0;
rep(x, 2) rep(y,2){
q = q*p + b[x][y];
}
// cerr << i << " " << (long long)(q/1000000000000000000) << " " << (long long)(q%(1000000000000000000)) << endl;
if(memo.count(q)) chmin(ans, memo[q]+i*A);
b = matmul(b, inv, p);
}
if(ans == INF) ans = -1;
cout << ans << endl;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int t=1;
cin >> t;
rep(i,t) solve();
}