Xiangqi UVA - 1589

题目链接：Xiangqi UVA - 1589
题目：考虑一个象棋残局，其中红方有$n（2<=n<=7）$个棋子，黑方只有一个将，红方除了有一个帅（G）之外还有3种可能的棋子：车（R），马（H），炮（C），并且需要考虑“bie马腿”与将和帅不能照面的规则。
输入所有棋子所在位置，保证局面合法并且红方已经将军。你的任务是判断红方是否已经将黑方将死。

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<iomanip>
#define ll long long

using namespace std;

int n,x,y,a,b;
int xq[11][10];
struct qz{
    char z;
    int x,y;
}s[10];

bool GG(int a1, int b1) {
    if(b1 == b) {
        for(int i = a - 1; i > a1; i--) if(xq[i][b] != 0) return false;
        return true;
    }
    return false;
}

bool RG(int a1, int b1,int a2, int b2){
    if(a1 == a2) {
        int y1 = b1,y2 = b2;
        if(y1>y2) swap(y1,y2);
        for(int i = y1 + 1; i < y2; i++) if(xq[a1][i] != 0) return false;
        return true;
    }
    if(b1 == b2){
        int x1 = a1,x2 = a2;
        if(x1>x2) swap(x1,x2);
        for(int i = x1 + 1; i < x2; i++) if(xq[i][b1] != 0) return false;
        return true;
    }
    return false;
}

bool CG(int a1, int b1,int a2, int b2){
    if(a1 == a2) {
        int y1 = b1,y2 = b2;
        if(y1>y2) swap(y1,y2);
        for(int i = y1+1; i < y2; i++) if(xq[a1][i] != 0) return true;
        return false;
    }
    if(b1 == b2){
        int x1 = a1,x2 = a2;
        if(x1>x2) swap(x1,x2);
        for(int i = x1+1; i < x2; i++) if(xq[i][b1] != 0) return true;
        return false;
    }
    return false;
}

bool HG(int a1, int b1,int a2, int b2){
    if((a1 == (a2 - 2)&&b1 == (b2 - 1))||((a1 == (a2 - 2)&&b1 == (b2 + 1)))) {
        if(xq[a2 - 1][b2] == 0) return true;
    }
    if((a1 == (a2 + 2)&&b1 == (b2 - 1))||((a1 == (a2 + 2)&&b1 == (b2 + 1)))) {
        if(xq[a2 + 1][b2] == 0) return true;
    }
    if((a1 == (a2 - 1)&&b1 == (b2 - 2))||((a1 == (a2 + 1)&&b1 == (b2 - 2)))) {
        if(xq[a2][b2 - 1] == 0) return true;
    }
    if((a1 == (a2 - 1)&&b1 == (b2 + 2))||((a1 == (a2 + 1)&&b1 == (b2 + 2)))) {
        if(xq[a2][b2 + 1] == 0) return true;
    }
    return false;
}
bool G(int a1,int b1) {
    if(a1<1||a1>3||b1<4||b1>6) return true;
    for(int i = 0; i < n; i++){
        if(s[i].x == a1&s[i].y == b1) continue;
        if(s[i].z == 'G'){
            if(GG(a1,b1)) return true;
        } else if(s[i].z == 'R'){
            if(RG(a1, b1, s[i].x, s[i].y)) return true;
        } else if(s[i].z == 'H'){
            if(HG(a1, b1, s[i].x, s[i].y)) return true;
        } else if(s[i].z == 'C') {
            if(CG(a1, b1, s[i].x, s[i].y)) return true;
        }
    }
    return false;
}


int main(){

    while(1) {
        scanf("%d%d%d", &n, &x, &y);
        if(n == 0) break;
        memset(xq, 0, sizeof(xq));
        for(int i = 0; i < n; i++) {
            getchar();
            scanf("%c%d%d", &s[i].z, &s[i].x, &s[i].y);
            xq[(s[i].x)][(s[i].y)] = s[i].z;
            if(s[i].z == 'G') { a = s[i].x; b = s[i].y; }
        }
        //cout << G(x,y-1)<<G(x,y+1)<<G(x-1,y)<<G(x+1,y) << endl;
        if(G(x,y-1)&&G(x,y+1)&&G(x-1,y)&&G(x+1,y)) puts("YES");
        else puts("NO");
    }
    return 0;
}