結果
問題 | No.590 Replacement |
ユーザー |
|
提出日時 | 2022-10-17 23:51:04 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 150 ms / 2,000 ms |
コード長 | 4,022 bytes |
コンパイル時間 | 2,624 ms |
コンパイル使用メモリ | 217,724 KB |
最終ジャッジ日時 | 2025-02-08 07:49:40 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 47 |
ソースコード
#include<bits/stdc++.h>using namespace std;//#pragma GCC optimize("Ofast")#define rep(i,n) for(ll i=0;i<n;i++)#define repl(i,l,r) for(ll i=(l);i<(r);i++)#define per(i,n) for(ll i=(n)-1;i>=0;i--)#define perl(i,r,l) for(ll i=r-1;i>=l;i--)#define fi first#define se second#define pb push_back#define ins insert#define pqueue(x) priority_queue<x,vector<x>,greater<x>>#define all(x) (x).begin(),(x).end()#define CST(x) cout<<fixed<<setprecision(x)#define vtpl(x,y,z) vector<tuple<x,y,z>>#define rev(x) reverse(x);using ll=long long;using vl=vector<ll>;using vvl=vector<vector<ll>>;using pl=pair<ll,ll>;using vpl=vector<pl>;using vvpl=vector<vpl>;const ll MOD=1000000007;const ll MOD9=998244353;const int inf=1e9+10;const ll INF=4e18;const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}struct UnionFind {vector<int> par;vector<int> edge;UnionFind(int n) : par(n, -1),edge(n, 0) {}int root(int x) {if (par[x] < 0) return x;else return par[x] = root(par[x]);}bool same(int x, int y) {return root(x) == root(y);}bool merge(int x, int y) {x = root(x); y = root(y);if (x == y) {edge[x]++;return false;}if (par[x] > par[y]) swap(x, y);par[x] += par[y];par[y] = x;edge[x] += edge[y]+1;return true;}int size(int x) {return -par[root(x)];}};//中国剰余定理// 返り値: a と b の最大公約数// ax + by = gcd(a, b) を満たす (x, y) が格納されるlong long extGcd(long long a, long long b, long long &x, long long &y) {if (b == 0) { x = 1; y = 0; return a; }long long d = extGcd(b, a%b, y, x);y -= a/b * x;return d;}//-1が帰ってくる可能性に注意pair<long long, long long> ChineseRem(const vector<long long> &b, const vector<long long> &m) {long long r = 0, M = 1;for (int i = 0; i < (int)b.size(); ++i) {long long p, q;long long d = extGcd(M, m[i], p, q); // p is inv of M/d (mod. m[i]/d)if ((b[i] - r) % d != 0) return make_pair(0, -1);long long tmp = (b[i] - r) / d * p % (m[i]/d);r += M * tmp;M *= m[i]/d;}return make_pair((r+M+M)%M, M);}int main(){ll n;cin >> n;vl a(n),b(n);rep(i,n)cin >> a[i],a[i]--;rep(i,n)cin >> b[i],b[i]--;UnionFind ua(n),ub(n);rep(i,n)ua.merge(i,a[i]);rep(i,n)ub.merge(i,b[i]);map<ll,vl> mp;rep(i,n){mp[(ll)ua.root(i)*n+ub.root(i)].emplace_back(i);}vl dpa(n),dpb(n);rep(i,n){if(i!=ua.root(i))continue;ll now=i;rep(j,ua.size(i)){dpa[now]=j;now=a[now];}}rep(i,n){if(i!=ub.root(i))continue;ll now=i;rep(j,ub.size(i)){dpb[now]=j;now=b[now];}}ll ans=0;for(auto [p,v]:mp){//cout << "xx" << p << endl;ll x=p/n,y=p%n;ll g=gcd(ua.size(x),ub.size(y));map<ll,vl> memo;ll l;for(auto z:v){ll f=((dpa[z]-dpb[z])%g+g)%g;ll m=ua.size(x);ll na=((dpa[z]-f)%m+m)%m;auto [val,lc]=ChineseRem({na,dpb[z]},{m,ub.size(y)});memo[f].emplace_back(val);l=lc;}for(auto [hoge,vals]:memo){sort(all(vals));vals.emplace_back(l+vals[0]);rep(i,vals.size()-1){ll s=vals[i+1]-vals[i];s%=MOD;ans+=s*(s-1)/2;ans%=MOD;}//cout << l << endl;//for(auto f:vals)cout << f <<" ";cout << endl;}}cout << ans%MOD << endl;}