# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
229806 | CaroLinda | Islands (IOI08_islands) | C++14 | 878 ms | 131072 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define mkt make_tuple
#define debug printf
#define all(x) x.begin(),x.end()
#define lp(i,a,b) for(int i = a ; i< b ; i++)
#define ss second
#define ff first
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define mk make_pair
const int MAXN = 1e6+10 ;
using namespace std ;
int N ;
int to[MAXN] ;
ll resp , best_diameter ;
ll W[MAXN] , D[MAXN] ;
ll prof[MAXN];
vector<int> cycle ;
vector< int > adj[MAXN] ;
bool vis[MAXN] ;
void dfs( int x )
{
vis[x] = true ;
ll p2 = 0LL ;
for(int child : adj[x] )
{
if(vis[child]) continue ;
dfs(child) ;
if( prof[child] + W[child] >= prof[x] )
{
p2 = prof[x] ;
prof[x] = prof[child] + W[child] ;
}
else if( prof[child] + W[child] > p2 )
p2 = prof[child] + W[child] ;
}
best_diameter = max( best_diameter, prof[x] + p2 ) ;
}
int main()
{
scanf("%d", &N ) ;
for(int i = 1 , u ; i <= N ; i++ )
{
scanf("%d%d", &to[i] , &W[i] ) ;
adj[ to[i] ].pb(i) ;
}
for(int j=1 ; j <= N ; j++ )
{
if(vis[j]) continue ;
cycle.clear() ;
int x = j ;
while( !vis[x] )
{
vis[x] = true ;
cycle.pb(x) ;
x = to[x] ;
}
reverse( all(cycle) ) ;
for(int i = cycle.size() - 1 ; cycle[i] != x ; i -- )
{
vis[ cycle[i] ] = false ;
cycle.pop_back() ;
}
reverse( all(cycle) ) ;
best_diameter = 0 ;
ll sum = 0LL , t = 0LL ;
for(int i = 0 ; i < cycle.size() ; i++ )
{
dfs( cycle[i] ) ;
sum += W[ cycle[i] ] ;
if( i ) D[ cycle[i] ] = D[ cycle[i-1] ] + W[ cycle[i-1] ] ;
}
for(int i = 0 ; i < cycle.size() ; i++ )
{
if( i ) best_diameter = max( best_diameter , t + D[ cycle[i] ] + prof[ cycle[i] ] ) ;
t = max(t , -D[ cycle[i] ] + prof[ cycle[i] ] ) ;
}
t = 0LL ;
for(int i = 0 ; i < cycle.size() ; i++ )
{
if(i) best_diameter = max( best_diameter , sum - D[ cycle[i] ] + prof[ cycle[i] ] + t ) ;
t = max( t , D[ cycle[i] ] + prof[ cycle[i] ] ) ;
}
resp += best_diameter ;
}
printf("%lld\n" , resp ) ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |