# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
456196 | sean617 | Race (IOI11_race) | C++98 | 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.
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#define N 200005
#define A 1000005
using namespace std;
int n, k, mn, M = 1e9, s[A], sz[N];
bool v2[N];
vector<int> a[N], b[N];
queue<int> qu;
int gs(int p, int q) {
int i, t;
sz[p] = 1;
for (i = 0; i < a[p].size(); i++) {
t = a[p][i];
if (t == q || v2[t]) continue;
sz[p] += gs(t, p);
}
return sz[p];
}
int gc(int p, int q, int nn) {
int i, t;
for (i = 0; i < a[p].size(); i++) {
t = a[p][i];
if (t != q && !v2[t] && sz[t] *2 > nn) return gc(t, p, nn);