# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
918445 | OAleksa | Two Currencies (JOI23_currencies) | C++14 | 3713 ms | 161716 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
#define f first
#define s second
const int N = 2e5 + 69;
const int C = 1e9 + 69;
const int K = 18;
const int inf = 1e18;
int up[N][K];
int n, m, q, p[N], c[N], par[N], timer, tin[N], tout[N];
int root[N], lc[30 * N], rc[30 * N], node, vis[N];
int st[30 * N], cnt[30 * N];
vector<int> g[N];
vector<pair<int, int>> e;
map<pair<int, int>, vector<int>> edges;
void Modify(int v, int rt, int tl, int tr, int p) {
if (tl == tr) {
cnt[v] = cnt[rt] + 1;
st[v] = st[rt] + tl;
}
else {
int mid = (tl + tr) / 2;
if (p <= mid) {
lc[v] = ++node;
rc[v] = rc[rt];
Modify(lc[v], lc[rt], tl, mid, p);
}
else {
rc[v] = ++node;
# | 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... |