# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
640203 | iee | Putovanje (COCI20_putovanje) | C++17 | 156 ms | 27268 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 + 5, Log = 20;
using ll = long long;
int n, a[N], b[N], c1[N], c2[N];
vector<tuple<int, int, int>> e[N];
ll ans;
int d[N];
int anc[N][Log];
int wc1[N], wc2[N];
int dep[N];
void dfs1(int u, int fa) {
anc[u][0] = fa;
dep[u] = dep[fa] + 1;
for (int i = 1; i < Log; ++i) anc[u][i] = anc[anc[u][i - 1]][i - 1];
for (auto ver: e[u]) {
int v, C1, C2;
tie(v, C1, C2) = ver;
if (v == fa) continue;
wc1[v] = C1;
wc2[v] = C2;
dfs1(v, u);
}
}
int lca(int u, int v) {
if (dep[u] < dep[v])
swap(u, v);
for (int i = Log - 1; i >= 0; --i)
if (dep[anc[u][i]] >= dep[v])
u = anc[u][i];
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... |