# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254983 | kimbj0709 | Village (BOI20_village) | C++14 | 184 ms | 21156 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;
#define int long long
#define maxn 100050
#define f first
#define s second
vector<vector<int> > adj(maxn);
vector<int> subtree_size(maxn,0);
vector<int> pos(maxn,0);
int currcnt = 1;
int n,input1,input2;
int centroid = 0;
void dfs1(int node,int parent){//used to find subtree size
subtree_size[node] = 1;
pos[node] = currcnt;
currcnt++;
for(auto k:adj[node]){
if(k==parent){
continue;
}
dfs1(k,node);
subtree_size[node] += subtree_size[k];
}
return;
}
vector<int> reroute(maxn,1);
int mindist = 0;
void dfs2(int node,int parent){//used to find optimal ordering
for(auto k:adj[node]){
if(k==parent){
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... |