# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797888 | 1bin | Advertisement 2 (JOI23_ho_t2) | C++14 | 129 ms | 14084 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 <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 5e5 + 5;
int n, x, y;
vector<pair<int, int>> v;
stack<pair<int, int>> st;
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 0; i < n; i++) cin >> x >> y, v.emplace_back(x, y);
sort(all(v));
for(int i = 0; i < n; i++){
auto&[x, y] = v[i];
while(st.size() && y - st.top().second >= x - st.top().first) st.pop();
if(st.empty() || st.top().second - y < x - st.top().first) st.emplace(x, y);
}
cout << st.size();
return 0;
}
Compilation message (stderr)
# | 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... |