洛谷 1003 NOIP2011 D1T1 铺地毯

#include<cstdio>
#include<algorithm>
#define rg register
#define N (20010)
using namespace std;
int n,x[N],y[N],a[N],b[N],qx,qy;
inline int read(){
	int k=0,f=1; char c=getchar();
	while(c<‘0‘||c>‘9‘)c==‘-‘&&(f=-1),c=getchar();
	while(‘0‘<=c&&c<=‘9‘)k=k*10+c-‘0‘,c=getchar();
	return k*f;
}
int main(){
	n=read();
	for(rg int i=1;i<=n;i++) x[i]=read(),y[i]=read(),a[i]=read(),b[i]=read();
	qx=read(); qy=read();
	for(rg int i=n;i>0;i--) if(x[i]<=qx&&x[i]+a[i]>=qx&&y[i]<=qy&&y[i]+b[i]>=qy){
		printf("%d\n",i); return 0;
	}
	return puts("-1"),0;
}