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;
#define ll long long
bool check(ll x1, ll x2, ll y1, ll y2)
{
return abs(x1 - x2) <= y1 - y2;
}
int main()
{
int n;
ll a, b;
stack<pair<ll, ll>> st;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> a >> b;
if (!st.empty() && check(st.top().first, a, st.top().second, b)) // old cover new
{
continue;
}
while (!st.empty() && check(a, st.top().first, b, st.top().second)) // new cover old
{
st.pop();
}
st.push({a,b});
}
cout << st.size();
}
# | 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... |