Codeforces Round #379 (Div. 2) D. Anton and Chess —— 基础题
题目链接:http://codeforces.com/contest/734/problem/D
4 seconds
256 megabytes
standard input
standard output
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board
to too simple, he uses an infinite one instead.
The first task he faced is to check whether the king is in check. Anton doesn't know how to implement this so he asks you to help.
Consider that an infinite chess board contains one white king and the number of black pieces. There are only rooks, bishops and queens, as the other pieces are not supported yet. The white king is said to be in check if at least one black piece can reach the
cell with the king in one move.
Help Anton and write the program that for the given position determines whether the white king is in check.
Remainder, on how do chess pieces move:
- Bishop moves any number of cells diagonally, but it can't "leap" over the occupied cells.
- Rook moves any number of cells horizontally or vertically, but it also can't "leap" over the occupied cells.
- Queen is able to move any number of cells horizontally, vertically or diagonally, but it also can't "leap".
The first line of the input contains a single integer n (1 ≤ n ≤ 500 000) —
the number of black pieces.
The second line contains two integers x0 and y0 ( - 109 ≤ x0, y0 ≤ 109) —
coordinates of the white king.
Then follow n lines, each of them contains a character and two integers xi and yi ( - 109 ≤ xi, yi ≤ 109) —
type of the i-th piece and its position. Character 'B'
stands for the bishop, 'R' for the rook and 'Q' for the
queen. It's guaranteed that no two pieces occupy the same position.
The only line of the output should contains "YES" (without quotes) if the white king is in check and "NO"
(without quotes) otherwise.
2
4 2
R 1 1
B 1 5
YES
2
4 2
R 3 3
B 1 5
NO
Picture for the first sample:
White king is in check, because the black bishop can reach the cell with the white king in one move. The answer is "YES".
Picture for the second sample:
Here bishop can't reach the cell with the white king, because his path is blocked by the rook, and the bishop cant "leap" over it. Rook can't reach the white king, because it can't move diagonally. Hence, the king is not in check and the answer is "NO"
题解:
1.在King的八个方向上,分别记录离其最近的棋子。
2.如果在横、竖线上,存在Rook或者Queen,则King in check; 如果在对角线上,存在Bishop或者Queen, 则King in check。
学习之处:
对角线的表示:
1.左上右下: x-y (注意:如果需要用非负数表示,则x-y+n)
2.右上左下:x+y
代码如下;
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const double eps = 1e-6;
const int INF = 2e9;
const LL LNF = 9e18;
const int mod = 1e9+7;
const int maxn = 1e5+10; int n, xo, yo;
int a[10][5];
map<string, int>m; void f(int x, int y, int id) //分别在八个方向上取最近的棋
{
if(x==xo)
{
if(y<yo && (a[1][1]==INF || y>a[1][2]) )
a[1][1] = x, a[1][2] = y, a[1][3] = id;
if(y>yo && ( a[2][1]==INF || y<a[2][2]) )
a[2][1] = x, a[2][2] = y, a[2][3] = id;
}
else if(y==yo)
{
if(x<xo && ( a[3][1]==INF || x>a[3][1] ) )
a[3][1] = x, a[3][2] = y, a[3][3] = id;
if(x>xo && ( a[4][1]==INF || x<a[4][1]) )
a[4][1] = x, a[4][2] = y, a[4][3] = id;
}
else if(x-y==xo-yo)
{
if(x<xo && ( a[5][1]==INF || x>a[5][1]) )
a[5][1] = x, a[5][2] = y, a[5][3] = id;
if(x>xo && ( a[6][1]==INF || x<a[6][1]) )
a[6][1] = x, a[6][2] = y, a[6][3] = id;
}
else if(x+y==xo+yo)
{
if(x>xo && ( a[7][1]==INF || x<a[7][1]) )
a[7][1] = x, a[7][2] = y, a[7][3] = id;
if(x<xo && ( a[8][1]==INF || x>a[8][1]) )
a[8][1] = x, a[8][2] = y, a[8][3] = id;
}
} int main()
{
scanf("%d%d%d",&n,&xo, &yo); m["B"] = 1; m["R"] = 2; m["Q"] = 3;
for(int i = 0; i<10; i++)
a[i][1] = INF; string s; int x, y;
for(int i = 1; i<=n; i++)
{
cin>>s>>x>>y;
f(x, y, m[s]);
} int B = 0;
for(int i = 1; i<=4; i++) //横、竖
if(a[i][1]!=INF && ( a[i][3]==2 || a[i][3]==3))
B = 1;
for(int i = 5; i<=8; i++) //对角线
if(a[i][1]!=INF && ( a[i][3]==1 || a[i][3]==3))
B = 1;
printf("%s\n", B? "YES" : "NO");
}
Codeforces Round #379 (Div. 2) D. Anton and Chess —— 基础题的更多相关文章
- Codeforces Round #379 (Div. 2) D. Anton and Chess 水题
D. Anton and Chess 题目连接: http://codeforces.com/contest/734/problem/D Description Anton likes to play ...
- Codeforces Round #379 (Div. 2) D. Anton and Chess 模拟
题目链接: http://codeforces.com/contest/734/problem/D D. Anton and Chess time limit per test4 secondsmem ...
- Codeforces Round #379 (Div. 2) B. Anton and Digits 水题
B. Anton and Digits 题目连接: http://codeforces.com/contest/734/problem/B Description Recently Anton fou ...
- Codeforces Round #379 (Div. 2) A. Anton and Danik 水题
A. Anton and Danik 题目连接: http://codeforces.com/contest/734/problem/A Description Anton likes to play ...
- Codeforces Round #379 (Div. 2) E. Anton and Tree 缩点 直径
E. Anton and Tree 题目连接: http://codeforces.com/contest/734/problem/E Description Anton is growing a t ...
- Codeforces Round #379 (Div. 2) C. Anton and Making Potions 枚举+二分
C. Anton and Making Potions 题目连接: http://codeforces.com/contest/734/problem/C Description Anton is p ...
- Codeforces Round #379 (Div. 2) E. Anton and Tree —— 缩点 + 树上最长路
题目链接:http://codeforces.com/contest/734/problem/E E. Anton and Tree time limit per test 3 seconds mem ...
- Codeforces Round #379 (Div. 2) C. Anton and Making Potions —— 二分
题目链接:http://codeforces.com/contest/734/problem/C C. Anton and Making Potions time limit per test 4 s ...
- Codeforces Round #379 (Div. 2) E. Anton and Tree 树的直径
E. Anton and Tree time limit per test 3 seconds memory limit per test 256 megabytes input standard i ...
随机推荐
- P1136 超车 归并排序 求逆序对个数
这道题从看到它开始到做出来,已经过了快两周[因为第一次思路完全跑偏写的是暴力模拟想水过]: 题意是这样的: jzabc除了对多米诺骨牌感兴趣外,对赛车也很感兴趣.上个周末他观看了一场赛车比赛.他总是 ...
- mac os安装jdk、卸载
1.JAVA版本8u171与8u172的区别 https://blog.csdn.net/u014653815/article/details/80435226 奇数版本是稳定版本,上面修订的所有 ...
- C++静态库与动态库深入研究
什么是库 库是写好的现有的,成熟的,可以复用的代码.现实中每个程序都要依赖很多基础的底层库,不可能每个人的代码都从零开始,因此库的存在意义非同寻常. 本质上来说库是一种可执行代码的二进制形式,可以被操 ...
- 串匹配算法之BM算法
参考资料: http://blog.csdn.net/eric491179912/article/details/6210009 http://blog.163.com/pengfeicui@ye ...
- .net 4.0 网站发布(转)
http://www.cnblogs.com/daomul/archive/2013/05/23/3095232.html 1. 进入解决方案的web项目下,右击项目选择 "发布(B)&qu ...
- android 5.X Toolbar+DrawerLayout实现抽屉菜单
前言 android5.X新增的一个控件Toolbar,这个控件比ActionBar更加自由,可控,因为曾经的ActionBar的灵活性比較差,所以google逐渐使用Toolbar替代Action ...
- 三行代码实现.NET MVC统计显示页面的执行时间 超简单的实现方法 分析页面执行效率
三行代码实现.NET MVC统计显示页面的执行时间 超简单的实现方法 分析页面执行效率 博客页脚处添加了页面执行时间统计显示,如下图所示,也可以直接查看网页页脚处. 实现方法非常简单,只需三行代 ...
- Leetcode题解(4):L216/Combination Sum III
L216: Combination Sum III Find all possible combinations of k numbers that add up to a number n, giv ...
- java 堆和栈一般理解
栈与堆都是Java用来在Ram中存放数据的地方.与C++不同.Java自己主动管理栈和堆.程序猿不能直接地设置栈或堆. Java的堆是一个执行时数据区,类的(对象从中分配空间.这些对象通过new.n ...
- Ubuntu16.04 下docker部署web项目
概念性的请戳 第一步:更新apt-get update 第二步:安装环境 apt-get install \ apt-transport-https \ ca-certificates \ curl ...