luogu P1003 铺地毯

水题

 #include<stdio.h>
 #include<string.h>
 #include<algorithm>
 using namespace std;
 template<class T>void read(T &x){
     int f=;x=;char ch=getchar();
     while(ch<''||ch>'')  {f|=(ch=='-');ch=getchar();}
     while(ch>=''&&ch<=''){x=(x<<)+(x<<)+(ch^);ch=getchar();}
     x=f?-x:x;
 }

 const int N=;
 int a[N],b[N],g[N],k[N];
 int n,x,y;

 int main(){
     read(n);
     for(int i=;i<=n;++i)
         read(a[i]),read(b[i]),read(g[i]),read(k[i]);
     read(x),read(y);
     for(int i=n;i>=;--i)
         if(a[i]<=x&&a[i]+g[i]>=x&&b[i]<=y&&b[i]+k[i]>=y){
             printf("%d\n",i);
             return ;
         }
     printf("-1\n");
     return ;
 }