2473.cpp

这些是我到目前在PKU上做出的题目

#include <iostream.h>

int a[201][5],i,j,ti,tj,ii,n,nn,x,y,nx,ny,k,i2,j2;
bool ok;

int main()
{
	cin>>nn;
	for (ii=1;ii<=nn;ii++)
	{
		cin>>n>>x>>y;ok=0;
		for (i=1;i<=n;i++)
			for (j=1;j<=4;j++)
				cin>>a[i][j];
		cin>>nx>>ny;
		for (j=0;j<=y-ny;j++)
		{
			j2=j+ny;tj=y-ny;
			for (i=0;i<=x-nx;i++)
			{
				ti=i;i2=i+nx;ok=1;
				for (k=1;k<=n;k++)
				{
					if (!(a[k][1]>=i2 || a[k][3]<=i || a[k][2]>=j2 || a[k][4]<=j))
					{
						ok=0;
						if (ti<a[k][3]-1)
							ti=a[k][3]-1;
						if (tj>a[k][4]-1)
							tj=a[k][4]-1;
					}
				}
				if (ok)
					goto finish;
				i=ti;
			}
			j=tj;
		}
finish:
		if (ok)
			cout<<i<<" "<<j<<"\n";
		else
			cout<<"Fail!\n";
	}
	return 0;
}