結果
問題 | No.590 Replacement |
ユーザー |
![]() |
提出日時 | 2022-10-28 08:45:59 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 105 ms / 2,000 ms |
コード長 | 7,425 bytes |
コンパイル時間 | 1,985 ms |
コンパイル使用メモリ | 173,424 KB |
最終ジャッジ日時 | 2025-02-08 13:24:23 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 47 |
ソースコード
#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<unordered_set>#include<utility>#include<cassert>#include<complex>#include<numeric>#include<array>#include<chrono>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;//constexpr ll mod = 998244353;constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;template<typename T>void chmin(T& a, T b) {a = min(a, b);}template<typename T>void chmax(T& a, T b) {a = max(a, b);}template<typename T>void cinarray(vector<T>& v) {rep(i, v.size())cin >> v[i];}template<typename T>void coutarray(vector<T>& v) {rep(i, v.size()) {if (i > 0)cout << " "; cout << v[i];}cout << "\n";}ll mod_pow(ll x, ll n, ll m = mod) {if (n < 0) {ll res = mod_pow(x, -n, m);return mod_pow(res, m - 2, m);}if (abs(x) >= m)x %= m;if (x < 0)x += m;//if (x == 0)return 0;ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}//mod should be <2^31struct modint {int n;modint() :n(0) { ; }modint(ll m) {if (m < 0 || mod <= m) {m %= mod; if (m < 0)m += mod;}n = m;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }bool operator<(modint a, modint b) { return a.n < b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }modint operator/=(modint& a, modint b) { a = a / b; return a; }const int max_n = 1 << 21;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}modint combP(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[a - b];}ll gcd(ll a, ll b) {a = abs(a); b = abs(b);if (a < b)swap(a, b);while (b) {ll r = a % b; a = b; b = r;}return a;}using ld = long double;//typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-10;const ld pi = acosl(-1.0);template<typename T>void addv(vector<T>& v, int loc, T val) {if (loc >= v.size())v.resize(loc + 1, 0);v[loc] += val;}/*const int mn = 2000005;bool isp[mn];vector<int> ps;void init() {fill(isp + 2, isp + mn, true);for (int i = 2; i < mn; i++) {if (!isp[i])continue;ps.push_back(i);for (int j = 2 * i; j < mn; j += i) {isp[j] = false;}}}*///[,val)template<typename T>auto prev_itr(set<T>& st, T val) {auto res = st.lower_bound(val);if (res == st.begin())return st.end();res--; return res;}//[val,)template<typename T>auto next_itr(set<T>& st, T val) {auto res = st.lower_bound(val);return res;}using mP = pair<modint, modint>;mP operator+(mP a, mP b) {return { a.first + b.first,a.second + b.second };}mP operator+=(mP& a, mP b) {a = a + b; return a;}mP operator-(mP a, mP b) {return { a.first - b.first,a.second - b.second };}mP operator-=(mP& a, mP b) {a = a - b; return a;}LP operator+(LP a, LP b) {return { a.first + b.first,a.second + b.second };}LP operator+=(LP& a, LP b) {a = a + b; return a;}LP operator-(LP a, LP b) {return { a.first - b.first,a.second - b.second };}LP operator-=(LP& a, LP b) {a = a - b; return a;}mt19937 mt(time(0));const string drul = "DRUL";string senw = "SENW";//DRUL,or SENWint dx[4] = { 1,0,-1,0 };int dy[4] = { 0,1,0,-1 };//-----------------------------------------//x,yがax+by=gcd(a,b)の解になるll extgcd(ll a, ll b, ll& x, ll& y) {ll d = a;if (b != 0) {d = extgcd(b, a % b, y, x);y -= (a / b) * x;}else {x = 1; y = 0;}return d;}//a.first*x+a.second and b.first*x+b.secondLP crt(LP a, LP b) {ll a1 = a.first, b1 = a.second;ll a2 = b.first, b2 = b.second;ll g = gcd(a1, a2);ll l = (a1 / g) * a2;if ((b2 - b1) % g)return { -1,-1 };ll x, y;extgcd(a1, -a2, x, y);ll cg = a1 * x - a2 * y;// care overflowll res = x % l;res *= (b2 - b1) / cg;res %= l;res = a1 * res + b1;res %= l;if (res < 0)res += l;return { l,(ll)res };}void solve() {int n; cin >> n;vector<int> a(n); rep(i, n) {cin >> a[i]; a[i]--;}vector<int> b(n); rep(i, n) {cin >> b[i]; b[i]--;}vector<int> sza, szb;vector<P> ta(n), tb(n);vector<bool> used(n);int tmp = 0;rep(i, n) {if (used[i])continue;int cur = i;int ctmp = 0;while (!used[cur]) {ta[cur] = { tmp,ctmp };ctmp++; used[cur] = true; cur = a[cur];}tmp++;sza.push_back(ctmp);}fill(all(used), false);tmp = 0;rep(i, n) {if (used[i])continue;int cur = i;int ctmp = 0;while (!used[cur]) {tb[cur] = { tmp,ctmp };ctmp++; used[cur] = true; cur = b[cur];}tmp++;szb.push_back(ctmp);}using ar = array<int, 3>;map<ar, vector<ll>> mp;rep(i, n) {ar cur;cur[0] = ta[i].first;cur[1] = tb[i].first;int lena = sza[ta[i].first];int lenb = szb[tb[i].first];int loca = ta[i].second;int locb = tb[i].second;ll num = 0;int g = gcd(lena, lenb);int r = locb % g;num += r;locb -= r; loca -= r;if (loca < 0)loca += lena;cur[2] = loca % g;ll l = (ll)(lena / g) * lenb;lena /= g;lenb /= g;loca /= g;locb /= g;num += g*crt({ lena,loca }, { lenb,locb }).second;mp[cur].push_back(num);mp[cur].push_back(num + l);//cout << i << " " << cur[0] << " " << cur[1] << " " << cur[2] << " " << num << " " << l << "\n";}modint ans = 0;for (auto pv : mp) {auto v = pv.second;//cout << "?? " << v.size() << "\n";sort(all(v));//coutarray(v);rep(i, v.size() / 2) {ll len = v[i + 1] - v[i];modint num = len;num *= len - 1;num *= (1 + mod) / 2;ans += num;}}cout << ans << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);//init_f();//init();//expr();//while(true)//int t; cin >> t; rep(i, t)solve();return 0;}