# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
793292 | phoenix | Two Currencies (JOI23_currencies) | C++17 | 1494 ms | 39564 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;
using ll = long long;
const int N = 1e5 + 10;
const int M = (1 << 18);
ll t[2 * M];
void update(int ql, int qr, ll add) {
for(ql += M, qr += M + 1; ql < qr; ql >>= 1, qr >>= 1) {
if(ql & 1) t[ql++] += add;
if(qr & 1) t[--qr] += add;
}
}
ll get(int pos) {
ll res = 0;
for(pos += M; pos; pos >>= 1)
res += t[pos];
return res;
}
struct edge {
int u, v, i;
};
struct query {
ll i, s, t, x, y;
};
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... |