#include <iostream>  
#define int long long
using namespace std;  
int a[10001][2] , b[10001][2] , x , y , i , n , m;  
signed main()  
{  
	scanf ("%d" , &i);   
	for (int j = 1 ; j <= i ; j++) 
	{ 
		scanf("%d %d %d %d" , &a[j][0] , &a[j][1] , &n , &m); 
		b[j][0] = a[j][0]+n; 
		b[j][1] = a[j][1]+m;
	}  
	scanf ("%d %d" , &x , &y);  
	for (int j = i ; j >= 1 ; j--)  
		if (x >= a[j][0]  &&  x <= b[j][0]  &&  y >= a[j][1]  && y <= b[j][1]) 
		{
			printf("%d" , j);  
			return 0;
		}  
	cout << -1 << endl;  
	return 0;  
}

暴力搜一遍

#include<bits/stdc++.h>
using namespace std;
int n,x,y,l=-1,a[100000],b[100000],g[100000],k[100000];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i]>>b[i]>>g[i]>>k[i];
	}cin>>x>>y;
	for(int i=1;i<=n;i++){
		if(x>=a[i]&&x<=a[i]+g[i]&&y>=b[i]&&y<=b[i]+k[i]) l=i;
	}cout<<l;
}