# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100403 | SuperJumbo | Race (IOI11_race) | C++14 | 3042 ms | 21260 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>
#define NMAX 500001
#define inf (INT_MAX>>2)
#define ll long long
#define add push_back
#define mp make_pair
#include "race.h"
using namespace std;
#define min(a,b) (a > b ? b : a)
vector<pair<int,int>> g[NMAX];
int tot, k, ans;
int sz[NMAX], cen[NMAX];
int all[NMAX];
void dfs(int node,int par){
sz[node] = 1;
for(auto e:g[node]){
int x = e.first;
if(x == par || cen[x] )continue;
dfs(x,node);
sz[node] += sz[x];
}
tot = max(tot,sz[node]);
}
int centroid(int node,int par){
for(auto e:g[node]){
int x = e.first;
if(x!=par && sz[x]> tot/2 && !cen[x]){
return centroid(x,node);
}
}
# | 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... |