Submission #1094065

#	Time	Username	Problem	Language	Result	Execution time	Memory
1094065		vjudge1	Advertisement 2 (JOI23_ho_t2)	C++14	100 / 100	114 ms	19144 KiB

Main

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=500005;
int n,x[N],e[N],b[N],q[N],tot;
pair<int,int> a[N];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>x[i]>>e[i];
		a[i]=make_pair(e[i]-x[i],x[i]+e[i]);
	}
	sort(a+1,a+1+n);
	for(int i=1;i<=n;i++)
	{
		while(tot&&a[q[tot]].second<=a[i].second)tot--;
		q[++tot]=i;
	}
	cout<<tot<<endl;
	return 0;
}

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