# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373192 | LucaDantas | Examination (JOI19_examination) | C++17 | 580 ms | 51420 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<cstdio>
#include<vector>
#include <algorithm>
#include<utility>
constexpr int maxn = 1e5+10, B = 1000, maxB = 110; // block sz
struct BIT
{
int bit[maxB][maxn], n; // x, y
void upd(int x, int y) {
// puts("A");
for(int i = x+1; i < maxB; i += i&-i)
for(int j = y; j < maxn; j += j&-j)
bit[i][j]++;
// puts("B");
}
int query(int x, int y) {
int ans = 0;
for(int i = x+1; i > 0; i -= i&-i)
for(int j = y; j > 0; j -= j&-j)
ans += bit[i][j];
return ans;
}
} bit;
struct Query
{
int x, y, z, id;
Query(int a, int b, int c, int sla) : x(a), y(b), z(c), id(sla) {}
Compilation message (stderr)
# | 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... |