제출 #1247401

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247401		ducksaysquack	Advertisement 2 (JOI23_ho_t2)	C++20	33 / 100	330 ms	19916 KiB

Main

#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>> L(n), R(n);
	for(int i=0;i<n;i++) {
		int a, b; cin >> a >> b;
		L[i].f = a-b, L[i].s = i, R[i].f = a+b, R[i].s = i;
	}
	sort(begin(L),end(L)); sort(begin(R),end(R));
	vector<int> v(n); for(int i=0;i<n;i++) v[R[i].s] = i;
	int ans = 0, x = -1, y = 0;
	for(int i=0;i<n;i++) {
		while(x < n-1) {
			if(L[x+1].f == L[i].f) {
				x++, y = max(y, v[L[x].s]);
				while(y < n-1) {if(R[y+1].f == R[y].f) y++; else break;}
			} else break;
		}
		if(v[L[i].s] >= y) ans++;
	}
	cout << ans;
}

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