象:在同一斜线上,一步可以到达,不在同一斜线上,如果两点颜色相同两步可达,否则不可达;
#include<cstdio>
#include<string.h>
#include<algorithm>
#include<vector>
#include<stdlib.h>
#include<cmath>
#include<queue>
#include<set>
#include<cmath>
#include<list>
using namespace std;
const int N=100015;
bool map[9][9];
int main()
{
bool flag=0;
for(int i=1;i<=8;i++)
{ if(i&1)
flag=0;
else
flag=1;
for(int j=1;j<=8;j++)
{
map[i][j]=flag;
flag=!flag;
}
}
int t;
scanf("%d",&t);
while(t--)
{
char str[3],op[3];
scanf("%s%s",str,op);
int x1=str[0]-'a'+1,y1=str[1]-'0',x2=op[0]-'a'+1,y2=op[1]-'0';
if(x1==x2&&y1==y2)
{
printf("0 0 0 0\n");
continue;
}
else
{
if(x1==x2)
{
printf("%d %d %d",abs(y1-y2),1,1);
if(map[x1][y1]==map[x2][y2])
printf(" 2\n");
else
printf(" Inf\n");
continue;
}
else if(y1==y2)
{
printf("%d %d %d",abs(x1-x2),1,1);
if(map[x1][y1]!=map[x2][y2])
{
printf(" Inf\n");
}
else
printf(" %d\n",2);
continue;
}
else
{
int nn=abs(y1-y2)/abs(x1-x2);
printf("%d ",max(abs(y1-y2),abs(x1-x2)));
if(nn==1)
{
printf("%d %d %d\n",1,2,1);
}
else
{
printf("2 2");
if(map[x1][y1]==map[x2][y2])
{
printf(" 2\n");
}
else
printf(" Inf\n");
}
}
}
}
return 0;
}