제출 #1135557

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135557		yellowtoad	Advertisement 2 (JOI23_ho_t2)	C++20	0 / 100	81 ms	2628 KiB

Main

#include <iostream>
#include <vector>
#include <algorithm>
#define f first
#define s second
using namespace std;

int n, suf[100010], minn = 1e9, ans = 1e9;
pair<int,int> a[500010], b[500010];
vector<int> v;

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].f >> a[i].s;
		b[i] = a[i];
		a[i].s -= a[i].f;
		b[i].s += b[i].f;
		b[i].s = -b[i].s;
	}
	sort(a+1,a+n+1);
	sort(b+1,b+n+1);
	for (int i = n; i >= 1; i--) {
		b[i].s = -b[i].s;
		while ((v.size()) && (v.back() <= b[i].s)) v.pop_back();
		v.push_back(b[i].s);
		suf[i] = v.size();
	}
	v.clear();
	for (int i = 1; i <= n; i++) {
		while ((v.size()) && (v.back() <= a[i].s)) v.pop_back();
		v.push_back(a[i].s);
		minn = min(minn,suf[i]-1);
		ans = min(ans,minn+(int)v.size());
	}
	cout << ans << endl;
}

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