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 TIME = clock();
#define file \
freopen("in.txt" , "r" , stdin); \
freopen("out.txt" , "w" , stdout);
void test_case () {
int n;
cin >> n;
stack <array <int , 2>> st;
auto check = [&](array<int , 2> fi , array<int , 2> se) -> bool {
return (abs(fi[0] - se[0]) <= fi[1] - se[1]);
};
for (int i = 0;i < n;i ++) {
int x , y;
cin >> x >> y;
array<int , 2> tmp = {x, y};
while (st.size() > 0 && check(st.top() , tmp)) {
st.pop();
}
if (st.size() == 0 || check(st.top() , tmp) == false) {
st.push(tmp);
}
}
cout << st.size() << "\n";
}
int32_t main () {
///// file
int t = 1;
// cin >> t;
while (t --) {
test_case();
}
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... |