Luogu_ P1003 [noip2011 improvement group] carpet laying_ Violence enumeration

Luogu _P1003 [NOIP2011 Improvement group ] Carpet _ Violence enumeration

 

 

 

//
#include<bits/stdc++.h>
using namespace std;

const int N=11111;
struct rug{ int a,b,aa,bb; }in[N];
int x,y;

bool f( const struct rug &z )
{			//  Bottom point + Side length  
    return ( x>=z.a && x<=z.a+z.aa && y>=z.b && y<=z.b+z.bb );
}			//  The points on the rectangular carpet boundary and four vertices are also covered by the carpet 

int main()
{
    int n,i;
    while( cin>>n )
    {
        memset( in,0,sizeof( in ) );
        for( i=1;i<=n;i++ )
        {
            cin>>in[i].a>>in[i].b>>in[i].aa>>in[i].bb;
        }
        cin>>x>>y;

        for( i=n;i;i-- )					//  Traversal in reverse order  
            if( f( in[i] ) ) break;
            
        if( i )     cout<<i<<endl;
        else        cout<<"-1"<<endl;		//  Special judgement  
    }
    return 0;
}
//  If you don't understand it, find out if there is any sample explanation