# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50059 | dongwon0427 | Race (IOI11_race) | C++11 | 0 ms | 0 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.
/*
god taekyu
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int n,m;
#define M 200005
vector<pii> graph[M];
int subsize[M];
int depth[M];
int del[M], par[M];
void init_subsize(int idx, int par_of_idx) {
subsize[idx] = 1;
par[idx] = par_of_idx;
for(int i=0;i<graph[idx].size();i++) {
int nxt = graph[idx][i].first;
if(del[nxt] == 1) continue;
if(nxt == par_of_idx) continue;
init_subsize(nxt, idx);
subsize[idx] += subsize[nxt];
}
}
int find_centroid(int idx,int sz_tot) {
for(int i=0;i<graph[idx].size();i++) {
int nxt = graph[idx][i].first;