# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763261 | MetalPower | Two Currencies (JOI23_currencies) | C++14 | 948 ms | 39484 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;
const int MX = 1e5 + 10;
#define ll long long
#define pii pair<int, int>
#define pli pair<ll, int>
#define fi first
#define se second
// parallel binser + hld
struct segtree{
pli st[MX << 1];
void build(){
for(int i = 0; i < (MX << 1); i++) st[i] = {0ll, 0};
}
void upd(int p, int v){
for(p += MX, st[p].fi += v, st[p].se += 1, p >>= 1; p > 0; p >>= 1){
st[p].fi = st[p << 1].fi + st[p << 1|1].fi;
st[p].se = st[p << 1].se + st[p << 1|1].se;
}
}
pli que(int l, int r){
pli res = {0, 0};
for(l += MX, r += MX + 1; l < r; l >>= 1, r >>= 1){
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... |