注意：在矩形地毯边界和四个顶点上的点也算被地毯覆盖。
by zrl123456 @ 2023-11-24 20:19:52
三重循环竟然不TLE！
by zrl123456 @ 2023-11-24 20:20:40
```cpp
#include <bits/stdc++.h>
using namespace std;
const int MAX=1e4+5;
struct node{
int a,b,g,k;
}m[MAX];
int n,x,y,ans=-1;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d%d%d%d",&m[i].a,&m[i].b,&m[i].g,&m[i].k);
}
scanf("%d%d",&x,&y);
for(int i=1;i<=n;i++){
if(m[i].a<=x&&m[i].a+m[i].g>=x&&m[i].b<=y&&m[i].b+m[i].k>=y){
ans=i;
}
}
printf("%d",ans);
return 0;
}
```
by zrl123456 @ 2023-11-24 20:21:31
谢谢
by kuxiaowo @ 2023-11-26 09:50:07