Submission #181482

---

Source Code Expand

#include <stdio.h>
#include <algorithm>
#include <vector>

using namespace std;

int n,t;
int zax[20005],zay[20005];
vector<int>seg[1<<16];
void update(int k,int x)
{
	k += (1<<15)-1;
	seg[k].push_back(x);
}
void update2()
{
	for(int k=(1<<15)-2;k>=0;k--)
	{
		seg[k].resize(seg[k*2+1].size()+seg[k*2+2].size());
		merge(seg[k*2+1].begin(),seg[k*2+1].end(),seg[k*2+2].begin(),seg[k*2+2].end(),seg[k].begin());
	}
}
int query(int k,int l,int r,int ax,int bx,int ay,int by)
{
	if(bx < l || r < ax) return 0;
	if(ax <= l && r <= bx)
	{
		return upper_bound(seg[k].begin(),seg[k].end(),by)-lower_bound(seg[k].begin(),seg[k].end(),ay);
	}
	int x = query(k*2+1,l,(l+r)/2,ax,bx,ay,by);
	int y = query(k*2+2,(l+r)/2+1,r,ax,bx,ay,by);
	return x+y;
}

int main()
{
	scanf("%d %d",&n,&t);
	vector<int>x,y;
	for(int i=0;i<n;i++)
	{
		scanf("%d %d",&zax[i],&zay[i]);
		x.push_back(zax[i]);
		y.push_back(zay[i]);
	}
	sort(x.begin(),x.end());
	sort(y.begin(),y.end());
	for(int i=0;i<n;i++)
	{
		zax[i] = lower_bound(x.begin(),x.end(),zax[i])-x.begin();
		zay[i] = lower_bound(y.begin(),y.end(),zay[i])-y.begin();
		update(zax[i],zay[i]);
	}//return 0;
	update2();
	int res = 1e9;
	int l,r;
	for(int i=0;i<n;i++)
	{
		for(int j=i+1;j<n;j++)
		{
			if(abs(zax[i]-zax[j]) >= t-1 && abs(zay[i]-zay[j]) >= t-1)
			{
				int ex = query(0,0,(1<<15)-1,min(zax[i],zax[j]),max(zax[i],zax[j]),min(zay[i],zay[j]),max(zay[i],zay[j]));
				if(res > ex)
				{
					res = ex;
					l = i; r = j;
				}
				if(res == t)
				{
					printf("%d %d\n",l,r);
					return 0;
				}
			}
		}
	}
	printf("%d %d\n",l,r);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:37:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:41:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result