#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
//#define int long long
using namespace std;
const int mod=1e9+7,mxn=1e6+5,inf=1e9,minf=-1e9,lg=25;
int n,m,k,x,y,z=0;
vector<pair<int,ll>>adj[mxn+10];
int have=0;
pii up[mxn+10];
ll dp1[mxn+10],mx;
bitset<mxn+10>on,vis;
queue<pii>q;
void dfs(int cur,int p){//fake dfs
q.push({cur,-1});
while(!q.empty()){
cur=q.front().f,p=q.front().s;
q.pop();
if(vis[cur])continue;
vis[cur]=1;
for(auto i:adj[cur]){
if(i.f==p)continue;
if(vis[i.f]&&!have){
x=cur,y=i.f,z=i.s;
have++;
}
if(!vis[i.f])q.push({i.f,cur});
}
}
}
vector<pii>cycle;//recycle TT
void dfs1(int cur,int p){//dont take edge x,y
q.push({cur,-1});
while(!q.empty()){
cur=q.front().f,p=q.front().s;
q.pop();
for(auto i:adj[cur]){
if(i.f==p)continue;
if(cur==x&&i.f==y)continue;
if(cur==y&&i.f==x)continue;
up[i.f]={cur,i.s};
dp1[i.f]=dp1[cur]+1;
q.push({i.f,cur});
}
cycle.pb({dp1[cur],cur});
dp1[cur]=0;
}
}
//find diameter
map<pii,int>mp;
ll suf[mxn+10];
int32_t main(){
fastio
cin>>n;
for(int i=1;i<=n;i++){
int a,b;cin>>a>>b;
pii x={min(a,i),max(a,i)};
if(mp.find(x)==mp.end())mp[x]=b;
else mp[x]=max(mp[x],b);
}
for(auto i:mp){
adj[i.f.f].pb({i.f.s,i.s});
adj[i.f.s].pb({i.f.f,i.s});
}
ll ans=0,m1,m2;
for(int i=1;i<=n;i++){
if(vis[i])continue;
have=0,z=0,x=i,mx=0;
if(have>1)assert(0);//we should only have atmost 1 cycle?
dfs(i,-1);
cycle.clear();
dfs1(x,-1);
sort(rall(cycle));
for(auto j:cycle){
dp1[up[j.s].f]=max(dp1[up[j.s].f],dp1[j.s]+up[j.s].s);
mx=max(mx,dp1[j.s]);
m1=m2=0;
for(auto k:adj[j.s]){
if(k.f==up[j.s].f)continue;
if(j.s==x&&k.f==y)continue;
if(j.s==y&&k.f==x)continue;
if(dp1[k.f]+k.s>=m1)m2=m1,m1=dp1[k.f]+k.s;
else if(dp1[k.f]+k.s>=m2)m2=dp1[k.f]+k.s;
}
mx=max(mx,m1+m2);
}
if(have){
//passing through edge x,y
cycle.clear();
while(y!=x){
cycle.pb({y,up[y].s});
on[y]=1;
y=up[y].f;
}
cycle.pb({x,0});
on[x]=1;
reverse(all(cycle));
suf[cycle.size()-1]=0;
for(int i=cycle.size()-2;i>=0;i--)suf[i]=cycle[i+1].s+suf[i+1];
for(auto i:cycle){
dp1[i.f]=0;
for(auto j:adj[i.f])if(!on[j.f])dp1[i.f]=max(dp1[i.f],dp1[j.f]+j.s);
}
for(int i=cycle.size()-1;i>=0;i--){
suf[i]=suf[i]+dp1[cycle[i].f];
if(i+1<cycle.size())suf[i]=max(suf[i],suf[i+1]);
}
ll pref=0,prefmx=0;
for(int i=0;i<cycle.size()-1;i++){
pref+=cycle[i].s;
prefmx=max(prefmx,dp1[cycle[i].f]);
mx=max(mx,prefmx+suf[i+1]+z);
}
}
ans+=mx;
}
cout<<ans<<'\n';
}
/*
7
3 8
7 2
4 2
1 4
1 9
3 4
2 3
9
2 1
5 1
1 1
3 1
4 1
4 1
5 1
1 1
3 1
a node cant be in multiple cycle
** there can be atmost 1 cycle for each comp
compute each comp independtly
how to solve a tree?
nvm we are finding diameter smh
*/
Compilation message
islands.cpp:32:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
32 | #pragma GCC optimize ("03,unroll-lopps")
| ^
islands.cpp:43:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
43 | void dfs(int cur,int p){//fake dfs
| ^
islands.cpp:61:24: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
61 | void dfs1(int cur,int p){//dont take edge x,y
| ^
islands.cpp:81:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
81 | int32_t main(){
| ^
islands.cpp: In function 'int32_t main()':
islands.cpp:135:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
135 | if(i+1<cycle.size())suf[i]=max(suf[i],suf[i+1]);
| ~~~^~~~~~~~~~~~~
islands.cpp:138:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
138 | for(int i=0;i<cycle.size()-1;i++){
| ~^~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
5 ms |
29016 KB |
Output isn't correct |
| 2 |
Incorrect |
4 ms |
29020 KB |
Output isn't correct |
| 3 |
Incorrect |
5 ms |
29020 KB |
Output isn't correct |
| 4 |
Correct |
4 ms |
29020 KB |
Output is correct |
| 5 |
Incorrect |
4 ms |
29020 KB |
Output isn't correct |
| 6 |
Incorrect |
5 ms |
29020 KB |
Output isn't correct |
| 7 |
Incorrect |
5 ms |
28888 KB |
Output isn't correct |
| 8 |
Incorrect |
5 ms |
29020 KB |
Output isn't correct |
| 9 |
Incorrect |
5 ms |
29020 KB |
Output isn't correct |
| 10 |
Correct |
4 ms |
28884 KB |
Output is correct |
| 11 |
Correct |
5 ms |
29020 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
29016 KB |
Output is correct |
| 2 |
Correct |
7 ms |
29020 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
6 ms |
29020 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
13 ms |
30812 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
29 ms |
37324 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
92 ms |
56840 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
178 ms |
82892 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
467 ms |
131072 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
443 ms |
131072 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
