题解 100% AC

AC代码：

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int a[N],b[N],x[N],y[N];
int main(){
    int n,ans=-1;cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i]>>b[i]>>x[i]>>y[i];
    }
    int sx,sy;cin>>sx>>sy;
    for(int i=1;i<=n;i++){
    	if(sx>=a[i]&&sx<=a[i]+x[i]&&sy>=b[i]&&sy<=b[i]+y[i]) ans=i;
    }
    cout<<ans;
	return 0;
}

RE代码：

#include <bits/stdc++.h>
using namespace std;
struct carpet{
    int v,id;
}s[16359][16359];
int main(){
    int n;cin>>n;
    for(int i=1;i<=n;i++){
    	int a,b,x,y;
        cin>>a>>b>>x>>y;
        for(int j=a;j-a+1<=x;j++){
        	for(int k=b;k-b+1<=y;k++){
                s[j][k].v=1;
                s[j][k].id=i;
            }
        }
    }
    int sx,sy;cin>>sx>>sy;
    if(s[sx][sy].v==1) cout<<s[sx][sy].id;
    else cout<<-1;
	return 0;
}