题意:https://www.luogu.com.cn/problem/AT_abc256_e
思路:首先对于理想情况来说我们建i到a[i]的有向边,如果没有出现环说明可以存在0的情况,如果出现环那么我们可以反转一条边使得环断开。所以最小便是环上最小值累加。找环的话我们先跑一边拓扑,没被遍历到的点就是环上的点,然后直接找最小值就行。
/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
int a[200005];
int c[200005];
vector<int> vc[200005];
int cnt[200005];
int vis[200005];
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
vc[i].push_back(a[i]);
++cnt[a[i]];
}
for (int i = 1; i <= n; i++) {
cin >> c[i];
}
queue<int> q;
for (int i = 1; i <= n; i++) {
if (cnt[i] == 0) {
q.push(i);
}
}
while (!q.empty()) {
int u = q.front();
q.pop();
vis[u] = 1;
int v = vc[u][0];
cnt[v]--;
if (cnt[v] == 0) {
q.push(v);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
int mi = c[i];
int j = i;
while (vis[j] == 0) {
vis[j] = 1;
mi = min(mi, c[j]);
j = vc[j][0];
}
ans += mi;
}
}
cout << ans << endl;
return 0;
}