# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928762 | juliany2 | Two Currencies (JOI23_currencies) | C++17 | 231 ms | 41196 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;
using ll = long long;
#define all(x) (x).begin(), (x).end()
const int N = 2e5 + 7, L = 20;
int n, m, q;
vector<int> adj[N], a[N];
array<int, 2> e[N];
int lift[N][L];
int dep[N];
ll w[N];
void dfs(int v = 1, int p = 0) {
lift[v][0] = p;
for (int i = 1; i < L; i++)
lift[v][i] = lift[lift[v][i - 1]][i - 1];
for (int u : adj[v]) {
if (u == p)
continue;
dep[u] = dep[v] + 1;
w[u] += w[v];
dfs(u, v);
}
}
int lca(int u, int v) {
if (dep[u] > dep[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... |