Submission #1311909

#TimeUsernameProblemLanguageResultExecution timeMemory
1311909vtnooAdvertisement 2 (JOI23_ho_t2)C++20
100 / 100
155 ms16432 KiB
#include <bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define sz(a) ((int) a.size())
#define all(a) a.begin(), a.end()
#define vi vector<ll>
#define pb emplace_back
#define me(a, x) memset(a, x, sizeof(a))
#define fst first
#define snd second
#define ii pair<ll, ll>
using namespace std;
int main(){
	ios::sync_with_stdio(false); 
	cin.tie(nullptr);
	int n;cin>>n;
	vector<ii>p;
	L(i,0,n-1){
		int a,b;cin>>a>>b;
		p.pb(b-a,b+a);
	}
	sort(all(p));
	stack<ii>s;
	L(i,0,n-1){
		while(sz(s)&&s.top().snd<=p[i].snd)s.pop();
		s.push(p[i]);
	}
	cout<<sz(s);
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...