【bzoj1119】SLO 置换群

AC通道：http://www.lydsy.com/JudgeOnline/problem.php?id=1119

【题解】

这题和牛排序那道题是一样的，而且不用离散化。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
#define FILE "read"
#define INF 1000000000
#define MAXN 1000010
#define up(i,j,n) for(ll i=j;i<=n;++i)
#define dn(i,j,n) for(ll i=j;i>=n;--i)
#define cmax(a,b) a=max(a,b)
#define cmin(a,b) a=min(a,b)
namespace INIT{
	char buf[1<<15],*fs,*ft;
	inline char getc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
	inline ll read(){
		ll x=0,f=1;  char ch=getc();
		while(!isdigit(ch)) {if(ch=='-')  f=-1;  ch=getc();}
		while(isdigit(ch))  {x=x*10+ch-'0';  ch=getc();}
		return x*f;
	}
}using namespace INIT;
ll n,len,ans,Minn,v[MAXN],a[MAXN],b[MAXN],p[MAXN],vis[MAXN],size[MAXN],minn[MAXN],sum[MAXN];
void solve(ll x){
	size[++len]=1;  vis[a[x]]=1;  sum[len]+=v[a[x]];  cmin(minn[len],v[a[x]]);
	for(ll i=b[x];i!=a[x];i=b[p[i]]){
		size[len]++;  vis[i]=1;  sum[len]+=v[i];  cmin(minn[len],v[i]);
	}
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	n=read();  memset(minn,127/3,sizeof(minn));  Minn=INF;
	up(i,1,n)  v[i]=read(),cmin(Minn,v[i]);
	up(i,1,n)  a[i]=read(),p[a[i]]=i;
	up(i,1,n)  b[i]=read();
	up(i,1,n)  if(a[i]!=b[i]&&!vis[a[i]])  solve(i);
	up(i,1,len)  ans+=min(sum[i]+minn[i]*(size[i]-2),sum[i]+minn[i]+Minn*(size[i]+1));
	printf("%lld\n",ans);
	return 0;
}