#167183 (C++11) No.590 Replacement

• 問題: No.590 Replacement
• ユーザー: ixmel
• 提出日時: 2017-04-21 17:04:52
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 156 ms / 2,000 ms
• コード長: 2,605 bytes
• コンパイル時間: 1,206 ms
• コンパイル使用メモリ: 107,872 KB
• 実行使用メモリ: 22,760 KB
• 最終ジャッジ日時: 2024-07-20 05:07:56
• 合計ジャッジ時間: 5,388 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	8 ms; 5,376 KB
testcase_08	AC	4 ms; 5,376 KB
testcase_09	AC	8 ms; 5,376 KB
testcase_10	AC	5 ms; 5,376 KB
testcase_11	AC	3 ms; 5,376 KB
testcase_12	AC	8 ms; 5,376 KB
testcase_13	AC	38 ms; 6,068 KB
testcase_14	AC	54 ms; 6,876 KB
testcase_15	AC	4 ms; 5,376 KB
testcase_16	AC	15 ms; 5,376 KB
testcase_17	AC	21 ms; 5,376 KB
testcase_18	AC	93 ms; 10,568 KB
testcase_19	AC	92 ms; 9,480 KB
testcase_20	AC	22 ms; 5,376 KB
testcase_21	AC	106 ms; 10,524 KB
testcase_22	AC	104 ms; 12,324 KB
testcase_23	AC	114 ms; 11,748 KB
testcase_24	AC	114 ms; 11,752 KB
testcase_25	AC	118 ms; 10,972 KB
testcase_26	AC	122 ms; 11,116 KB
testcase_27	AC	118 ms; 12,008 KB
testcase_28	AC	112 ms; 10,728 KB
testcase_29	AC	110 ms; 10,600 KB
testcase_30	AC	121 ms; 10,220 KB
testcase_31	AC	121 ms; 11,624 KB
testcase_32	AC	108 ms; 11,848 KB
testcase_33	AC	1 ms; 5,376 KB
testcase_34	AC	2 ms; 5,376 KB
testcase_35	AC	1 ms; 5,376 KB
testcase_36	AC	85 ms; 14,180 KB
testcase_37	AC	84 ms; 13,416 KB
testcase_38	AC	80 ms; 12,516 KB
testcase_39	AC	80 ms; 12,516 KB
testcase_40	AC	146 ms; 16,616 KB
testcase_41	AC	156 ms; 16,744 KB
testcase_42	AC	84 ms; 12,520 KB
testcase_43	AC	83 ms; 11,372 KB
testcase_44	AC	137 ms; 22,760 KB
testcase_45	AC	88 ms; 13,420 KB
testcase_46	AC	90 ms; 14,184 KB

ソースコード

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mt make_tuple
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef tuple<ll,ll,ll> tp;
typedef vector<tp> vt;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=1e16;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
ll gcd(ll a,ll b){
	return (b==0?a:gcd(b,a%b));
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
ll n,size,co;
vvi in,info,siz;
vi used;
void f(int a,int b){
	int t=a;
	do{
		if(used[t])break;
		used[t]=true;
		info[b*2][t]=co;
		info[b*2+1][t]=size++;
		t=in[b][t];
	}while(1);
}
int main(){
	cin>>n;
	assert(1<=n&&n<=100000);
	in=vvi(2,vi(n));//a,b
	info=vvi(4,vi(n));//numa,in_numa,numb,in_numb
	siz=vvi(2);//num_loop
	rep(i,2)rep(j,n)cin>>in[i][j];
	rep(i,2)rep(j,n)assert(1<=in[i][j]&&in[i][j]<=n);
	rep(i,2)rep(j,n)in[i][j]--;
	rep(i,2){
		vi asr(n);
		rep(j,n){
			if(asr[in[i][j]])assert(0);
			asr[in[i][j]]=1;
		}
	}
	rep(i,2){
		used=vi(n);
		size=0,co=0;//loop_size,num_loop
		rep(j,n)if(used[j]==0){
			size=0;
			f(j,i);
			siz[i].pb(size);
			co++;
		}
	}
	map<tp,vi>ma;
	rep(i,n){
		ll gc_d=gcd(siz[0][info[0][i]],siz[1][info[2][i]]);
		ll t=(info[1][i]%gc_d-info[3][i]%gc_d+gc_d)%gc_d;
		ma[mt(info[0][i],info[2][i],t)].pb(i);
	}
	ll out=0,MOD=1000000007,divby2=500000004;//divby2=埋め込み
	for(auto it=ma.begin();it!=ma.end();it++){
		ll loop_a,loop_b,gomi;
		vi node=it->second;
		tie(loop_a,loop_b,gomi)=it->first;
		ll siz_a=siz[0][loop_a],siz_b=siz[1][loop_b];
		ll gc_d=gcd(siz_a,siz_b);
		vi point(siz_a/gc_d);
		ll now=0;
		rep(i,siz_a/gc_d){
			point[now]=i;
			(now+=siz_b/gc_d)%=siz_a/gc_d;
		}
		vi co(node.size());
		rep(i,node.size()){
			ll a=info[1][node[i]],b=info[3][node[i]];
			ll t=(a-b+(ll)1e6*siz_a)%siz_a;
			co[i]=point[t/gc_d]*siz_b+b;
		}
		sort(all(co));
		co.pb(lcm(siz_a,siz_b)+co[0]);
		rep(i,co.size()-1){
			ll sa=co[i+1]-co[i]-1;
			sa%=MOD;
			(out+=sa*(sa+1)%MOD*divby2%MOD)%=MOD;
		}
	}
	cout<<out<<endl;
}