# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
684236 | izanbf | Examination (JOI19_examination) | C++14 | 1761 ms | 62096 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;
struct Point {
int x, y, z;
};
struct Query {
int a, b, c, id;
};
const int B = 850;
const int MAXSZ = 6e5+9;
int bit[MAXSZ]; // binary/fenwick indexed tree
int sz; // bit size
int bit_sum(int r) {
int sum = 0;
for (++r; r > 0; r -= r&-r)
sum += bit[r];
return sum;
}
int bit_sum(int l, int r) {
return bit_sum(r) - bit_sum(l-1);
}
void bit_add(int r, int delta) {
for (++r; r <= sz; r += r&-r)
# | 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... |