# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
777115 | ind1v | Addk (eJOI21_addk) | C++11 | 86 ms | 8516 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 N = 100005;
const int K = 15;
struct fenwick_tree {
int64_t fenw[N];
fenwick_tree() {
memset(fenw, 0, sizeof(fenw));
}
void upd(int idx, long long val) {
for (; idx < N; idx |= (idx + 1)) {
fenw[idx] += val;
}
}
int64_t get(int idx) {
int64_t res = 0;
for (; idx >= 0; idx &= (idx + 1), --idx) {
res += fenw[idx];
}
return res;
}
int64_t get(int l, int r) {
return get(r) - get(l - 1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |