# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167639 | dragst | The Ties That Guide Us (CEOI23_incursion) | C++20 | 146 ms | 8084 KiB |
#include <bits/stdc++.h>
#include "incursion.h"
using namespace std;
int root, h[50005], p[50005], l[50005], r[50005], sz[50005];
vector<int> adj[50005];
void dfs(int x)
{
sz[x]=1;
for (auto y: adj[x])
{
if (y!=p[x] && l[x]==0)
{
p[y]=x; l[x]=y;
h[y]=h[x]+1;
dfs(y);
sz[x]+=sz[y];
}
else if (y!=p[x])
{
p[y]=x; r[x]=y;
h[y]=h[x]+1;
dfs(y);
sz[x]+=sz[y];
};
};
}
int centroid(int x, int n)
# | 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... |