# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
940569 | jasen_penchev | Two Currencies (JOI23_currencies) | C++14 | 1929 ms | 150296 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 <algorithm>
#include <iostream>
#include <vector>
#define endl '\n'
using namespace std;
/// LCA + Euler tour + Persistent segment tree
const int MAX = 100000;
const int LOG = 17;
struct node
{
int l, r, gold;
long long silver;
};
int n, m, q;
int d[MAX + 5];
int root[MAX + 5];
int st[MAX + 5][LOG + 5];
node tree[100 * MAX + 5];
int cnt, in[MAX + 5], out[MAX + 5];
vector< pair<int, int> > G[MAX + 5];
pair<int, int> edges[MAX + 5], checkpoints[MAX + 5];
void DFS(int u, int p)
{
st[u][0] = p;
in[u] = ++ cnt;
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... |