# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9836 | Qwaz | 허수아비 (JOI14_scarecrows) | C++98 | 204 ms | 7336 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 <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAX = 200020;
struct point {
int x, y;
bool operator < (const point &t) const {
return x < t.x;
}
};
int n;
point data[MAX], tmp[MAX];
void init(){
scanf("%d", &n);
int i;
for(i = 0; i<n; i++)
scanf("%d%d", &data[i].x, &data[i].y);
sort(data, data+n);
}
point lStack[MAX], rStack[MAX];
int lTop, rTop;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |