# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296055 | Berted | Election Campaign (JOI15_election_campaign) | C++14 | 259 ms | 28536 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 <iostream>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define ppi pair<pii, int>
#define fst first
#define snd second
using namespace std;
const int LG = 17;
struct BIT
{
int N; ll A[100001];
BIT() {}
BIT(int size) {N = size;}
void init(int size) {N = size;}
void update(int x, ll val)
{
for (; x <= N; x += x & (-x)) {A[x] += val;}
}
ll query(int x)
{
ll ret = 0;
for (; x; x -= x & (-x)) {ret += A[x];}
return ret;
}
};
int N, Q, h[100001], L[100001], R[100001], sps[100001][LG], idx = 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |