# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522759 | nhphucqt | Lightning Rod (NOI18_lightningrod) | C++17 | 1760 ms | 227808 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;
struct Point {
int x, y;
Point() {}
Point(int _x, int _y) {
x = _x; y = _y;
}
};
const int N = 1e7+7;
int numPoint, sz;
Point points[N], st[N];
bool inside(const Point &a, const Point &b) { // check if a is inside b
return abs(b.x - a.x) <= b.y - a.y;
}
int main() {
// cin.tie(nullptr)->sync_with_stdio(false);
#ifdef NHPHUCQT
freopen("demo.inp", "r", stdin);
freopen("demo.out", "w", stdout);
#endif // NHPHUCQT
scanf("%d", &numPoint);
for (int i = 0; i < numPoint; ++i) {
scanf("%d%d", &points[i].x, &points[i].y);
}
for (int i = 0, cnt = 0, maxs = 0; i < numPoint; ++i) {
cnt++; maxs = max(maxs, points[i].y);
if (i + 1 == numPoint || points[i].x != points[i+1].x) {
while (sz > 0 && inside(st[sz-1], Point(points[i].x, maxs))) {
sz--;
}
if (sz == 0 || !inside(Point(points[i].x, maxs), st[sz-1])) {
st[sz++] = points[i];
}
cnt = maxs = 0;
}
}
printf("%d", sz);
return 0;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |