# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519542 | valerikk | Election Campaign (JOI15_election_campaign) | C++17 | 186 ms | 51680 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;
typedef long long ll;
const int N = 5e5 + 10;
const int K = 20;
struct {
ll t[(int) 1e6 + 10];
void upd(int ind, ll val) {
for (int i = ind + 1; i < N; i += i & -i) {
t[i] += val;
}
}
void upd(int l, int r, ll val) {
upd(l, val);
upd(r, -val);
}
int get(int ind) {
ll sum = 0;
for (int i = ind + 1; i > 0; i -= i & -i) {
sum += t[i];
}
return sum;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |