# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
752034 | NeroZein | Examination (JOI19_examination) | C++17 | 1727 ms | 11572 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;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
const int BL = 317;
const int N = 100005;
struct Queries {
int a, b, c, id;
bool operator < (const Queries& other) {
if (a / BL != other.a / BL) {
return a < other.a;
}
return b < other.b;
};
};
int tree[N];
inline void upd (int id, int v) {
id++;
while (id < N) {
tree[id] += v;
id += id & -id;
}
}
# | 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... |