# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520415 | Alex_tz307 | Addk (eJOI21_addk) | C++17 | 137 ms | 8312 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 MAXN = 1e5 + 5;
const int MAXK = 10;
int n, k, a[MAXN], v[MAXK];
int64_t sum[MAXN], pref[MAXN], suf[MAXN];
void update_sum(int poz, int64_t x) {
for (int i = poz; i <= n; i += i & -i)
sum[i] += x;
}
int64_t query_sum(int x) {
int64_t ans = 0;
for (int i = x; i > 0; i -= i & -i)
ans += sum[i];
return ans;
}
int64_t interval_sum(int l, int r) {
return query_sum(r) - query_sum(l - 1);
}
void update_pref(int poz, int64_t x) {
for (int i = poz; i <= n; i += i & -i)
pref[i] += x;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |