mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
113 lines
3.3 KiB
C++
113 lines
3.3 KiB
C++
|
#include<stdio.h>
|
||
|
|
#include<string.h>
|
||
|
|
char s[10000];
|
||
|
|
int map[111][111];
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
int n,i,j,flag=0,x,y,xx,yy,cg;
|
||
|
|
while(scanf("%s",s)!=EOF)
|
||
|
|
{
|
||
|
|
if(strcmp(s,"MOVE")==0)
|
||
|
|
{
|
||
|
|
if(flag==1)
|
||
|
|
{
|
||
|
|
if(cg==1) printf("MOVED\n");
|
||
|
|
else printf("FAILED\n");
|
||
|
|
cg=1;
|
||
|
|
flag=0;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if(strcmp(s,"SHOW")==0)
|
||
|
|
{
|
||
|
|
if(flag==1)
|
||
|
|
{
|
||
|
|
if(cg==1) printf("MOVED\n");
|
||
|
|
else printf("FAILED\n");
|
||
|
|
cg=1;
|
||
|
|
flag=0;
|
||
|
|
}
|
||
|
|
for(i=1;i<=n;i++)
|
||
|
|
{
|
||
|
|
for(j=1;j<n;j++)
|
||
|
|
printf("%d ",map[i][j]);
|
||
|
|
printf("%d\n",map[i][j]);
|
||
|
|
}
|
||
|
|
printf("\n");
|
||
|
|
}
|
||
|
|
else if(strcmp(s,"up")==0)
|
||
|
|
{
|
||
|
|
if(cg==0) continue;
|
||
|
|
flag=1;
|
||
|
|
xx=x-1;yy=y;
|
||
|
|
if(xx<1||xx>n||yy<1||yy>n) cg=0;
|
||
|
|
else
|
||
|
|
{
|
||
|
|
int temp;
|
||
|
|
temp=map[x][y];map[x][y]=map[xx][yy];map[xx][yy]=temp;
|
||
|
|
x=xx;y=yy;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if(strcmp(s,"left")==0)
|
||
|
|
{
|
||
|
|
if(cg==0) continue;
|
||
|
|
flag=1;
|
||
|
|
xx=x;yy=y-1;
|
||
|
|
if(xx<1||xx>n||yy<1||yy>n) cg=0;
|
||
|
|
else
|
||
|
|
{
|
||
|
|
int temp;
|
||
|
|
temp=map[x][y];map[x][y]=map[xx][yy];map[xx][yy]=temp;
|
||
|
|
x=xx;y=yy;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if(strcmp(s,"right")==0)
|
||
|
|
{
|
||
|
|
if(cg==0) continue;
|
||
|
|
flag=1;
|
||
|
|
xx=x;yy=y+1;
|
||
|
|
if(xx<1||xx>n||yy<1||yy>n) cg=0;
|
||
|
|
else
|
||
|
|
{
|
||
|
|
int temp;
|
||
|
|
temp=map[x][y];map[x][y]=map[xx][yy];map[xx][yy]=temp;
|
||
|
|
x=xx;y=yy;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if(strcmp(s,"down")==0)
|
||
|
|
{
|
||
|
|
if(cg==0) continue;
|
||
|
|
flag=1;
|
||
|
|
xx=x+1;yy=y;
|
||
|
|
if(xx<1||xx>n||yy<1||yy>n) cg=0;
|
||
|
|
else
|
||
|
|
{
|
||
|
|
int temp;
|
||
|
|
temp=map[x][y];map[x][y]=map[xx][yy];map[xx][yy]=temp;
|
||
|
|
x=xx;y=yy;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{
|
||
|
|
if(flag==1)
|
||
|
|
{
|
||
|
|
if(cg==1) printf("MOVED\n");
|
||
|
|
else printf("FAILED\n");
|
||
|
|
}
|
||
|
|
flag=0;
|
||
|
|
n=0;cg=1;
|
||
|
|
for(i=0;s[i]!='\0';i++) n=n*10+s[i]-'0';
|
||
|
|
for(i=1;i<=n;i++)
|
||
|
|
for(j=1;j<=n;j++)
|
||
|
|
{
|
||
|
|
scanf("%d",&map[i][j]);
|
||
|
|
if(map[i][j]==0) {x=i;y=j;}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if(flag==1)
|
||
|
|
{
|
||
|
|
if(cg==1) printf("MOVED\n");
|
||
|
|
else printf("FAILED\n");
|
||
|
|
}
|
||
|
|
}
|