#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define N 1000002
using namespace std;
int n,p[N],l[N],fix[N],F[N],k,c[N];
long long mx[N],ans,pas;
vector<int>v[N];
map<int,int>M[N],ra[N];
vector<int>g,all;
void dfs(ll x){
if(F[x])return;
all.pb(x);
F[x] = 1;
for(int i=0; i<v[x].size(); i++)
dfs(v[x][i]);
}
void findc(ll x,ll par){
if(fix[x]){
g.pb(x);
k = 1;
return;
}
g.pb(x);
fix[x] = 1;
for(int i=0; i<v[x].size(); i++)
if(v[x][i] != par || ra[x][v[x][i]] > 1){
findc(v[x][i] , x);
if(k)return;
}
g.pop_back();
}
void findmx(ll x,ll par){
ll mx1 = 0,mx2 = 0;
for(int i=0; i<v[x].size(); i++){
if(v[x][i] != par && !c[v[x][i]]){
findmx(v[x][i] , x);
mx[x] = max(mx[x] , mx[v[x][i]] + M[x][v[x][i]]);
if(mx[v[x][i]] + M[x][v[x][i]] > mx1){
mx2 = mx1;
mx1 = mx[v[x][i]] + M[x][v[x][i]];
}
else if(mx[v[x][i]] + M[x][v[x][i]] > mx2)
mx2 = mx[v[x][i]] + M[x][v[x][i]];
}
}
ans = max(ans , mx1 + mx2);
}
int main(){
ios::sync_with_stdio(false);
cin >> n;
for(int i=1; i<=n; i++){
cin >> p[i] >> l[i];
M[i][p[i]] = max(M[i][p[i]] , l[i]);
M[p[i]][i] = max(M[p[i]][i] , l[i]);
ra[i][p[i]]++;
ra[p[i]][i]++;
v[p[i]].pb(i);
v[i].pb(p[i]);
}
for(int s=1; s<=n; s++){
if(F[s])continue;
ans = 0;
k = 0;
all.clear();
dfs(s);
g.clear();
findc(s , 0);
vector<int>cyc;
for(int i=0; i<g.size(); i++){
if(g[i] == g[(int)g.size() - 1]){
for(int j=i+1; j<g.size(); j++){
cyc.pb(g[j]);
c[g[j]] = 1;
}
break;
}
}
ll len = 0;
for(int i=0; i<cyc.size(); i++){
findmx(cyc[i] , 0);
if(i)len += M[cyc[i]][cyc[i - 1]];
}
len += M[cyc[0]][cyc[cyc.size() - 1]];
ll cur = mx[cyc[0]];
ll cur2 = mx[cyc[0]];
ll pre = 0;
for(int i=1; i<cyc.size(); i++){
pre += M[cyc[i]][cyc[i - 1]];
ans = max(ans , cur + mx[cyc[i]] + pre);
ans = max(ans , cur2 + len + mx[cyc[i]] - pre);
cur = max(cur , mx[cyc[i]] - pre);
cur2 = max(cur2 , mx[cyc[i]] + pre);
}
pas += ans;
}
cout << pas << '\n';
return 0;
}
Compilation message
islands.cpp: In function 'void dfs(long long int)':
islands.cpp:17:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
17 | for(int i=0; i<v[x].size(); i++)
| ~^~~~~~~~~~~~
islands.cpp: In function 'void findc(long long int, long long int)':
islands.cpp:28:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
28 | for(int i=0; i<v[x].size(); i++)
| ~^~~~~~~~~~~~
islands.cpp: In function 'void findmx(long long int, long long int)':
islands.cpp:37:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
37 | for(int i=0; i<v[x].size(); i++){
| ~^~~~~~~~~~~~
islands.cpp: In function 'int main()':
islands.cpp:74:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
74 | for(int i=0; i<g.size(); i++){
| ~^~~~~~~~~
islands.cpp:76:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
76 | for(int j=i+1; j<g.size(); j++){
| ~^~~~~~~~~
islands.cpp:84:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
84 | for(int i=0; i<cyc.size(); i++){
| ~^~~~~~~~~~~
islands.cpp:92:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
92 | for(int i=1; i<cyc.size(); i++){
| ~^~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
92 ms |
117740 KB |
Output is correct |
| 2 |
Correct |
79 ms |
117868 KB |
Output is correct |
| 3 |
Correct |
85 ms |
117996 KB |
Output is correct |
| 4 |
Correct |
90 ms |
117740 KB |
Output is correct |
| 5 |
Correct |
78 ms |
117740 KB |
Output is correct |
| 6 |
Correct |
80 ms |
117740 KB |
Output is correct |
| 7 |
Correct |
78 ms |
117844 KB |
Output is correct |
| 8 |
Correct |
76 ms |
117868 KB |
Output is correct |
| 9 |
Correct |
76 ms |
117868 KB |
Output is correct |
| 10 |
Correct |
78 ms |
117868 KB |
Output is correct |
| 11 |
Correct |
77 ms |
117868 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
77 ms |
118124 KB |
Output is correct |
| 2 |
Correct |
78 ms |
117996 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
83 ms |
118252 KB |
Output is correct |
| 2 |
Correct |
81 ms |
119020 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
97 ms |
121836 KB |
Output is correct |
| 2 |
Correct |
151 ms |
129004 KB |
Output is correct |
| 3 |
Correct |
130 ms |
123744 KB |
Output is correct |
| 4 |
Correct |
89 ms |
120556 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
123 ms |
131076 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
128 ms |
131076 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
106 ms |
131076 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
137 ms |
131072 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
119 ms |
131076 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
