HDU1691(模拟题) 象棋

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1691

 

题意:根据象棋的规则,给出一个棋局和接下来走的步数及每一步走法,问是否有不符合规则的走法,如果有,第一次是在第几步出现的.

 

好吧,这一题写好了,你的无AI的象棋也就差不多了~而且还不带有BUG的 :) ,想找一题过渡一下,然后就看到了模拟题中的这一道,其实思路也很容易啦,就是多写了一点儿代码,结果一直WA到不行了,重新看题,重新考虑情况,一直到两天之后的今天吧,才把它AC 掉~如果严格按照象棋的行棋规则仔细的一步步敲下来的话,也不会有我这么凄惨吧~唉,表示漏了很多情况,竟然还有变量搞错的事情~

 

上代码:

 

#include<stdio.h> #include<stdlib.h> #include<string.h> #define R 10 #define C 9 #define Red 0 #define Black 1 #define SPACE 0 #define King 1 #define Mandarin 2 #define Elephant 3 #define Knight 4 #define Rook 5 #define Cannon 6 #define Pawn 7 typedef struct chess{ int type,owner; }Chess; typedef struct { int x,y; }Point; Point k1,k2; int board[R][C]; Point from,to; int Min(int a,int b) {return a>b?b:a;} int Max(int a,int b) {return a<b?b:a;} int Abs(int a) {return a>0?a:-a;} Chess GetType(int c) { Chess ret; ret.owner=c>7?1:0; if(c>7) c-=7; ret.type=c; return ret; } bool BreakOut() { if(from.x<0||from.x>=R||to.x<0||to.x>=R) return true; if(from.y<0||from.y>=C||to.y<0||to.y>=C) return true; return false; } bool Conflict(int k) { if(board[from.x][from.y]==SPACE) return true; if(k&&board[from.x][from.y]<8 || ((!k)&&board[from.x][from.y]>7)) return true; if(k&&board[to.x][to.y]>7 || ((!k)&&board[to.x][to.y]<8 &&board[to.x][to.y]>0)) return true; return false; } bool LegalMove() { Chess cur=GetType(board[from.x][from.y]); int i,j,c; switch(cur.type){ case King: if(Abs(from.x-to.x)+Abs(from.y-to.y)!=1)return false; if(to.y<3||to.y>5) return false; if(cur.owner){ if(to.x>2) return false; } else if(to.x<7) return false; break; case Mandarin: if(Abs(from.x-to.x)!=1||Abs(from.y-to.y)!=1) return false; if(to.y<3||to.y>5) return false; if(cur.owner){ if(to.x>2) return false; } else if(to.x<7) return false; break; case Elephant: //Law if(Abs(from.x-to.x)!=2||Abs(from.y-to.y)!=2)return false; if(to.y&1)return false; //Scope if(cur.owner){ if(to.x>4) return false; if(to.x&1) return false; } else{ if(to.x<5) return false; if(!(to.x&1)) return false; } //Path if(board[(from.x+to.x)>>1][(from.y+to.y)>>1])return false; break; case Knight: if(! ( Abs(from.x-to.x)==2&&Abs(from.y-to.y)==1 || Abs(from.x-to.x)==1&&Abs(from.y-to.y)==2 ) ) return false; if(Abs(from.x-to.x)==2){ if(from.x-to.x<0){ if(board[from.x+1][from.y]) return false; } else if(board[from.x-1][from.y]) return false; } else{ if(from.y-to.y<0){ if(board[from.x][from.y+1]) return false; } else if(board[from.x][from.y-1])return false; } break; case Rook: if(Abs(from.x-to.x)&&Abs(from.y-to.y)) return false; if(from.x-to.x){/Max(from.x,to.y),WA for(i=Min(from.x,to.x)+1,j=Max(from.x,to.x);i<j;i++) if(board[i][from.y])return false; } else{ for(i=Min(from.y,to.y)+1,j=Max(from.y,to.y);i<j;i++) if(board[from.x][i]) return false; } break; case Cannon: if(Abs(from.x-to.x)&&Abs(from.y-to.y)) return false; if(from.x-to.x){ for(i=Min(from.x,to.x)+1,j=Max(from.x,to.x),c=0;i<j;i++) if(board[i][from.y]) c++; } else{ for(i=Min(from.y,to.y)+1,j=Max(from.y,to.y),c=0;i<j;i++) if(board[from.x][i]) c++; } if(c>1||(c==1&&(!board[to.x][to.y]))||(c==0&&board[to.x][to.y])) return false; break; case Pawn: if(Abs(from.x-to.x)+Abs(from.y-to.y)!=1) return false; if(cur.owner){ if(from.x>to.x) return false; if(from.x==to.x&&from.x<5) return false; } else{ if(from.x<to.x) return false; if(from.x==to.x&&from.x>4) return false; } break; } return true; } bool FaceToFace() { int i; if(k1.y==k2.y){ for(i=k2.x+1;i<k1.x&&board[i][k1.y]==0;i++); return i>=k1.x; } return false; } void Print() { int i,j; system("cls"); for(i=0;i<R;i++){ for(j=0;j<C;j++) printf("%3d",board[i][j]); puts(""); } } int main() { int t,i,j; int q,k,tt=1; bool ended; scanf("%d",&t); while(t--){ for(i=0;i<R;i++){ for(j=0;j<C;j++){ scanf("%d",&board[i][j]); if(board[i][j]==1){k1.x=i,k1.y=j;} if(board[i][j]==8){k2.x=i,k2.y=j;} } } scanf("%d%d",&q,&k); for(i=1,ended=false,j=0;i<=q;i++){ scanf("%d%d%d%d",&from.x,&from.y,&to.x,&to.y); if(j) continue; if(ended) {j=i;continue;} from.x-=1;from.y-=1;to.x-=1;to.y-=1; if(BreakOut()){ j=i; continue;} if(Conflict(k)){ j=i; continue;} if(!LegalMove()){ j=i; continue;} if(board[to.x][to.y]%7==1){ ended=true;continue;} if(board[from.x][from.y]==1){k1.x=to.x,k1.y=to.y;} else if(board[from.x][from.y]==8){k2.x=to.x,k2.y=to.y;} board[to.x][to.y]=board[from.x][from.y]; board[from.x][from.y]=0; if(FaceToFace()){j=i;continue;} k=!k; //Print(); } printf("Case %d: ",tt++); printf(!j?"Legal move":"Illegal move on step %d",j); puts(""); } return 0; } /* */