Xiangqi

Time Limit: 20 Sec

Memory Limit: 256 MB

题目连接

http://acm.hdu.edu.cn/showproblem.php?pid=4121

Description

Xiangqi is one of the most popular two-player board games in China. The game represents a battle between two armies with the goal of capturing the enemy’s “general” piece. In this problem, you are given a situation of later stage in the game. Besides, the red side has already “delivered a check”. Your work is to check whether the situation is “checkmate”.

Now
we introduce some basic rules of Xiangqi. Xiangqi is played on a 10×9
board and the pieces are placed on the intersections (points). The top
left point is (1,1) and the bottom right point is (10,9). There are two
groups of pieces marked by black or red Chinese characters, belonging to
the two players separately. During the game, each player in turn moves
one piece from the point it occupies to another point. No two pieces can
occupy the same point at the same time. A piece can be moved onto a
point occupied by an enemy piece, in which case the enemy piece is
"captured" and removed from the board. When the general is in danger of
being captured by the enemy player on the enemy player’s next move, the
enemy player is said to have "delivered a check". If the general's player 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 either vertically or horizontally and cannot leave the “palace” unless the situation called “flying general
(see the figure above). “Flying general” means that one general can
“fly” across the board to capture the enemy general if they stand on the
same line without intervening pieces.
Chariot: the chariots can move and capture vertically and horizontally by any 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 is friendly or enemy) over to its target.
Horse:
the horses have 8 kinds of jumps to move and capture shown in the left
figure. However, if there is any pieces lying on a point away from the
horse 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 containing a 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. Your job is to
determine that whether this situation is “checkmate”.

Input

The input contains no more than 40 test cases. For each test case, the first line contains three integers representing the number of red pieces N (2<=N<=7) and the position of the black general. The following n lines contain details of N red pieces. For each line, there are a char and two integers representing the type and position of the piece (type char ‘G’ for general, ‘R’ for chariot, ‘H’ for horse and ‘C’ for cannon). We guarantee that the situation is legal and the red side 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 is checkmate, output a single word ‘YES’, otherwise output the word ‘NO’.

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
NO

HINT

题意

给你一个象棋残局,黑方只剩下一个王了。现在该王走了,是否王怎么走都会死了?

题解:

1.黑方王在走的时候,可以踩死红方棋子

2.马会被蹩脚

然后没有什么坑点了,暴力模拟就好了……

代码

