铺地毯
陈子骏
2018-04-02 17:43:38
```
// luogu-judger-enable-o2
#include<iostream>
#include<cstdio>
using namespace std;
int n,m,k;
struct edg{
int x,y,x1,y1;
}a[10005];
int main()
{
int ans=-1;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d%d%d%d",&a[i].x,&a[i].y,&a[i].x1,&a[i].y1);
scanf("%d%d",&m,&k);
for(int i=n;i>=1;i--)
{
if(m>=a[i].x&&k>=a[i].y&&m<=(a[i].x+a[i].x1)&&k<=(a[i].y+a[i].y1))
{
ans=i;
break;
}
}
printf("%d",ans);
}
```