# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
414724 | ackerman | 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 "traffic.h"
#include <vector>
using namespace std;
const int MAX_N = 1e6+2;
vector<int> adj[MAX_N];
int dfs(int u, int p) {
int ans = 0;
for(int to : adj[u]) {
if(to == p) continue;
ans += dfs(to, u);
}
return ans;
}
int LocateCentre(int N, int P[], int S[], int D[]) {
for(int i = 0; i < N-1; i++) {
adj[S[i]].push_back(D[i]);
adj[D[i]].push_back(S[i]);
}
int ans = INT_MAX;
for(int i = 0; i < N; i++) {
int max_traffic = INT_MIN;
for(int to : adj[i]) {
max_traffic = max(max_traffic, dfs(to, i));
}
ans = min(ans, max_traffic);
}
return ans;
}