# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824219 | vjudge1 | Mergers (JOI19_mergers) | C++17 | 900 ms | 233108 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;
// 123
static const int N = 1e6 + 10;
class lca_t {
public:
int rmq[20][N];
int pos[N], d[N];
vector<int> adj[N];
int timer;
int n;
lca_t(int n = 0) : n(n) {}
void add_edge(int u, int v) {
adj[u].emplace_back(v);
adj[v].emplace_back(u);
}
void dfs(int u, int p) {
rmq[0][timer++] = u;
for (int v : adj[u]) {
if (v == p) continue;
d[v] = d[u] + 1;
dfs(v, u);
rmq[0][timer++] = u;
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |