제출 #924371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
924371		Edu175	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	967 ms	81960 KiB

Main

#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ggdem=b;i<ggdem;++i)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define imp(v) for(auto edu:v)cout<<edu.fst<<","<<edu.snd<<" "; cout<<"\n"
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;

int main(){FIN;
	ll n; cin>>n;
	vector<ii>a(n),b;
	fore(i,0,n)cin>>a[i].fst>>a[i].snd;
	sort(ALL(a));
	fore(i,0,n){
		if(SZ(b)&&b.back().fst==a[i].fst)b.pop_back();
		b.pb(a[i]);
	}
	// cout<<SZ(b)<<"\n"; //sb1
	a=b; n=SZ(a);
	set<ii>bet;
	set<ll>st;
	fore(i,0,n)bet.insert({a[i].snd,i}),st.insert(i);
	ll res=0;
	while(SZ(st)){
		res++;
		ll p=prev(bet.end())->snd;
		vector<ll>pop={p};
		for(auto it=st.lower_bound(p);it!=st.begin();){
			it--;
			ll i=*it;
			if(!(abs(a[i].fst-a[p].fst)<=a[p].snd-a[i].snd))break;
			pop.pb(i);
		}
		for(auto it=++st.lower_bound(p);it!=st.end();it++){
			ll i=*it;
			if(!(abs(a[i].fst-a[p].fst)<=a[p].snd-a[i].snd))break;
			pop.pb(i);
		}
		for(auto i:pop)bet.erase({a[i].snd,i}),st.erase(i);
	}
	cout<<res<<"\n";
	return 0;
}

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