时间复杂度·最优化·题解

#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
int x,y,g,k,id;
}a[10005];
int main(){
    cin>>n;
    int kkk=0;
    while(n--){
        kkk++;
        cin>>a[kkk].x>>a[kkk].y>>a[kkk].g>>a[kkk].k;
        a[kkk].id=kkk;
    }
    int ax,ay;
    cin>>ax>>ay;
    int flag=0;
    int index;
    for(int i=1;i<=kkk;i++){
        if(ax>=a[i].x && ax<=a[i].x+a[i].g && ay>=a[i].y && ay<=a[i].y+a[i].k){
            flag=1;
            index=a[i].id;
        }
    }
    if(flag){
        cout<<index;
    }else{
        cout<<-1;
    }
    return 0;
}