# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
169229 | aggu_01000101 | Lightning Rod (NOI18_lightningrod) | C++14 | 0 ms | 0 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 <iostream>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <fstream>
#include <vector>
#include <set>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <map>
#define int long long
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
stack<pair<int, int>> st;
for(int i =0 ;i<n;i++){
int x, y;
cin>>x>>y;
while(!st.empty()){
if(abs(x - st.top().first)<=(st.top().second - y)) goto nopush;
if(abs(x - st.top().first)<=(y-st.top().second)) st.pop();
else goto push;
}
push:
st.push(make_pair(x, y));
nopush:
continue;
}
cout<<st.size()<<endl;
}