# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
751930 | Spade1 | Two Currencies (JOI23_currencies) | C++14 | 857 ms | 118116 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>
//#include <grader.h>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;
const int N = 1e5 + 10;
const int L = log2(N)+1;
struct node{
ll val, cnt;
ll lc, rc;
}seg[20*N];
vector<pll> adj[N];
vector<ll> cost[N];
map<ll, ll> mp, rv;
ll up[N][L], lvl[N], cnt, root[N];
void update(ll &cur, ll l, ll r, ll x, ll val) {
cnt++;
seg[cnt] = seg[cur];
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... |