# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
271908 | TMJN | Traffic (IOI10_traffic) | C++17 | 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 "traffic.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>v[1000000];
long long c[1000000],m[1000000];
void dfs(int x,int from){
for(int i:v){
if(i==from)continue;
dfs(i,x);
c[x]+=c[i];
}
}
int LocateCentre(int N, int pp[], int S[], int D[]) {
for(int i=0;i<N-1;i++){
v[S[i]].push_back(D[i]);
v[D[i]].push_back(S[i]);
}
for(int i=0;i<N;i++){
c[i]=pp[i];
}
dfs(0,0);
for(int i=0;i<N-1;i++){
m[S[i]]=max(m[S[i]],abs(c[S[i]]-c[D[i]]));
m[D[i]]=max(m[D[i]],abs(c[S[i]]-c[D[i]]));
}
pair<ll,int>res={0xE869120E869120,-1};
for(int i=0;i<N;i++){
res=min(res,{m[i],i});
}
return res.second;
}