# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
894199 | box | Two Currencies (JOI23_currencies) | C++17 | 539 ms | 69644 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 FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define ar array
#define all(v) (v).begin(), (v).end()
#define sz(v) static_cast<int>(v.size())
typedef vector<int> vi;
typedef long long ll;
const int N = 1e5, L = 17, N_ = N * 20;
int ct[N_], lc[N_], rc[N_], tt;
ll sm[N_];
vi vc;
int copy(int k) {
tt++;
ct[tt] = ct[k], lc[tt] = lc[k], rc[tt] = rc[k], sm[tt] = sm[k];
return tt;
}
void upd(int& k, int l, int r, int i) {
k = copy(k);
sm[k] += vc[i], ct[k]++;
if (l < r) {
int m = (l + r) / 2;
# | 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... |