| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 847553 | StefanSebez | Advertisement 2 (JOI23_ho_t2) | C++14 | 1 ms | 348 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int inf=1e9+500;
int main()
{
    int n;
    scanf("%i",&n);
    pair<int,int>a[n+1];
    for(int i=1;i<=n;i++)
	{
		scanf("%i%i",&a[i].fi,&a[i].se);
	}
	sort(a+1,a+n+1);
	int b[n+1],c[n+1];
	for(int i=1;i<=n;i++)
	{
		b[i]=a[i].se-a[i].fi;
		c[i]=a[i].se+a[i].fi;
	}
	for(int i=1;i<=n;i++)
	{
		printf("%i %i %i %i\n",a[i].fi,a[i].se,b[i],c[i]);
	}
	int res=0;
	int l=1,r=n,Mb=-inf,Mc=-inf;
	while(1)
	{
		int maksb=-inf,maksc=-inf,idb,idc;
		for(int i=l;i<=r;i++)
		{
			if(maksb<=b[i] && Mc<c[i])
			{
				idb=i;
				maksb=b[i];
			}
			if(maksc<c[i] && Mb<b[i])
			{
				idc=i;
				maksc=c[i];
			}
		}
		if(maksb==-inf || maksc==-inf)break;
		res+=2;
		Mb=max(Mb,b[idc]);
		Mc=max(Mc,c[idb]);
		if(idc==idb)res--;
		if(idc<=idb)break;
		l=idb+1;
		r=idc-1;
	}
	printf("%i\n",res);
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
