# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
475534 | wildturtle | Addk (eJOI21_addk) | C++17 | 425 ms | 8672 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>
#define ll long long
#define f first
#define sc second
#define pb push_back
using namespace std;
ll a, b, c, d, i, e, f, g, n, m, k, l, r, x, t, ans, le, ri, lrev, rrev, lerev, rirev;
ll A[100005], B[100005], BITree[5][100005];
void updateBIT(ll x, ll idx, ll val) {
idx++;
while (idx < n + 3) {
BITree[x][idx] += val;
idx += idx & (-idx);
}
}
ll getSum(ll x, ll idx) {
idx++;
ll sum = 0;
while (idx > 0) {
sum += BITree[x][idx];
idx -= idx & (-idx);
}
return sum;
}
int main() {
cin >> n >> k;
for (ll i = 1; i <= n; i++) {
cin >> A[i];
updateBIT(1, i, A[i]);
updateBIT(2, i, A[i]*i);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |