学步园

题目连接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=13&problem=1137&mosmsg=Submission+received+with+ID+8744125

题意很简单，就是判断king有木有被攻击

可以直接模拟

我的代码：（写的又臭又长。。）

#include<stdio.h><br /> #include<string.h><br /> #include<algorithm></p> <p>using namespace std;</p> <p>struct node<br /> {<br /> int x;<br /> int y;<br /> };<br /> node k1,k2;<br /> char map[10][10];<br /> bool unat[10][10];<br /> char map1[10][10],map2[10][10];<br /> bool at1[10][10],at2[10][10];<br /> int dx[8]={1,2,-1,-2,1,2,-1,-2};<br /> int dy[8]={2,1,2,1,-2,-1,-2,-1};<br /> int n,m;</p> <p>void slove1()<br /> {<br /> int i,j,a,nx,ny;<br /> for(i=1;i<=8;i++)<br /> for(j=1;j<=8;j++)<br /> {<br /> if(map1[i][j]=='p')<br /> {<br /> at1[i+1][j-1]=true;<br /> at1[i+1][j+1]=true;<br /> }<br /> if(map1[i][j]=='r')<br /> {<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i][a+j]&&a+j<=8)<br /> at1[i][a+j]=true;<br /> else if(unat[i][a+j]==true)<br /> {<br /> at1[i][a+j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i][j-a]&&j-a>=1)<br /> at1[i][j-a]=true;<br /> else if(unat[i][j-a]==true)<br /> {<br /> at1[i][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i+a][j]&&i+a<=8)<br /> at1[i+a][j]=true;<br /> else if(unat[i+a][j]==true)<br /> {<br /> at1[i+a][j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i-a][j]&&i-a<=8)<br /> at1[i-a][j]=true;<br /> else if(unat[i-a][j]==true)<br /> {<br /> at1[i-a][j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> }<br /> if(map1[i][j]=='b')<br /> {<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i+a<=8&&j+a<=8&&!unat[i+a][j+a])<br /> at1[i+a][j+a]=true;<br /> else if(unat[i+a][j+a]==true)<br /> {<br /> at1[i+a][j+a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i+a<=8&&j-a>=1&&!unat[i+a][j-a])<br /> at1[i+a][j-a]=true;<br /> else if(unat[i+a][j-a]==true)<br /> {<br /> at1[i+a][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i-a>=1&&j+a<=8&&!unat[i-a][j+a])<br /> at1[i-a][j+a]=true;<br /> else if(unat[i-a][j+a]==true)<br /> {<br /> at1[i-a][j+a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i-a>=1&&j-a>=1&&!unat[i-a][j-a])<br /> at1[i-a][j-a]=true;<br /> else if(unat[i-a][j-a]==true)<br /> {<br /> at1[i-a][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> }<br /> if(map1[i][j]=='q')<br /> {<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i][a+j]&&a+j<=8)<br /> at1[i][a+j]=true;<br /> else if(unat[i][a+j]==true)<br /> {<br /> at1[i][a+j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i][j-a]&&j-a>=1)<br /> at1[i][j-a]=true;<br /> else if(unat[i][j-a]==true)<br /> {<br /> at1[i][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i+a][j]&&i+a<=8)<br /> at1[i+a][j]=true;<br /> else if(unat[i+a][j]==true)<br /> {<br /> at1[i+a][j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i-a][j]&&i-a<=8)<br /> at1[i-a][j]=true;<br /> else if(unat[i-a][j]==true)<br /> {<br /> at1[i-a][j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i+a<=8&&j+a<=8&&!unat[i+a][j+a])<br /> at1[i+a][j+a]=true;<br /> else if(unat[i+a][j+a]==true)<br /> {<br /> at1[i+a][j+a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i+a<=8&&j-a>=1&&!unat[i+a][j-a])<br /> at1[i+a][j-a]=true;<br /> else if(unat[i+a][j-a]==true)<br /> {<br /> at1[i+a][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i-a>=1&&j+a<=8&&!unat[i-a][j+a])<br /> at1[i-a][j+a]=true;<br /> else if(unat[i-a][j+a]==true)<br /> {<br /> at1[i-a][j+a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i-a>=1&&j-a>=1&&!unat[i-a][j-a])<br /> at1[i-a][j-a]=true;<br /> else if(unat[i-a][j-a]==true)<br /> {<br /> at1[i-a][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> }<br /> if(map1[i][j]=='k')<br /> {<br /> k1.x=i;<br /> k1.y=j;<br /> at1[i][j+1]=true;<br /> at1[i+1][j]=true;<br /> at1[i+1][j+1]=true;<br /> at1[i-1][j+1]=true;<br /> at1[i-1][j]=true;<br /> at1[i+1][j-1]=true;<br /> at1[i][j-1]=true;<br /> at1[i-1][j-1]=true;<br /> at1[i][j]=false;<br /> }<br /> if(map1[i][j]=='n')<br /> {<br /> for(a=0;a<8;a++)<br /> {<br /> nx=i+dx[a];<br /> ny=j+dy[a];<br /> if(nx>=1&&nx<=8&&ny>=1&&ny<=8)<br /> at1[nx][ny]=true;<br /> }<br /> }<br /> }<br /> }</p> <p>void slove2()<br /> {<br /> int i,j,a,nx,ny;<br /> for(i=1;i<=8;i++)<br /> for(j=1;j<=8;j++)<br /> {<br /> if(map2[i][j]=='P')<br /> {<br /> at2[i-1][j-1]=true;<br /> at2[i-1][j+1]=true;<br /> }<br /> if(map2[i][j]=='R')<br /> {<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i][a+j]&&a+j<=8)<br /> at2[i][a+j]=true;<br /> else if(unat[i][a+j]==true)<br /> {<br /> at2[i][a+j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i][j-a]&&j-a>=1)<br /> at2[i][j-a]=true;<br /> else if(unat[i][j-a]==true)<br /> {<br /> at2[i][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i+a][j]&&i+a<=8)<br /> at2[i+a][j]=true;<br /> else if(unat[i+a][j]==true)<br /> {<br /> at2[i+a][j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i-a][j]&&i-a<=8)<br /> at2[i-a][j]=true;<br /> else if(unat[i-a][j]==true)<br /> {<br /> at2[i-a][j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> }<br /> if(map2[i][j]=='B')<br /> {<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i+a<=8&&j+a<=8&&!unat[i+a][j+a])<br /> at2[i+a][j+a]=true;<br /> else if(unat[i+a][j+a]==true)<br /> {<br /> at2[i+a][j+a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i+a<=8&&j-a>=1&&!unat[i+a][j-a])<br /> at2[i+a][j-a]=true;<br /> else if(unat[i+a][j-a]==true)<br /> {<br /> at2[i+a][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i-a>=1&&j+a<=8&&!unat[i-a][j+a])<br /> at2[i-a][j+a]=true;<br /> else if(unat[i-a][j+a]==true)<br /> {<br /> at2[i-a][j+a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i-a>=1&&j-a>=1&&!unat[i-a][j-a])<br /> at2[i-a][j-a]=true;<br /> else if(unat[i-a][j-a]==true)<br /> {<br /> at2[i-a][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> }<br /> if(map2[i][j]=='Q')<br /> {<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i][a+j]&&a+j<=8)<br /> at2[i][a+j]=true;<br /> else if(unat[i][a+j]==true)<br /> {<br /> at2[i][a+j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i][j-a]&&j-a>=1)<br /> at2[i][j-a]=true;<br /> else if(unat[i][j-a]==true)<br /> {<br /> at2[i][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i+a][j]&&i+a<=8)<br /> at2[i+a][j]=true;<br /> else if(unat[i+a][j]==true)<br /> {<br /> at2[i+a][j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(!unat[i-a][j]&&i-a<=8)<br /> at2[i-a][j]=true;<br /> else if(unat[i-a][j]==true)<br /> {<br /> at2[i-a][j]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i+a<=8&&j+a<=8&&!unat[i+a][j+a])<br /> at2[i+a][j+a]=true;<br /> else if(unat[i+a][j+a]==true)<br /> {<br /> at2[i+a][j+a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i+a<=8&&j-a>=1&&!unat[i+a][j-a])<br /> at2[i+a][j-a]=true;<br /> else if(unat[i+a][j-a]==true)<br /> {<br /> at2[i+a][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i-a>=1&&j+a<=8&&!unat[i-a][j+a])<br /> at2[i-a][j+a]=true;<br /> else if(unat[i-a][j+a]==true)<br /> {<br /> at2[i-a][j+a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> for(a=1;a<=8;a++)<br /> {<br /> if(i-a>=1&&j-a>=1&&!unat[i-a][j-a])<br /> at2[i-a][j-a]=true;<br /> else if(unat[i-a][j-a]==true)<br /> {<br /> at2[i-a][j-a]=true;<br /> break;<br /> }<br /> else<br /> break;<br /> }<br /> }<br /> if(map2[i][j]=='K')<br /> {<br /> k2.x=i;<br /> k2.y=j;<br /> at2[i][j+1]=true;<br /> at2[i+1][j]=true;<br /> at2[i+1][j+1]=true;<br /> at2[i-1][j+1]=true;<br /> at2[i-1][j]=true;<br /> at2[i+1][j-1]=true;<br /> at2[i][j-1]=true;<br /> at2[i-1][j-1]=true;<br /> at2[i][j]=false;<br /> }<br /> if(map2[i][j]=='N')<br /> {<br /> for(a=0;a<8;a++)<br /> {<br /> nx=i+dx[a];<br /> ny=j+dy[a];<br /> if(nx>=1&&nx<=8&&ny>=1&&ny<=8)<br /> at2[nx][ny]=true;<br /> }<br /> }<br /> }<br /> }</p> <p>int main()<br /> {<br /> int i,j,t=1;<br /> while(true)<br /> {<br /> m=0,n=0;<br /> memset(map,'.',sizeof(map));<br /> memset(map1,'.',sizeof(map1));<br /> memset(map2,'.',sizeof(map2));<br /> memset(unat,0,sizeof(unat));<br /> memset(at1,0,sizeof(at1));<br /> memset(at2,0,sizeof(at2));<br /> for(i=1;i<=8;i++)<br /> scanf("%s",map[i]+1);<br /> for(i=1;i<=8;i++)<br /> for(j=1;j<=8;j++)<br /> {<br /> if(map[i][j]>='a'&&map[i][j]<='z')<br /> {<br /> map1[i][j]=map[i][j];<br /> unat[i][j]=true;<br /> n++;<br /> }<br /> if(map[i][j]>='A'&&map[i][j]<='Z')<br /> {<br /> map2[i][j]=map[i][j];<br /> unat[i][j]=true;<br /> m++;<br /> }<br /> }<br /> if(n==0&&m==0)<br /> break;<br /> slove1();<br /> slove2();<br /> /* printf("/n");<br /> for(i=1;i<=8;i++)<br /> {<br /> for(j=1;j<=8;j++)<br /> {<br /> if(at1[i][j])<br /> printf("1");<br /> else<br /> printf("0");<br /> }<br /> printf("/n");<br /> }<br /> printf("/n");<br /> for(i=1;i<=8;i++)<br /> {<br /> for(j=1;j<=8;j++)<br /> {<br /> if(at2[i][j])<br /> printf("1");<br /> else<br /> printf("0");<br /> }<br /> printf("/n");<br /> }<br /> // if(at1[k2.x][k2.y])<br /> // printf("white/n");<br /> // if(at2[k1.x][k1.y])<br /> // printf("black/n");*/<br /> if(at1[k2.x][k2.y]==false&&at2[k1.x][k1.y]==true)<br /> printf("Game #%d: black king is in check./n",t++);<br /> if(at1[k2.x][k2.y]==true&&at2[k1.x][k1.y]==false)<br /> printf("Game #%d: white king is in check./n",t++);<br /> if(at1[k2.x][k2.y]==false&&at2[k1.x][k1.y]==false)<br /> printf("Game #%d: no king is in check./n",t++);<br /> }<br /> return 0;<br /> }