# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296313 | morato | 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.
/**
* author: morato
* created: 10.09.2020 10:19:13
**/
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 6;
vector<int> adj[N];
int P[N], sub[N], heavy[N], n, tot;
void dfs(int v, int p = -1) {
for (auto u : adj[v]) if (u != p) {
dfs(u, v);
sub[v] += sub[u] + P[u];
heavy[v] = max(heavy[v], sub[u] + P[u]);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> P[i];
tot += P[i];
}
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfs(0);
int ans = heavy[0];
for (int i = 1; i < n; i++) {
heavy[i] = max(heavy[i], tot - sub[i] - P[i]);
ans = min(ans, heavy[i]);
}
cout << ans << '\n';
return 0;
}