# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259518 | ChrisT | Examination (JOI19_examination) | C++17 | 403 ms | 40156 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;
const int MN = 2e5 + 5;
int ans[MN], bit[MN];
vector<int> xs;
void getx (int &x) {x = lower_bound(xs.begin(),xs.end(),x) - xs.begin() + 1;}
void inc (int i) {
for (i=MN-i;i<MN;i+=i&-i) ++bit[i];
}
void dec (int i) {
for (i=MN-i;i<MN;i+=i&-i) --bit[i];
}
int query (int i) {
int ret = 0;
for (i=MN-i;i;i^=i&-i) ret += bit[i];
return ret;
}
struct Event {
int x,y,z,id;
};
void cdq (int l, int r, vector<Event> &events) { //over z
if (events.empty()) return;
if (l==r) {
for (Event &e : events) {
if (e.id<0)inc(e.y);
else ans[e.id] += query(e.y);
}
for (Event &e : events) if (e.id<0) dec(e.y);
return;
}
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... |