# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
877272 | socpite | Pastiri (COI20_pastiri) | C++14 | 482 ms | 74784 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;
const int maxn = 5e5 + 5;
int d[maxn];
int n, k;
vector<int> g[maxn];
int mark[maxn];
int dep[maxn];
int par[maxn];
int used[maxn];
int X[maxn];
bool cmp(int a, int b)
{
return dep[a] > dep[b];
}
void dfs(int x, int p)
{
dep[x] = dep[p] + 1;
par[x] = p;
for (auto v : g[x])
{
if (v == p)
continue;
dfs(v, x);
# | 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... |