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;
inline namespace
{
} // namespace
struct Point
{
long x, y;
bool covers(const Point &p) const { return abs(x - p.x) <= y - p.y; }
};
void solve()
{
int n;
cin >> n;
stack<Point> st;
for (int i = 0; i < n; i++)
{
Point pt;
cin >> pt.x >> pt.y;
while (!st.empty() && pt.covers(st.top()))
st.pop();
if (st.empty() || !st.top().covers(pt))
st.push(pt);
}
cout << (int)st.size() << '\n';
}
int main()
{
ios_base::sync_with_stdio(false), cin.tie(NULL);
solve();
return 0;
}
# | 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... |