HPU 1206 Diamond 【水题】

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#define INF 0x3f3f3f3f
using namespace std;
char map[10][10];
int judge(int r,int c)
{
int i=1,j=1,s=1,t=1;
while(r-i>=0&&map[r-i][c]==map[r][c])
i++,s++;
i=1;
while(r+i<=8&&map[r+i][c]==map[r][c])
i++,s++;
if(s>=3)
return 1;
while(c-j>=0&&map[r][c-j]==map[r][c])
j++,t++;
j=1;
while(c+j<=8&&map[r][c+j]==map[r][c])
j++,t++;
if(t>=3)
return 1;
return 0;
}
int main()
{
int r1,c1,r2,c2;
while(~scanf("%s",map[1]))
{
for(int i=2;i<=8;++i)
scanf("%s",map[i]);
scanf("%d%d%d%d",&r1,&c1,&r2,&c2);
if(sqrt((r1-r2)*(r1-r2)+(c1-c2)*(c1-c2))>1)
{
printf("Illegal move!\n");
continue;
}
c1-=1,c2-=1;
char tem=map[r1][c1];
map[r1][c1]=map[r2][c2];
map[r2][c2]=tem;
//printf("%d %d\n",judge(r1,c1),judge(r2,c2));
if(judge(r1,c1)||judge(r2,c2))
printf("Ok!\n");
else
printf("Illegal move!\n");
}
return 0;
}