# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925153 | DAleksa | Two Currencies (JOI23_currencies) | C++17 | 2476 ms | 181140 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;
#define int long long
struct node {
int cnt;
long long sum;
node() : cnt(0), sum(0) { }
};
const int N = 1e5 + 10, LOG = 18;
int n, m, q;
vector<int> g[N];
vector<pair<int, int>> edg;
vector<pair<int, pair<int, int>>> edges;
int tin[N], tout[N], timer;
int up[N][LOG];
node st[50 * N];
int ll[50 * N], rr[50 * N];
int id;
int dep[N];
int which[N];
bool is_ancestor(int u, int v) { return tin[u] <= tin[v] && tout[u] >= tout[v]; }
int LCA(int u, int v) {
if(is_ancestor(u, v)) return u;
if(is_ancestor(v, u)) return 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... |