# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208594 | DodgeBallMan | Traffic (IOI10_traffic) | C++14 | 17 ms | 23804 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>
#include "traffic.h"
using namespace std;
const int N = 1e6 + 10;
bool vis[N];
long long val[N], sum;
vector<int> g[N];
long long dfs( int u, int p ) {
for( int v : g[u] ) if( v != p ) val[u] += dfs( v, u );
return val[u];
}
int LocateCentre(int N, int pp[], int S[], int D[])
{
for ( int i = 0 ; i < N ; i++ ) val[i] = pp[i], sum += val[i];
for ( int i = 0 ; i < N - 1 ; i++ ) g[S[i]].emplace_back( D[i] ), g[D[i]].emplace_back( S[i] );
dfs( 0, -1 );
int ret;
long long mn = 1e18;
for ( int i = 0 ; i < N ; i++ ) {
long long mx = sum - val[i];
for( int v : g[i] ) mx = max( mx, val[v] );
if( mn > mx ) mn = mx, ret = i;
}
return ret;
}
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... |