建一个n个点的图,若ax在b中的位置是y,就连一条x->y的边,每次可以交换两个出度,代价是wx+wy,问让所有边连成自环的最小花费
每个环显然选出最小的wx顺着环换,也可以额外花费一些,和其他环并在一起,用其他环的wx换
判一下就行了
code:
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
inline void read(int &x)
{
char c; while(!((c=getchar())>='0'&&c<='9'));
x=c-'0';
while((c=getchar())>='0'&&c<='9') (x*=10)+=c-'0';
}
const int maxn = 1100000;
int n,mn;
int w[maxn],a[maxn],b[maxn],p[maxn];
int fa[maxn],s[maxn],num[maxn];
int findfa(const int x){return fa[x]==x?x:fa[x]=findfa(fa[x]);}
ll re;
int main()
{
read(n); mn=6600;
for(int i=1;i<=n;i++) read(w[i]),mn=min(w[i],mn);
for(int i=1;i<=n;i++) read(a[i]);
for(int i=1;i<=n;i++) read(b[i]),p[b[i]]=i;
for(int i=1;i<=n;i++) fa[i]=i,s[i]=w[i],num[i]=1;
for(int i=1;i<=n;i++) if(a[i]!=b[i])
{
int f1=findfa(a[i]),f2=findfa(a[p[a[i]]]);
if(f1!=f2)
{
fa[f2]=f1; num[f1]+=num[f2];
s[f1]=min(s[f1],s[f2]);
}
}
for(int i=1;i<=n;i++)
{
int f1=findfa(i);
if(num[f1]>1) re+=w[i];
if(f1==i&&num[f1]>1) re+=min(s[f1]+(ll)mn*(num[f1]+1),(ll)s[f1]*(num[f1]-2));
}
printf("%lld\n",re);
return 0;
}