UVa1589象棋

#include<stdio.h>
#include<string.h>
#include<math.h>

int a[8][5];
char A[8];
int map[11][10];

int Check_G(int r,int c);
int Check_R(int r,int c);
int Check_H(int r,int c);
int Check_C(int r,int c);

int main(){
	int i,c,num=1;
	while(c = scanf("%d",&a[0][0])){
		getchar();
		scanf("%d%d",&a[0][1],&a[0][2]);
		if(a[0][0] == 0) break;
		getchar();
		for(i = 1;i <= a[0][0];i++){
			scanf("%c",&A[num++]);
			scanf("%d%d",&a[i][1],&a[i][2]);
			getchar();
		}
		memset(map,0,sizeof(map));
		for(i = 0;i <= a[0][0];i++)
			map[a[i][1]][a[i][2]] = 1;


		if((a[0][1] - 1) >= 1){            //将向上走
			if(Check_G(a[0][1]-1,a[0][2]) == 1) continue;
			if(Check_R(a[0][1]-1,a[0][2]) == 1) continue;
			if(Check_H(a[0][1]-1,a[0][2]) == 1) continue;
			if(Check_C(a[0][1]-1,a[0][2]) == 1) continue;
			printf("NO\n");
			continue;
		}
		if((a[0][1] + 1) <= 3){             //将向下走
			if(Check_G(a[0][1]+1,a[0][2]) == 1) continue;
			if(Check_R(a[0][1]+1,a[0][2]) == 1) continue;
			if(Check_H(a[0][1]+1,a[0][2]) == 1) continue;
			if(Check_C(a[0][1]+1,a[0][2]) == 1) continue;
			printf("NO\n");
			continue;
		}
		if((a[0][2] - 1) >= 4){             //将向左走
			if(Check_G(a[0][1],a[0][2]-1) == 1) continue;
			if(Check_R(a[0][1],a[0][2]-1) == 1) continue;
			if(Check_H(a[0][1],a[0][2]-1) == 1) continue;
			if(Check_C(a[0][1],a[0][2]-1) == 1) continue;
			printf("NO\n");
			continue;
		}
		if((a[0][2] + 1) <= 6){             //将向右走
			if(Check_G(a[0][1],a[0][2]+1) == 1) continue;
			if(Check_R(a[0][1],a[0][2]+1) == 1) continue;
			if(Check_H(a[0][1],a[0][2]+1) == 1) continue;
			if(Check_C(a[0][1],a[0][2]+1) == 1) continue;
			printf("NO\n");
			continue;
		}
	}
	return 0;
}

//帅
int Check_G(int r,int c){
	int i,j;
	for(i = 1;i <= a[0][0];i++)
		if(A[i] == 'G')
			break;
	if(a[i][2] == c){        //在同一列
		for(j=a[0][1]+1;j<a[i][1];j++)
			if(map[j][c] == 1)
				return 0;
		printf("YES\n");
		return 1;
	}
	return 0;
}

//车
int Check_R(int r,int c){
	int i,j,temp=1;
	while(temp <= a[0][0]){
		for(i = temp;i <= a[0][0];i++)
			if(A[i] == 'R')
				break;
		temp = ++i;
		if(i > a[0][0])
			return 0;
		if(a[i][1] == r){                   //同一行
			if(a[i][2] < c){   //车左将右
				for(j=a[i][2]+1;j<a[0][2];j++){
					if(map[i][j] == 1)
						break;
				}
				printf("YES\n");
				return 1;
			}
			if(a[i][2] > c){   //车右将左
				for(j=a[0][2]+1;j<a[i][2];j++){
					if(map[i][j] == 1)
						break;
				}
				printf("YES\n");
				return 1;
			}
		}
		if(a[i][2] == c){                  //同一列
			if(a[i][1]<a[0][1]){  //车上将下
				for(j=a[i][1]+1;j<a[0][1];j++){
					if(map[j][c] == 1)
						break;
				}
				printf("YES\n");
				return 1;
			}
			if(a[i][1]>a[0][1]){  //车下将上
				for(j=a[0][1]+1;j<a[i][1];j++){
					if(map[j][c] ==1)
						break;
				}
				printf("YES\n");
				return 1;
			}

		}
	}
	return 0;
}

//马
int Check_H(int r,int c){
	int i,temp=1;
	while(temp <= a[0][0]){
		for(i = temp;i <= a[0][0];i++)
			if(A[i] == 'H')
				break;
		temp = ++i;
		if(i > a[0][0])
			return 0;
		if(a[i][1] - r == 2 && abs(a[i][2] - c) == 1 && map[a[i][1]-1][a[i][2]] == 0){        //马下将上隔2行
			printf("YES\n");
			return 1;
		}
		else if(a[i][1] == 1 && abs(a[i][2] - c) == 1 && map[2][a[i][2]] == 0){               //马上将下隔2行
			printf("YES\n");
			return 1;
		}
		else if(abs(a[i][1]-r) == 1 && a[i][2]-c == -2 && map[a[i][1]][a[i][2]+1] == 0){       //马左将右隔1行       
			printf("YES\n");
			return 1;
		}
		else if(abs(a[i][1]-r) == 1 && a[i][2]-c == 2 && map[a[i][1]][a[i][2]-1] == 0){       //马右将左隔1行       
			printf("YES\n");
			return 1;
		}
		else
			continue;
	}
	return 0;
}

//炮
int Check_C(int r,int c){
	int i,j,temp=1,cont=0;
	while(temp <= a[0][0]){
		for(i = temp;i <= a[0][0];i++)
			if(A[i] == 'H')
				break;
		if(i > a[0][0])
			return 0;
		temp = ++i;
		if(a[i][1] == r){                //将和炮在同一行
			if(a[i][2] < c){
				for(j = (a[i][2]+1);j < c;j++)
					if(map[i][j] == 1)
						cont++;
				if(cont  == 1){
					printf("YES\n");
					return 1;
				}
				cont = 0;
			}
			else{
				for(j = (c+1);j < a[i][2];j++)
					if(map[i][j] == 1)
						cont++;
				if(cont == 1){
					printf("YES\n");
					return 1;
				}
				cont = 0;
			}
		}
		if(a[i][2] == c){             //将和炮在同一列
			if(a[i][1] > r){ //只可能炮在下
				for(j = (r+1);j < a[i][1];j++)
					if(map[j][a[i][2]] == 1)
						cont++;            //中间只能恰好有一个
				if(cont == 1){
					printf("YES\n");
					return 1;
				}
				cont=0;
			}
		}
	}
	return 0;
}