#include <bits/stdc++.h>
#define ll long long
#define db long double
#define N 1000005
#define II pair <int,int>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x))
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
using namespace std;
struct edge { int u,num,k; };
vector <edge> a[N];
ll tr[N],trc[N],n,i,u,v,k,c[N],dis[N],ncycle,cycle[N],d[N],sum,incycle[N],res,visited[N];
const ll oo=round(1e18);
struct Fenwick_Tree
{
ll bit[N],d[N],n;
void Init(int _n)
{
n=_n;
for(int i=1;i<=n;i++) bit[i]=d[i]=-oo;
}
void update(int i,ll k)
{
d[i]=max(d[i],k);
while(i<=n) bit[i]=max(bit[i],k),i+=(i & -i);
}
ll get(int l,int r)
{
ll res=-oo,i=r;
while(i>=l)
if(i-(i & -i)>=l) res=max(res,bit[i]),i-=(i & -i);
else res=max(res,d[i]),i--;
return res;
}
} FT_sub,FT_sum;
void dfs(int u)
{
visited[u]=1;
for(edge adj:a[u])
{
int v=adj.u;
if(visited[v]==0) dfs(v);
}
}
void Find_cycle(int u,int x)
{
for(edge adj:a[u])
{
if(adj.num==x) continue;
int v=adj.u,k=adj.k;
if(tr[v]==0)
{
tr[v]=u; trc[v]=k;
Find_cycle(v,adj.num);
}
else if(ncycle==0)
{
sum=0;
while(1)
{
cycle[++ncycle]=u; incycle[u]=1;
dis[ncycle]=sum; sum+=trc[u];
if(u==v) break;
u=tr[u];
}
sum+=k;
return ;
}
}
}
/////////////////////////////////////////////////////////////////////////////
ll cal(int u,int p)
{
ll res=0;
for(edge adj:a[u])
{
int v=adj.u;
if(v!=p && incycle[v]==0) res=max(res,cal(v,u)+adj.k);
}
return res;
}
ll Work()
{
int i,u,v;
FT_sub.Init(ncycle);
FT_sum.Init(ncycle);
for(i=1;i<=ncycle;i++)
{
u=cycle[i];
c[i]=cal(u,0);
FT_sub.update(i,c[i]-dis[i]);
FT_sum.update(i,c[i]+dis[i]);
}
ll res=0;
for(i=1;i<ncycle;i++)
{
int l=i,r=ncycle;
while(l<r)
{
int mid=(l+r+1)>>1;
if(sum-(dis[mid]-dis[i])>=dis[mid]-dis[i])
l=mid;
else r=mid-1;
}
res=max(res,max(c[i]+sum+dis[i]+FT_sub.get(i+1,l),c[i]-dis[i]+FT_sum.get(l,ncycle)));
}
return res;
}
int main()
{
// freopen("islands.inp","r",stdin);
// freopen("islands.out","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>n;
for(u=1;u<=n;u++)
{
cin>>v>>k;
a[u].push_back({ v,u,k }); a[v].push_back({ u,u,k });
}
for(u=1;u<=n;u++)
if(visited[u]==0)
{
dfs(u);
tr[u]=-1;
ncycle=0;
Find_cycle(u,0);
res+=Work();
}
cout<<res;
}
Compilation message
islands.cpp: In function 'long long int Work()':
islands.cpp:95:13: warning: unused variable 'v' [-Wunused-variable]
95 | int i,u,v;
| ^
islands.cpp: In function 'int main()':
islands.cpp:130:26: warning: narrowing conversion of 'v' from 'long long int' to 'int' [-Wnarrowing]
130 | a[u].push_back({ v,u,k }); a[v].push_back({ u,u,k });
| ^
islands.cpp:130:28: warning: narrowing conversion of 'u' from 'long long int' to 'int' [-Wnarrowing]
130 | a[u].push_back({ v,u,k }); a[v].push_back({ u,u,k });
| ^
islands.cpp:130:30: warning: narrowing conversion of 'k' from 'long long int' to 'int' [-Wnarrowing]
130 | a[u].push_back({ v,u,k }); a[v].push_back({ u,u,k });
| ^
islands.cpp:130:53: warning: narrowing conversion of 'u' from 'long long int' to 'int' [-Wnarrowing]
130 | a[u].push_back({ v,u,k }); a[v].push_back({ u,u,k });
| ^
islands.cpp:130:55: warning: narrowing conversion of 'u' from 'long long int' to 'int' [-Wnarrowing]
130 | a[u].push_back({ v,u,k }); a[v].push_back({ u,u,k });
| ^
islands.cpp:130:57: warning: narrowing conversion of 'k' from 'long long int' to 'int' [-Wnarrowing]
130 | a[u].push_back({ v,u,k }); a[v].push_back({ u,u,k });
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
45660 KB |
Output is correct |
| 2 |
Incorrect |
8 ms |
45792 KB |
Output isn't correct |
| 3 |
Correct |
7 ms |
45916 KB |
Output is correct |
| 4 |
Incorrect |
8 ms |
45660 KB |
Output isn't correct |
| 5 |
Correct |
7 ms |
45660 KB |
Output is correct |
| 6 |
Incorrect |
7 ms |
45660 KB |
Output isn't correct |
| 7 |
Incorrect |
8 ms |
45660 KB |
Output isn't correct |
| 8 |
Incorrect |
7 ms |
45896 KB |
Output isn't correct |
| 9 |
Incorrect |
7 ms |
45660 KB |
Output isn't correct |
| 10 |
Incorrect |
9 ms |
45660 KB |
Output isn't correct |
| 11 |
Correct |
7 ms |
45660 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
8 ms |
45912 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
8 ms |
45916 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
14 ms |
48708 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
29 ms |
52068 KB |
Output is correct |
| 2 |
Correct |
39 ms |
54356 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
67 ms |
62544 KB |
Output is correct |
| 2 |
Correct |
89 ms |
70188 KB |
Output is correct |
| 3 |
Incorrect |
114 ms |
87896 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
125 ms |
78944 KB |
Output is correct |
| 2 |
Correct |
183 ms |
114248 KB |
Output is correct |
| 3 |
Correct |
293 ms |
120448 KB |
Output is correct |
| 4 |
Runtime error |
201 ms |
131072 KB |
Execution killed with signal 9 |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
197 ms |
106992 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
250 ms |
131072 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
