# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113254 | imeimi2000 | Examination (JOI19_examination) | C++17 | 585 ms | 25652 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 <algorithm>
#include <vector>
#define fs first
#define se second
using namespace std;
typedef pair<int, int> pii;
const int inf = 1e9;
struct query {
int x, y, z, i;
void scan(int idx) {
i = idx;
cin >> x >> y >> z;
}
bool operator<(const query &p) const {
return z < p.z;
}
} qs[100000];
int ans[100000];
pii ps[100000];
struct fenwick1D {
vector<int> comp, seg;
void add(int x) {
comp.push_back(x);
}
void init() {
sort(comp.begin(), comp.end());
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... |