题解 | 铺地毯

#include<bits/stdc++.h>
using namespace std;
bool cover(int x,int y,vector<int>pos){
    int ldx = pos[0], ldy = pos[1];
    int rux = ldx+pos[2], ruy = ldy+pos[3];
    return (x>=ldx&&x<=rux&&y>=ldy&&y<=ruy);
}
int main(){
    int n,x,y;
    cin>>n;
    vector<vector<int>>ipt(n,vector<int>(4));
    for(int i=0;i<n;i++)for(int j=0;j<4;j++)cin>>ipt[i][j];
    cin>>x>>y;
    int res = -1;
    for(int i=0;i<n;i++)if(cover(x,y,ipt[i]))res=i+1;
    cout<<res<<endl;
    return 0;
}