#include<iostream>
#include<stdio.h>
#include<vector>
#include<cstring>
using namespace std; int n,x,y;
vector<pair<int,int> >P;
vector<pair<int,int> >H;
vector<pair<int,int> >C;
vector<pair<int,int> >G;
int dx[]={,-,,};
int dy[]={,,,-};
int vis[][];
void init()
{
P.clear();
H.clear();
C.clear();
G.clear();
memset(vis,,sizeof(vis));
}
int check(int xx,int yy)
{
//cout<<xx<<" "<<yy<<endl;
if(xx<||xx>)return ;
if(yy<||yy>)return ; for(int i=;i<C.size();i++)
{
int xxx = C[i].first, yyy = C[i].second;
if(xxx == xx && yyy == yy)
continue;
while(xxx<=)
{
xxx++;
if(xxx == xx && yyy == yy)
return ;
if(vis[xxx][yyy])
break;
}
xxx = C[i].first, yyy = C[i].second;
while(xxx)
{
xxx--;
if(xxx == xx && yyy == yy)
return ;
if(vis[xxx][yyy])
break;
}
xxx = C[i].first, yyy = C[i].second;
while(yyy<=)
{
yyy++;
if(xxx == xx && yyy == yy)
return ;
if(vis[xxx][yyy])
break;
}
xxx = C[i].first, yyy = C[i].second;
while(yyy)
{
yyy--;
if(xxx == xx && yyy == yy)
return ;
if(vis[xxx][yyy])
break;
}
}
//cout<<xx<<" "<<yy<<endl;
for(int i=;i<H.size();i++)
{
int xxx = H[i].first , yyy = H[i].second;
if(xxx == xx && yyy == yy)
continue;
if(xxx != && vis[xxx-][yyy]==)
{
if(xx == xxx - && yy == yyy + )
return ;
if(xx == xxx - && yy == yyy - )
return ;
}
if(xxx != && vis[xxx+][yyy]==)
{
if(xx == xxx + && yy == yyy + )
return ;
if(xx == xxx + && yy == yyy - )
return ;
}
if(yyy != && vis[xxx][yyy-]==)
{
if(xx == xxx + && yy == yyy - )
return ;
if(xx == xxx - && yy == yyy - )
return ;
}
if(yyy != && vis[xxx][yyy+]==)
{
if(xx == xxx + && yy == yyy + )
return ;
if(xx == xxx - && yy == yyy + )
return ;
}
}
//cout<<xx<<" "<<yy<<endl;
for(int i=;i<P.size();i++)
{
int xxx = P[i].first,yyy = P[i].second;
if(xxx == xx && yyy == yy)
continue;
int flag = ;
while(xxx<=)
{
xxx++;
if(xxx == xx && yyy == yy && flag == )
return ;
if(vis[xxx][yyy])
flag++;
}
xxx = P[i].first, yyy = P[i].second,flag = ;
while(xxx)
{
xxx--;
if(xxx == xx && yyy == yy && flag == )
return ;
if(vis[xxx][yyy])
flag++;
}
xxx = P[i].first, yyy = P[i].second,flag = ;
while(yyy<=)
{
yyy++;
if(xxx == xx && yyy == yy && flag == )
return ;
if(vis[xxx][yyy])
flag++;
}
xxx = P[i].first, yyy = P[i].second,flag = ;
while(yyy)
{
yyy--;
if(xxx == xx && yyy == yy && flag == )
return ;
if(vis[xxx][yyy])
flag++;
}
} for(int i=;i<G.size();i++)
{
int xxx = G[i].first, yyy = G[i].second;
if(xxx == xx && yyy == yy)
continue;
while(xxx<=)
{
xxx++;
if(xxx == xx && yyy == yy)
return ;
if(vis[xxx][yyy])
break;
}
xxx = G[i].first, yyy = G[i].second;
while(xxx)
{
xxx--;
if(xxx == xx && yyy == yy)
return ;
if(vis[xxx][yyy])
break;
}
xxx = G[i].first, yyy = G[i].second;
while(yyy<=)
{
yyy++;
if(xxx == xx && yyy == yy)
return ;
if(vis[xxx][yyy])
break;
}
xxx = G[i].first, yyy = G[i].second;
while(yyy)
{
yyy--;
if(xxx == xx && yyy == yy)
return ;
if(vis[xxx][yyy])
break;
}
}
//cout<<xx<<" "<<yy<<endl;
return ;
}
int main()
{
while(scanf("%d%d%d",&n,&x,&y)!=EOF)
{
if(n== && x == && y == )
break;
init();
string cc;int xx,yy;
for(int i=;i<n;i++)
{
cin>>cc;
scanf("%d %d",&xx,&yy);
if(cc[]=='G')
G.push_back(make_pair(xx,yy));
if(cc[]=='R')
C.push_back(make_pair(xx,yy));
if(cc[]=='H')
H.push_back(make_pair(xx,yy));
if(cc[]=='C')
P.push_back(make_pair(xx,yy));
vis[xx][yy]++;
} xx = x,yy = y;
int flag2 = ;
for(int i=;i<G.size();i++)
{
int xxx = G[i].first, yyy = G[i].second;
if(xxx == xx && yyy == yy)
continue;
while(xxx<=)
{
xxx++;
if(xxx == xx && yyy == yy)
flag2 = ;
if(vis[xxx][yyy])
break;
}
xxx = G[i].first, yyy = G[i].second;
while(xxx)
{
xxx--;
if(xxx == xx && yyy == yy)
flag2 = ;
if(vis[xxx][yyy])
break;
}
xxx = G[i].first, yyy = G[i].second;
while(yyy<=)
{
yyy++;
if(xxx == xx && yyy == yy)
flag2 = ;
if(vis[xxx][yyy])
break;
}
xxx = G[i].first, yyy = G[i].second;
while(yyy)
{
yyy--;
if(xxx == xx && yyy == yy)
flag2 = ;
if(vis[xxx][yyy])
break;
}
}
if(flag2)
{
printf("NO\n");
continue;
}
int flag = ;
for(int i=;i<;i++)
{
xx = x + dx[i];
yy = y + dy[i];
vis[xx][yy]++;
if(!check(xx,yy))
flag ++;
vis[xx][yy]--;
}
if(flag == )
printf("YES\n");
else
printf("NO\n");
}
}

