-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathopen1.cpp
78 lines (60 loc) · 1.29 KB
/
open1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using vpi = vector<pi>;
using vb = vector<bool>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vi nxt(n);
vi val(n);
ll tot = 0;
for (ll i = 0; i < n; i++) {
ll a, u;
cin >> a >> u;
a--;
nxt[i] = a;
val[i] = u;
tot += val[i];
}
vi vis(n);
vi st(n);
ll idx = -1;
vi cyc(n, -1);
function<void(ll)> dfs = [&](ll v) {
vis[v] = true;
st[v] = true;
ll ch = nxt[v];
if(st[ch]) {
idx = ch;
} else if(!vis[ch])
dfs(ch);
st[v] = false;
if (idx != -1) cyc[v] = idx;
if(idx == v) idx = -1;
};
for (ll i = 0; i < n; i++) {
idx = -1;
if (!vis[i]) dfs(i);
}
vi mn(n, 1e9 + 7);
for (ll i = 0; i < n; i++) {
if(cyc[i] != -1) {
mn[cyc[i]] = min(mn[cyc[i]], val[i]);
}
}
vi chose(n);
ll ans = 0;
for (ll i = 0; i < n; i++) {
if(cyc[i] != -1 && !chose[cyc[i]]) {
chose[cyc[i]] = true;
ans += mn[cyc[i]];
}
}
cout << (tot - ans) << endl;
return 0;
}