| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 481679 | MilosMilutinovic | Traffic (IOI10_traffic) | C++14 | 0 ms | 0 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>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head
const int N=1010000;
int a[N];
ll dis[N];
vector<int> e[N];
void dfs1(int u,int p) {
dis[u]=a[u];
for (int x:e[u]) if (x!=p) dfs1(x,u),dis[u]+=dis[x];
}
ll LocateCentre(int n,int*P,int*S,int*D) {
rep(i,0,n) a[i]=P[i];
rep(i,0,n-1) e[S[i]].pb(D[i]),e[D[i]].pb(S[i]);
ll mn=2e18;
int id=0;
rep(i,0,n) {
dfs1(i,i);
ll s=0;
rep(j,0,n) if (i!=j) s=max(s,dis[j]);
if (ans>s) ans=s,id=i;
}
return id;
}