# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
889383 | Pannda | Two Currencies (JOI23_currencies) | C++17 | 710 ms | 58696 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;
template<class T>
struct Fenwick {
int n;
vector<T> bit;
Fenwick(int n) : n(n), bit(n + 1, 0) {}
void add(int i, T delta) {
for (i++; i <= n; i += i & -i) {
bit[i] += delta;
}
}
void add(int l, int r, T delta) {
add(l, +delta);
add(r, -delta);
}
T get(int i) {
T res = 0;
for (i++; i > 0; i -= i & -i) {
res += bit[i];
}
return res;
}
};
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... |