# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
964519 | UmairAhmadMirza | Race (IOI11_race) | C++14 | 723 ms | 43380 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;
int const MN=200005;
map<int,int> cnt;
vector<pair<int,int>> adj[MN];
int sz[MN];
int n,k;
int ans=MN;
void dfs_sz(int node,int par=-1){
sz[node]=1;
for(auto i:adj[node])
if(i.first!=par){
dfs_sz(i.first,node);
sz[node]+=sz[i.first];
}
}
int total=0;
int find_centroid(int node){
for(auto i:adj[node]){
if(sz[i.first]*2>total){
sz[node]-=sz[i.first];
sz[i.first]+=sz[node];
return find_centroid(i.first);
}
}
return node;
}
void dfs(int node,int par,int w,int dep){
if(w==k)
ans=min(ans,dep);
# | 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... |