# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
251553 | imeimi2000 | Constellation 3 (JOI20_constellation3) | C++17 | 692 ms | 79224 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;
typedef long long llong;
int n;
int A[200001];
vector<int> H[200001];
int I[200002];
int D[200001];
int V[200001];
vector<int> child[200001];
void add(int &ord, int p, int l, int r) {
if (r - l - 1 <= 0) return;
int i = ++ord;
child[p].push_back(i);
I[l] = i;
}
const int L = 18;
int st[200001], ed[200001], dep[200001], par[200001][L];
void dfs(int x, int p) {
static int ord = 0;
st[x] = ++ord;
par[x][0] = p;
for (int i = 1; i < L; ++i) par[x][i] = par[par[x][i - 1]][i - 1];
for (int i : child[x]) {
dfs(i, 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... |