# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
54196 | ulna | Birthday gift (IZhO18_treearray) | C++11 | 1893 ms | 98516 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.
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
// why am I so weak
const int maxn = 2e5;
int n, m, q;
int a[maxn];
vector<int> g[maxn];
#define MAX_LOG 18
int depth[maxn];
int par[MAX_LOG][maxn];
set<int> s[maxn];
set<int> ss[maxn];
void dfs(int v, int par = -1, int d = 0) {
::par[0][v] = par;
depth[v] = d;
for (auto u : g[v]) if (u != par) {
dfs(u, v, d + 1);
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |