[NOIP2011 提高组] 铺地毯

传送门
code

#include<bits/stdc++.h>
using namespace std;
const int N=1e4+5;
int n,x,y;
struct node
{
	int a,b,g,k;
}each[N];

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d%d",&each[i].a,&each[i].b,&each[i].g,&each[i].k );
	}
	scanf("%d%d",&x,&y);
	for(int i=n;i>=1;i--)
	{
		if(x>=each[i].a &&x<=(each[i].a+each[i].g ))
		{
			if(y>=each[i].b &&y<=(each[i].b +each[i].k ))
			{
				cout<<i<<endl;
				return 0;
			}
		}
	}
	cout<<-1<<endl;
	return 0;
}