# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933541 | velislavgarkov | Two Currencies (JOI23_currencies) | C++14 | 1700 ms | 150384 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 <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
#define endl '\n'
const int MAXN=1e5+10;
struct Edge {
int a, b, to;
};
struct Checkpoint {
long long c;
int subt;
bool friend operator < (Checkpoint a, Checkpoint b) {
return a.c<b.c;
}
};
struct Node {
long long sum, active;
int l, r;
};
vector <pair <int,int> > v[MAXN];
Checkpoint p[MAXN];
Edge ed[MAXN];
Node tree[100*MAXN];
int root[MAXN], cnt;
int in[MAXN], out[MAXN], dep[MAXN], sp[MAXN][20];
int n, m, q;
int build_tree(int l, int r) {
int cur=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... |