# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
848550 | 2023-09-12T21:48:07 Z | toma_ariciu | Traffic (IOI10_traffic) | C++17 | 0 ms | 0 KB |
#include <vector> using namespace std; #define int long long const int maxN = 1000005; int sz[maxN], bestDiff, bestCity, total; vector <int> G[maxN]; void dfs(int nod, int tata) { int currDiff = 0; for (int vecin : G[nod]) { if (vecin == tata) { continue; } dfs(vecin, nod); sz[nod] += sz[vecin]; currDiff = max(currDiff, sz[vecin]); } currDiff = max(currDiff, total - sz[nod]); if (currDiff < bestDiff) { bestDiff = currDiff; bestCity = nod; } } int LocateCentre(int N, int P[], int S[], int D[]) { for (int i = 0; i < N; i++) { sz[i] += P[i]; total += P[i]; } bestDiff = 2e9 + 5; for (int i = 0; i < N - 1; i++) { G[S[i]].push_back(D[i]); G[D[i]].push_back(S[i]); } dfs(0, 0); return bestCity; }