# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
251317 | imeimi2000 | Sweeping (JOI20_sweeping) | C++17 | 8715 ms | 985208 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;
int n, m, q;
int X[1500001], Y[1500001];
int T[1000001], A[1000001], B[1000001];
vector<int> cp;
int I[1500001];
struct point {
mutable int * val;
bool operator<(point p) const {
return *val < *p.val;
}
operator int() const { return *val; }
} L[1500001], R[1500001];
struct node {
map<point, vector<int>> L, R;
} seg[1 << 22];
point insert(map<point, vector<int>> &sp, int x, int p) {
point v;
v.val = &x;
if (!sp.count(v)) {
point p;
p.val = new int(x);
sp[p];
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |