# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
894207 | box | Cat Exercise (JOI23_ho_t4) | C++17 | 276 ms | 45652 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 N = 2e5, L = 18;
#ifndef LOCAL
#define cerr if (0) cerr
#endif
int n, p[N];
int pp[L][N], d[N];
vector <int> g[N];
long long dp[N];
int f[N];
int uf(int i) {
return f[i] == i ? i : f[i] = uf(f[i]);
}
void dfs(int i) {
for (int l = 1; l < L; l++) pp[l][i] = pp[l - 1][pp[l - 1][i]];
for (int j: g[i])
if (pp[0][i] != j) {
pp[0][j] = i;
d[j] = d[i] + 1;
dfs(j);
}
}
int lca(int i, int j) {
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |