# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862245 | Hanksburger | Meetings 2 (JOI21_meetings2) | C++17 | 266 ms | 43160 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>
using namespace std;
int par[200005][20], sz[200005], dep[200005], ans[200005], n, c, x, y, ind, res=1;
vector<pair<int, int> > vec;
vector<int> adj[200005];
void dfs(int u, int p)
{
sz[u]=1;
for (int v:adj[u])
{
if (v!=p)
{
dfs(v, u);
sz[u]+=sz[v];
}
}
bool ok=1;
for (int v:adj[u])
{
if (sz[v]>n/2)
{
ok=0;
break;
}
}
if (ok && n-sz[u]<=n/2)
c=x=y=u;
}
void dfs2(int u, int p)
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |