UVA - 1589 Xiangqi(模拟)

点击打开题目链接
题目大意：
考虑一个象棋残局，红方有n个棋子，黑方只有一个将。红方除了一个帅(G)外还有三种可能的棋子：车®，马(H)，炮©，并且需要考虑“蹩马腿”与将帅不能照面的规则。
输入所有的棋子位置，保证局面合法并且红方已经将军。判断红方是否已经把黑方将死。
思路：
遍历黑将能走的所有点，判断是不是在红子攻击范围，边界情况(黑将走一步可能吃掉红子)覆盖处理。
代码:

#include<bits/stdc++.h>

using namespace std;
int N, gx, gy, rg;
int mp[15][15];
int dx[] = {0,1,0,-1}, dy[] = {1,0,-1,0};  
int h[8][4] = {{1,2,0,2}, {1,-2,0,-2}, {2,1,2,0}, {2,-1,2,0}, {-1,2,0,2}, {-1,-2,0,-2}, {-2,1,-2,0}, {-2,-1,-2,0} };

struct Pieces {
    int x, y;
    char type;
}Red[10];

int numOfBlock(int x1, int y1, int x2, int y2) {
    if(x1 != x2 && y1 != y2) return -1;
    int cnt = 0;
    if(x1 == x2) {
        if(y1 > y2) swap(y1, y2);
        for(int i = y1+1; i <= y2-1; i++) {
            if(mp[x1][i]) cnt++;
        }
    }
    else if(y1 == y2) {
        if(x1 > x2) swap(x1, x2);
        for(int i = x1+1; i <= x2-1; i++) {
            if(mp[i][y1]) cnt++;
        }
    }
    return cnt;
}

int isInSpace(int x, int y) {
    return x >= 1 && x <= 3 && y >= 4 && y <= 6;
}

int G(int x1, int y1, int x2, int y2) {
    return numOfBlock(x1, y1, x2, y2) == 0;
}

int H(int x1, int y1, int x2, int y2) {
    for(int i = 0; i < 8; i++) {
        int nx = x1 + h[i][0], ny = y1 + h[i][1];
        if(numOfBlock(x1, y1, x1 + h[i][2], y1 + h[i][3]) == 0 && nx == x2 && ny == y2) return 1;
    }
    return 0;
}

int C(int x1, int y1, int x2, int y2) {
    return numOfBlock(x1, y1, x2, y2) == 1;
}

int isRedCheck(int x, int y) {
    for(int i = 0; i < N; i++) {
        if(!(Red[i].x == x && Red[i].y == y)) {
            if((Red[i].type == 'G' || Red[i].type == 'R')&& G(Red[i].x, Red[i].y, x, y)) return 1;
            if(Red[i].type == 'H' && H(Red[i].x, Red[i].y, x, y)) return 1;
            if(Red[i].type == 'C' && C(Red[i].x, Red[i].y, x, y)) return 1;
        }
    }
    return 0;
}

int main() {
    ios::sync_with_stdio(false);
    while(cin >> N >> gx >> gy, N) {
        memset(mp, 0, sizeof(mp));
        memset(Red, 0, sizeof(Red));
        for(int i = 0; i < N; i++) {
            cin >> Red[i].type >> Red[i].x >> Red[i].y;
            mp[Red[i].x][Red[i].y] = 1;
            if(Red[i].type == 'G') rg = i;
        }
        int isRedWin = 1;
        if(G(gx, gy, Red[rg].x, Red[rg].x))
            isRedWin = 0;
        else {
            for(int i = 0; i < 4; i++) {
                int nx = gx + dx[i], ny = gy + dy[i];
                if(isInSpace(nx, ny) && !isRedCheck(nx, ny)) {
                    isRedWin = 0;
                    break;
                }
            }
        }
        if(isRedWin == 0) cout << "NO" << endl;
        else cout << "YES" << endl;
    }
}