# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383939 | aaravdodhia | 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 <bits/stdc++.h>
using namespace std;
int N;
vector<int> P;
vector<vector<int>> adj;
int DFS(int u, int p, int root){
int max_traffic = 0, cur_traffic = P[u];
for(int v : adj[u]){
if(v == p) continue;
max_traffic = max(max_traffic, DFS(v, u, root));
cur_traffic += DFS(v, u, root);
}
if(u != root){
max_traffic = max(max_traffic, cur_traffic);
}
return max_traffic;
}
int LocateCenter(){
int arena = N, min_congestion = 2e9+1;
for(int root = 0; root < N; root++){
if(DFS(root, -1, root) < min_congestion){
arena = root;
min_congestion = DFS(root, -1, root);
}
}
// cout << min_congestion << endl;
return arena;
}
int main()
{
cin >> N;
adj.resize(N);
P.resize(N);
for(int i=0; i<N; i++)
cin >> P[i];
vector<int> S(N), D(N);
for(int i=0; i<N-1; i++)
cin >> S[i];
for(int i=0; i<N-1; i++)
cin >> D[i];
int a, b;
for(int i=0; i<N-1; i++){
adj[S[i]].push_back(D[i]);
adj[D[i]].push_back(S[i]);
}
cout << LocateCenter() << endl;
}