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;
template<class T, class U> bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }
int LocateCentre(int n, int p[], int s[], int d[]){
const int sum = accumulate(p, p + n, 0);
vector<vector<int>> g(n);
for(int i = 0; i < n - 1; i++){
const int a = s[i], b = d[i];
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> dp(n);
auto dfs = [&](int from, int at, const auto& dfs) -> void {
for(int i : g[at]) if(i != from){
dfs(at, i, dfs);
p[at] += p[i];
chmax(dp[at], p[i]);
}
chmax(dp[at], sum - p[at]);
};
dfs(-1, 0, dfs);
return min_element(dp.begin(), dp.end()) - dp.begin();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |