# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
247068 | MKopchev | Untitled (POI11_ins) | C++14 | 4094 ms | 73720 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<bits/stdc++.h>
using namespace std;
const int nmax=1e6+42;
int n;
vector<int> adj[nmax];
int max_depth=0;
long long sum=0;
int SZ[nmax];
void dfs(int node,int par,int d)
{
sum+=2*d;
max_depth=max(max_depth,d);
SZ[node]=1;
for(auto k:adj[node])
if(k!=par)
{
dfs(k,node,d+1);
SZ[node]+=SZ[k];
}
}
long long ask(int node)
{
max_depth=0;
sum=0;
dfs(node,0,0);
for(auto w:adj[node])
if(SZ[w]*2>SZ[node])return -1;
return sum-max_depth;
}
int main()
{
scanf("%i",&n);
int u,v;
for(int i=1;i<n;i++)
{
scanf("%i%i",&u,&v);
adj[u].push_back(v);
adj[v].push_back(u);
}
for(int i=1;i<=n;i++)
printf("%lld\n",ask(i));
return 0;
}
Compilation message (stderr)
# | 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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |