bzoj1119 [POI2009]SLO

Description

---

对于一个1-N的排列(ai)，每次你可以交换两个数ax与ay(x<>y)，代价为W(ax)+W(ay) 若干次交换的代价为每次交换的代价之和。请问将(ai)变为(bi)所需的最小代价是多少。

2<=n<=1000000
100<=wi<=6500

Solution

---

跟之前那题差不多，比较麻烦一点

Code

---

#include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)

typedef long long LL;
const int INF=0x7fffffff;
const int N=2000005;

LL a[N],b[N],c[N];
LL sum,size,min,MIN=INF;
bool vis[N];

void dfs(int i) {
    if (vis[i]) return ;
    sum+=a[b[i]];
    size++;
    min=std:: min(a[b[i]],min);
    vis[i]=1;
    dfs(c[b[i]]);
}

int main(void) {
    freopen("data.in","r",stdin);
    freopen("myp.out","w",stdout);
    int n; scanf("%d",&n);
    rep(i,1,n) scanf("%lld",&a[i]);
    rep(i,1,n) scanf("%lld",&b[i]);
    rep(i,1,n) {
        LL tmp; scanf("%lld",&tmp);
        c[tmp]=i;
    }
    rep(i,1,n) MIN=std:: min(MIN,a[i]);
    LL ans=0;
    rep(i,1,n) {
        min=INF; sum=size=0;
        dfs(i);
        if (size<=1) continue;
        ans+=std:: min(sum+(size-2)*min,sum+(size+1)*MIN+min);
    }
    printf("%lld\n", ans);
    return 0;
}