#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
#define INF 2001001001
#define MOD 1000000007
#define f first
#define s second
int N;
int L[1000001];
vector<pair<int,int>>adj[1000001];
bool vis[1000001];
ll ans;
int from[1000001];
int C;
int cycle[1000001],adjDis[1000001];
ll deepest[1000001];
int bad,bad2;
ll maxCur;
void findCycle(int node, int par){
//cout<<"findCycle: "<<node<<endl;
vis[node]=true;
for (auto p:adj[node]){
if (C==0 && vis[p.first] && p.first!=par){ //found cycle
C=0;
//cout<<"found cycle"<<endl;
int cur=node;
while (cur!=p.first){
cycle[C++]=cur;
cur=from[cur];
}
cycle[C++]=p.first;
}
else if (!vis[p.first]){
from[p.first]=node;
findCycle(p.first,node);
}
}
}
ll maxDis,maxNode;
queue<pair<pair<int,int>,ll>>q;
void findFarthest(int node0, int par0, ll dis0){
maxDis=-1; maxNode=-1;
q.push({{node0,par0},dis0});
while (!q.empty()){
pair<pair<int,int>,ll>P=q.front();
q.pop();
int node=P.f.f;
int par=P.f.s;
ll dis=P.s;
if (dis>maxDis){
maxDis=dis;
maxNode=node;
}
for (auto p:adj[node]){
if (p.first!=par && p.first!=bad && p.first!=bad2)
q.push({{p.first,node},dis+p.second});
}
}
}
ll findDiameter(int node){
findFarthest(node,node,0);
int newNode=maxNode;
findFarthest(newNode,newNode,0);
return maxDis;
}
map<pair<int,int>,int>mp;
ll pref[1000001],suff[1000001],pref2[1000001],suff2[1000001];
int main()
{
//ios_base::sync_with_stdio(0);cin.tie(0);
//freopen (".in","r",stdin);
//freopen (".out","w",stdout);
scanf("%d",&N);
for (int i=1;i<=N;i++){
int Y;
scanf("%d%d",&Y,&L[i]);
int x=i,y=Y;
if (x>y) swap(x,y);
mp[{x,y}]=max(mp[{x,y}],L[i]);
}
for (auto it:mp){
//cout<<"edge: "<<it.first.first<<' '<<it.first.second<<endl;
adj[it.first.first].push_back({it.first.second,it.second});
adj[it.first.second].push_back({it.first.first,it.second});
}
for (int i=1;i<=N;i++)
if (!vis[i]){
//cout<<"Component: "<<i<<endl;
C=0;
findCycle(i,i);
/*
cout<<"Cycle: ";
for (int x:cycle)
cout<<x<<' ';
cout<<endl;
*/
if (C==0){
//cout<<"multiEdge: "<<findDiameter(i)<<endl;
ans+=findDiameter(i);
continue;
}
maxCur=0;
for (int i=0;i<C;i++){
pref[i]=0;
suff[i]=0;
pref2[i]=0;
suff2[i]=0;
int inFront=cycle[(i+1)%C];
int inBack=cycle[(i-1+C)%C];
adjDis[i]=mp[{min(cycle[i],inFront),max(cycle[i],inFront)}];
bad=inFront;
bad2=inBack;
maxCur=max(maxCur,findDiameter(cycle[i]));
findFarthest(cycle[i],cycle[i],0);
deepest[i]=maxDis;
}
for (int i=0;i<C;i++){
if (i>0){
pref[i]=pref[i-1]+adjDis[i-1];
pref2[i]=max(pref2[i-1],pref[i]+deepest[i]);
}
else
pref2[i]=deepest[i];
}
/*
cout<<"deepest: "<<' ';
for (int x:deepest)
cout<<x<<' ';
cout<<endl;
cout<<"adjDis: "<<' ';
for (int x:adjDis)
cout<<x<<' ';
cout<<endl;
cout<<"pref: ";
for (int i=0;i<C;i++)
cout<<pref[i]<<' ';
cout<<endl;
*/
for (int i=C-1;i>=0;i--){
if (i+1<C){
suff[i]=suff[i+1]+adjDis[i];
suff2[i]=max(suff2[i+1],suff[i]+deepest[i]);
}
else
suff2[i]=deepest[i];
}
for (int i=0;i+1<C;i++){
//cout<<i<<": "<<adjDis.back()<<' '<<pref2[i]<<' '<<suff2[i+1]<<endl;
maxCur=max(maxCur,adjDis[C-1]+pref2[i]+suff2[i+1]);
}
ll sweep=0;
for (int i=0;i<C;i++){
maxCur=max(maxCur,sweep+deepest[i]);
sweep=max(sweep,(ll)deepest[i]);
sweep+=adjDis[i];
}
ans+=maxCur;
//cout<<"maxCur: "<<maxCur<<endl;
}
cout<<ans<<endl;
return 0;
}
Compilation message
islands.cpp: In function 'int main()':
islands.cpp:85:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&N);
~~~~~^~~~~~~~~
islands.cpp:88:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&Y,&L[i]);
~~~~~^~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
17 ms |
23808 KB |
Output is correct |
| 2 |
Correct |
17 ms |
23936 KB |
Output is correct |
| 3 |
Correct |
18 ms |
23936 KB |
Output is correct |
| 4 |
Correct |
17 ms |
23808 KB |
Output is correct |
| 5 |
Correct |
17 ms |
23936 KB |
Output is correct |
| 6 |
Correct |
17 ms |
23936 KB |
Output is correct |
| 7 |
Correct |
17 ms |
23936 KB |
Output is correct |
| 8 |
Correct |
18 ms |
23936 KB |
Output is correct |
| 9 |
Correct |
17 ms |
23936 KB |
Output is correct |
| 10 |
Correct |
17 ms |
23808 KB |
Output is correct |
| 11 |
Correct |
17 ms |
23936 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
18 ms |
24064 KB |
Output is correct |
| 2 |
Correct |
18 ms |
23936 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
19 ms |
24064 KB |
Output is correct |
| 2 |
Correct |
20 ms |
24448 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
32 ms |
25728 KB |
Output is correct |
| 2 |
Correct |
56 ms |
29048 KB |
Output is correct |
| 3 |
Correct |
36 ms |
26104 KB |
Output is correct |
| 4 |
Correct |
26 ms |
24960 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
69 ms |
31224 KB |
Output is correct |
| 2 |
Correct |
106 ms |
36296 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
188 ms |
47352 KB |
Output is correct |
| 2 |
Correct |
224 ms |
54776 KB |
Output is correct |
| 3 |
Correct |
284 ms |
65272 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
356 ms |
68088 KB |
Output is correct |
| 2 |
Correct |
495 ms |
97400 KB |
Output is correct |
| 3 |
Correct |
601 ms |
110200 KB |
Output is correct |
| 4 |
Correct |
742 ms |
131072 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
823 ms |
131072 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
874 ms |
131076 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
