题目描述
题解
和普通的置换差不多,费用换一下。
代码
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define LL long long
const int max_n=1e6+5;
const int INF=2e9;
int n,Min,j,k,t;
int w[max_n],a[max_n],b[max_n],cnt[max_n];
bool used[max_n];
LL sum,ans;
int main()
{
scanf("%d",&n);
Min=INF;
for (int i=1;i<=n;++i)
{
scanf("%d",&w[i]);
Min=min(Min,w[i]);
}
for (int i=1;i<=n;++i) scanf("%d",&a[i]);
for (int i=1;i<=n;++i)
{
scanf("%d",&b[i]);
cnt[b[i]]=i;
}
for (int i=1;i<=n;++i)
if (!used[i])
{
j=i;
k=0;
sum=0;
t=w[a[j]];
while (!used[j])
{
k++;
sum+=(LL)w[a[j]];
t=min(t,w[a[j]]);
used[j]=true;
j=cnt[a[j]];
}
if (1<k) ans+=sum;
if (2<k)
{
LL tmp1=(LL)(k-2)*(LL)t;
LL tmp2=(LL)(k+1)*(LL)Min+(LL)t;
ans+=min(tmp1,tmp2);
}
}
printf("%lld\n",ans);
}