# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257452 | karma | Birthday gift (IZhO18_treearray) | C++14 | 1301 ms | 83320 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>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
//#define int int64_t
using namespace std;
const int N = int(2e5) + 7;
const int logN = 18;
typedef pair<int, int> pii;
int n, m, q, a[N];
int p[N][logN + 1], d[N];
vector<int> adj[N];
void dfs(int u) {
for(int i = 1; i <= logN; ++i) p[u][i] = p[p[u][i - 1]][i - 1];
for(int v: adj[u]) {
if(v == p[u][0]) continue;
p[v][0] = u;
d[v] = d[u] + 1;
dfs(v);
}
}
int lca(int u, int v) {
if(d[u] < d[v]) swap(u, v);
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... |