HDU 4121 Xiangqi 模拟题的更多相关文章

  1. HDU 4121 Xiangqi --模拟

    题意: 给一个象棋局势,问黑棋是否死棋了,黑棋只有一个将,红棋可能有2~7个棋,分别可能是车,马,炮以及帅. 解法: 开始写法是对每个棋子,都处理处他能吃的地方,赋为-1,然后判断将能不能走到非-1的 ...

  2. HDU 4121 Xiangqi (算是模拟吧)

    传送门:http://acm.hdu.edu.cn/showproblem.php?pid=4121 题意:中国象棋对决,黑棋只有一个将,红棋有一个帅和不定个车 马 炮冰给定位置,这时当黑棋走,问你黑 ...

  3. HDU 4121 Xiangqi

    模拟吧,算是... 被这个题wa到哭,真是什么都不想说了...上代码 #include <iostream> #include <cstring> using namespac ...

  4. HDU 4121 Xiangqi 我老了?

    Xiangqi Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Sub ...

  5. HDU 4431 Mahjong(模拟题)

    题目链接 写了俩小时+把....有一种情况写的时候漏了...代码还算清晰把,想了很久才开写的. #include <cstdio> #include <cstring> #in ...

  6. HDU 1234 简单模拟题

    题目很简单不多说了,我只是觉得这题目的输入方式还是很有特点的 #include <cstdio> #include <cstring> #include <algorit ...

  7. HDU 4041 Eliminate Witches! (模拟题 ACM ICPC 2011亚洲北京赛区网络赛)

    HDU 4041 Eliminate Witches! (模拟题 ACM ICPC 2011 亚洲北京赛区网络赛题目) Eliminate Witches! Time Limit: 2000/1000 ...

  8. HDU 4452 Running Rabbits (模拟题)

    题意: 有两只兔子,一只在左上角,一只在右上角,两只兔子有自己的移动速度(每小时),和初始移动方向. 现在有3种可能让他们转向:撞墙:移动过程中撞墙,掉头走未完成的路. 相碰: 两只兔子在K点整(即处 ...

  9. hdu 5641 King's Phone(暴力模拟题)

    Problem Description In a military parade, the King sees lots of new things, including an Andriod Pho ...

随机推荐

  1. hdu 1175(广搜)

    题意:容易理解... 思路:我开始的思路不好实现,而且有漏洞,时间复杂度也高,后来在网上学了下别人的方法,真心感觉很牛B,不仅代码好实现,而且时间复杂度比较低,具体看代码实现吧!! 代码实现: #in ...

  2. MySQL数据库分布式事务XA优缺点与改进方案

    1 MySQL 外部XA分析 1.1 作用分析 MySQL数据库外部XA可以用在分布式数据库代理层,实现对MySQL数据库的分布式事务支持,例如开源的代理工具:ameoba[4],网易的DDB,淘宝的 ...

  3. POJ 1195- Mobile phones(二维BIT)

    题意: 矩阵上的单点更新,范围求和 #include <map> #include <set> #include <list> #include <cmath ...

  4. XTUOJ 1248 TC or CF 搜索

    这个题一眼看上去不会 然后有人说是网络流 然后我就想怎么建图啊,然后不会(是本蒟蒻太垃圾了),肯定有网络流解法 然后去群里问了gdut的巨巨,他说他队友爆搜+剪枝过了(我也是非常的叹服) 然后我也写了 ...

  5. 【和我一起学python吧】初学Python,版本如何选择?

    早在四年多以前,在我进入英才网之前,去面试过一家海归创业的公司.他们需要的是有unix开发经验的技术人员,但是因为他们当时所处的阶段对很多成熟 技术人员不是很吸引,所以条件放宽为熟悉面向对象的程序开发 ...

  6. VS中使用QT调用R脚本

    一开始想直接把R编译成库然后调用R,后来查了n多资料,发现VS中是无法办到的,官方也给出了一句话,大概意思就是没可能在VS中使用R提供的C++接口,大概是涉及到了底层的ABI的原因,具体也不太清楚. ...

  7. 某酒店2000W数据

    某酒店2000W数据 2000万开房信息 [某酒店2000w数据 ct2000(解压密码:sjisauisa是就数据8很舒适好sjjss).rar] 国内安全漏洞监测平台乌云(WooYun.org)近 ...

  8. bzoj 2049 [Sdoi2008]Cave 洞穴勘测(LCT)

    [题目链接] http://www.lydsy.com/JudgeOnline/problem.php?id=2049 [题意] 给定森林,可能有连边或断边的操作,回答若干个连通性的询问. [思路] ...

  9. 十字链表 Codeforces Round #367 E Working routine

    // 十字链表 Codeforces Round #367 E Working routine // 题意:给你一个矩阵,q次询问,每次交换两个子矩阵,问最后的矩阵 // 思路:暴力肯定不行.我们可以 ...

  10. zabbix统一脚本监控方式

    几周的zabbix使用之后几点心得,暂时记在这儿 简单命令监控,直接配置Userparameter参数,以应用来分类conf文件,将不同应用的配置写在不同的conf文件里,并将之放到统一的配置引入目录 ...