Submission #917689

#	Time	Username	Problem	Language	Result	Execution time	Memory
917689		happypotato	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	133 ms	18380 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ff first
#define ss second
#define pb push_back
bool contain(pii lhs, pii rhs) {
	return abs(lhs.ff - rhs.ff) <= (lhs.ss - rhs.ss);
}
int main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int n; cin >> n;
	pii a[n];
	for (int i = 0; i < n; i++) cin >> a[i].ff >> a[i].ss;
	sort(a, a + n);
	
	vector<pii> sel;
	for (int i = 0; i < n; i++) {
		while (!sel.empty()) {
			if (contain(a[i], sel.back())) sel.pop_back();
			else break;
		}
		if (sel.empty() || !contain(sel.back(), a[i])) {
			sel.pb(a[i]);
		}
	}

	cout << sel.size() << '\n';
}

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