1301.cpp

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

#include <iostream.h>
#include <string.h>

bool a[4][10][10],g[10],ok[10],ok2[10],done;
int n,x,y,i,j,k;
char com[20];

int main()
{
	cin>>com;
start:	
	cin>>x>>y;
	for (i=0;i<x;i++)
		ok[i]=0;
	for (j=0;j<=3;j++)
		for (k=0;k<y;k++)
			for (i=0;i<x;i++)
				a[j][k][i]=1;
	for (k=0;k<y;k++)
	{
		cin>>com;
		for (i=0;i<x;i++)
		{
			if (com[i]=='L')
				ok[i]=1;
			if (com[i]=='S')
			{
				for (j=0;j<=3;j++)
					a[j][k][i]=0;
				for (j=k-1;j>=0;j--)
					a[0][j][i]=0;
				for (j=i+1;j<x;j++)
					a[1][k][j]=0;
				for (j=k+1;j<y;j++)
					a[2][j][i]=0;
				for (j=i-1;j>=0;j--)
					a[3][k][j]=0;
			}
			if (com[i]=='G')
				g[i]=1;
			if (com[i]=='P')
				g[i]=0;
		}
	}
	cin>>com;
	for (i=0;i<y-1;i++)
	{
		for (j=0;j<x;j++)
			ok2[j]=0;
		for (j=0;j<x;j++)
		{
			if (ok[j] && a[i%4][i][j])
			{
				if (j>0)
					if (a[i%4][i+1][j-1] && a[(i+1)%4][i+1][j-1])
						ok2[j-1]=1;
				if (a[i%4][i+1][j] && a[(i+1)%4][i+1][j])
					ok2[j]=1;
				if (j<x-1)
					if (a[i%4][i+1][j+1] && a[(i+1)%4][i+1][j+1])
						ok2[j+1]=1;
			}
		}
		for (j=0;j<x;j++)
			ok[j]=ok2[j];
	}
	done=0;
	for (i=0;i<x;i++)
		if (ok[i] && g[i])
			done=1;
	if (done)
		cout<<"FERRET\n";
	else
		cout<<"GARRET\n";
	cin>>com;
	if (strlen(com)<=6)
		goto start;
	return 0;
}