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 main() {
cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
vector<pair<int, int>> st;
for(int x, y, i = 0; i < n; ++i){
cin >> x >> y;
bool add = true;
while(!st.empty()){
// current building bad
if(x + y <= st.back().second + st.back().first){ add = false; break; }
// previous building bad
if(x - y <= st.back().first - st.back().second){ st.pop_back();}
else break;
}
if(add) st.emplace_back(x, y);
}
cout << st.size() << "\n";
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... |