# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
272742 | toonewbie | Race (IOI11_race) | C++17 | 1350 ms | 50412 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>
#include "race.h"
#define F first
#define S second
using namespace std;
const int N = 200005;
int n, k;
vector <int> g[N];
vector <pair <int, int>> gw[N]; /// just for simplicity in the code
int del[N], sub[N];
int res = N;
void calc(int v, int p = -1) {
sub[v] = 1;
for (int i : g[v]) {
if (i != p && del[i] == 0) {
calc(i, v);
sub[v] += sub[i];
}
}
}
int centroid(int v, int r, int p = -1) {
for (int i : g[v]) {
if (i != p && del[i] == 0 && sub[i] > r) {
return centroid(i, r, v);
}
# | 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... |