Submission #1247544

#TimeUsernameProblemLanguageResultExecution timeMemory
1247544ducksaysquackAdvertisement 2 (JOI23_ho_t2)C++20
100 / 100
344 ms31592 KiB
#include <bits/stdc++.h>
#define int long long
#define f first
#define s second
using namespace std;
signed main() {
	int n; cin >> n;
	vector<pair<int,int>> v(n);
	for(int i=0;i<n;i++) {
		int a, b; cin >> a >> b;
		v[i].f = a-b, v[i].s = a+b;
	}
	sort(begin(v),end(v));
	set<int> t; int x = -1e18;
	for(int i=0;i<n;i++) if(x < v[i].s) {x = v[i].s; t.insert(v[i].f);}
	cout << t.size() << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...