Submission #1007304

#	Time	Username	Problem	Language	Result	Execution time	Memory
1007304		THXuan	Advertisement 2 (JOI23_ho_t2)	C++14	100 / 100	119 ms	21016 KiB

Main

#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define INF 1e9
using namespace std;
typedef long long ll;

void solve()
{
	int n; cin >> n;
	vector<pair<ll, ll>>v;
	for (int i = 1; i <= n; i++) {
		ll x, e; cin >> x >> e;
		v.push_back({ e-x, e + x});
	}
	sort(v.begin(), v.end());
	stack<ll>stk;
	for (int i = 0; i < n; i++) {
		while (stk.size() && v[i].second >= stk.top()) stk.pop();
		stk.push(v[i].second);
	}
	cout << stk.size() << "\n";
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;// cin>>t;
	while (t--) solve();
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 23 / 23
• Subtask 3: 36 / 36
• Subtask 4: 31 / 31