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>
#include<traffic.h>
using namespace std;
#define ll long long
#define endl "\n"
using namespace std;
int ans = INT_MAX;
int ind;
int svi;
vector<vector<int> > g(1000005);
int dfs(int u, int pret, int *p)
{
int br = 0;
int maks = 0;
for(int i = 0;i<(int)g[u].size();i++)
{
int s = g[u][i];
if(s==pret) continue;
br+=dfs(s, u, p);
maks = max(maks, br);
}
maks = max(maks, svi - p[u] - br);
if(maks<ans)
{
ans = maks;
ind = u;
}
return br + p[u];
}
int LocateCentre(int n, int *p, int *s, int *d)
{
for(int i = 0;i<n-1;i++)
{
int a = s[i];
int b = d[i];
g[a].push_back(b);
g[b].push_back(a);
}
for(int i = 0;i<n;i++)
{
svi+=p[i];
}
dfs(0, -1, p);
return ind;
}
# | 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... |