1589 - Xiangqi

最新推荐文章于 2025-04-28 16:22:09 发布

gaoxiangnumber1

最新推荐文章于 2025-04-28 16:22:09 发布

阅读量452

点赞数

文章标签： less database 调试二维数组移动

本文链接：https://blog.csdn.net/gaoxiangnumber1/article/details/43878413

版权

Xiangqi is one of the most popular two-playerboard games in China. The game represents a battle between two armies with thegoal of capturing the enemy's ``general" piece. In this problem, you aregiven a situation of later stage in the game. Besides, the red side has already``delivered a check". Your work is to check whether the situationis ``checkmate".

Now we introduce some basic rules of Xiangqi.Xiangqi is played on a 10 x 9 board and the pieces areplaced on the intersections (points). The top left point is (1,1) and thebottom right point is (10,9). There are two groups of pieces marked by black orred Chinese characters, belonging to the two players separately. During thegame, each player in turn moves one piece from the point it occupies to anotherpoint. No two pieces can occupy the same point at the same time. A piece can bemoved onto a point occupied by an enemy piece, in which case the enemy pieceis``captured" and removed from the board. When the general is in danger ofbeing captured by the enemy player on the enemy player's next move, the enemyplayer is said to have ``delivered a check". If the general'splayer can make no move to prevent the general's capture by next enemy move,the situation is called ``checkmate".

We only use 4 kinds of pieces introducing as follows:

General: the generals can move and capture one point eithervertically or horizontally and cannot leave the ``palace" unlessthe situation called ``flying general" (see the figure above).``Flying general" means that one general can ``fly" across the boardto capture the enemy general if they stand on the same line without interveningpieces.

Chariot: the chariots can move and capture vertically and horizontally byany distance, but may not jump over intervening pieces

Cannon: the cannons move like the chariots, horizontally and vertically,but capture by jumping exactly one piece (whether it isfriendly or enemy) over to its target.

Horse: the horses have 8 kinds of jumps to move and capture shown in theleft figure. However, if there is any pieces lying on a point away from thehorse horizontally or vertically it cannot move or capture in that direction(see the figure below), which is called ``hobbling the horse's leg".

Now you are given a situation only containinga black general, a red general and several red chariots, cannons and horses,and the red side has delivered a check. Now it turns to black side's move. Yourjob is to determine that whether this situation is ``checkmate".

Input

The input contains no more than 40 testcases. For each test case, the first line contains three integers representingthe number of red pieces N ( 2N7) and the position of theblack general. The following N lines contain details of N redpieces. For each line, there are a char and two integers representing the typeand position of the piece (type char `G' for general, `R' for chariot, `H' forhorse and `C' for cannon). We guarantee that the situation is legal and the redside has delivered the check.

There is a blank line between two test cases.The input ends by `0 0 0'.

Output

For each test case, if the situation ischeckmate, output a single word `YES', otherwise output the word `NO'.

Hint: In the first situation, the black general is checked by chariot and``flying general''. In the second situation, the black general can move to (1,4) or (1, 6) to stop check. See the figure below.

Sample Input

2 1 4

G 10 5

R 6 4

3 1 5

H 4 5

G 10 5

C 7 5

0 0 0

Sample Output

YES

参考答案:

构造一个Xiangqi类来求解。首先黑子会动很麻烦，因此要把动态问题改成静态.如果题目只是给你一个局面，问你当前红方动，能不能把黑方吃掉是不是简单多了？所以要生成一个Xiangqi对象A，按input数据初始化。然后只要黑将不跟红帅面对面直接吃掉，他至多有四种移动方案，用A来生成黑将移动后的Xiangqi对象B。如上，B是一个静态问题。那么现在关键是Xiangqi类的书写，棋盘存到二维数组board中不做修改红帅和黑将是棋盘的核心，所以要定义ax,ay,bx,by存储它们所在的坐标，坐标也从1开始编号，不容易混乱思路，而且留有边界board[0]，一些操作也会很方便。车、将、炮吃子的本质是相同的。都是要在同一横线或竖线，但中间隔的棋子一种是0个，一种是1个。这种操作可以定义一个基础函数Cnt，可以计算(x,y)与黑将是否在同一横线或竖线，不满足则返回-1。否则返回两坐标间隔的棋子数。注意这里的技巧，不是计算任意两点，而是任意一点到黑将，因为所有的子都是围绕黑将展开的，都是要去吃它。这样就能简化函数节省代码量。马的吃子看似麻烦，其实符合很特别的数量规律。记其行列偏移量分别为dx和dy，有没注意到dx*dy的绝对值一定是2？“蹩马腿”的技巧也是一样，详见函数H的代码。

#include<algorithm>

#include<cmath>

#include<cstdio>

#include<cstring>

#include<iostream>

using namespacestd;

struct Xiangqi

{

int board[11][10];

int ax, ay, bx, by; // a是红方的帅,b是黑方的将; x,y是坐标

// 构造函数遵循题目的输入格式

Xiangqi(int n, int _bx, int _by): bx(_bx),by(_by)