# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1155412 | kitkat12 | Race (IOI11_race) | C++20 | 487 ms | 31872 KiB |
#include <bits/stdc++.h>
using namespace std;
#define nmax 200020
#define ii pair<int, int>
#define ll long long
int n, k, ans, cnt[1000100], sz[nmax], r[nmax];
vector<ii> adj[nmax];
inline void minimize(int &a, int b)
{
if(a == -1 || a > b)
a = b;
}
int dfs(int u, int p = -1)
{
sz[u] = 1;
for(auto [C, v]: adj[u]) {
if(v != p && !r[v]) sz[u] += dfs(v, u);
}
return sz[u];
}
int get_centroid(int m, int u, int p = -1)
{
for(auto [C, v]: adj[u]) {
if(v != p && !r[v] && 2 * sz[v] > m) return get_centroid(m, v, u);
}
# | 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... |