# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261198 | Bruteforceman | Examination (JOI19_examination) | C++11 | 3035 ms | 195720 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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
const int maxn = 2e5 + 10;
typedef pair <int, int> pii;
typedef tree <pii,
null_type,
less <pii>,
rb_tree_tag,
tree_order_statistics_node_update> orderset;
struct info {
int x, y, z;
int id;
info (int x, int y, int z) : x(x), y(y), z(z) {}
info () {}
bool operator < (info d) const {
if(z == d.z) {
return id < d.id;
}
return z > d.z;
}
} a[maxn];
orderset t[maxn * 4];
int ans[maxn];
int idx;
void add(int x, int y, int id, int c = 1, int b = 1, int e = idx) {
t[c].insert(pii(y, id));
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... |