【29.89%】【codeforces 734D】Anton and Chess
time limit per test4 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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”.
Input
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.
Output
The only line of the output should contains “YES” (without quotes) if the white king is in check and “NO” (without quotes) otherwise.
Examples
input
2
4 2
R 1 1
B 1 5
output
YES
input
2
4 2
R 3 3
B 1 5
output
NO
Note
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”.
【题目链接】:http://codeforces.com/contest/734/problem/D
【题解】
一开始想错了;还以为是一个棋子一个棋子地摆下去;后来才发现;原来是全部摆完之后才判断;
做法是把那个白皇后的横、竖、两个对角线上的坐标记录一下;(i+j)就在’/’型对角线上,(i-j)在’\’型对角线上.用4个vector记录;
然后按照y坐标排序(除了竖的线按照x坐标之外);
(当然,你要把那个白皇后一开始也加到这4个vector中);
然后用个lower_bound查找那个白皇后在4个vector中的位置;
然后看4个vector中该白皇后相邻的两个棋子会不会攻击到这个棋子;
横的和竖的有皇后和车能攻击到
对角线则有皇后和象能攻击到;
具体的看代码吧;
【完整代码】
#include <bits/stdc++.h>
#define LL long long
using namespace std;
struct abc
{
LL y;
char key;
};
int n;
LL a0,b0;
vector <abc> heng,shu;
vector <abc> xpy,xsy;
abc temp;
bool cmp(abc a,abc b)
{
return a.y < b.y;
}
int main()
{
//freopen("F:\\rush.txt","r",stdin);
cin >> n;
cin >> a0 >>b0;
temp.y = b0;
heng.push_back(temp);
temp.y = a0;
shu.push_back(temp);
temp.y = b0;temp.key = '*';
xpy.push_back(temp);
xsy.push_back(temp);
for (int i = 1;i <= n;i++)
{
LL x,y;
char key;
cin >> key >> x >> y;
temp.y = y;temp.key = key;
if (x == a0)
heng.push_back(temp);
temp.y = x;
if (y == b0)
shu.push_back(temp);
temp.y = y;
if (x+y==a0+b0)
xpy.push_back(temp);
if (x-y==a0-b0)
xsy.push_back(temp);
}
sort(heng.begin(),heng.end(),cmp);
sort(shu.begin(),shu.end(),cmp);
sort(xpy.begin(),xpy.end(),cmp);
sort(xsy.begin(),xsy.end(),cmp);
int pos;
//横线
temp.y = b0;
pos = lower_bound(heng.begin(),heng.end(),temp,cmp)-heng.begin();
int len = heng.size();
if (pos-1>=0)
{
char key = heng[pos-1].key;
if (key == 'Q' || key == 'R')
{
puts("YES");
return 0;
}
}
if (pos+1 <= len-1)
{
char key = heng[pos+1].key;
if (key == 'Q' || key == 'R')
{
puts("YES");
return 0;
}
}
len = shu.size();
//竖线
temp.y = a0;
pos = lower_bound(shu.begin(),shu.end(),temp,cmp)-shu.begin();
if (pos-1>=0)
{
char key = shu[pos-1].key;
if (key == 'Q' || key == 'R')
{
puts("YES");
return 0;
}
}
if (pos+1 <= len-1)
{
char key = shu[pos+1].key;
if (key == 'Q' || key == 'R')
{
puts("YES");
return 0;
}
}
len = xpy.size();
// '/'型对角线
temp.y = b0;
pos = lower_bound(xpy.begin(),xpy.end(),temp,cmp)-xpy.begin();
if (pos-1>=0)
{
char key = xpy[pos-1].key;
if (key == 'Q' || key == 'B')
{
puts("YES");
return 0;
}
}
if (pos+1 <= len-1)
{
char key = xpy[pos+1].key;
if (key == 'Q' || key == 'B')
{
puts("YES");
return 0;
}
}
len = xsy.size();
// '\'型对角线
pos = lower_bound(xsy.begin(),xsy.end(),temp,cmp)-xsy.begin();
if (pos-1>=0)
{
char key = xsy[pos-1].key;
if (key == 'Q' || key == 'B')
{
puts("YES");
return 0;
}
}
if (pos+1 <= len-1)
{
char key = xsy[pos+1].key;
if (key == 'Q' || key == 'B')
{
puts("YES");
return 0;
}
}
puts("NO");
return 0;
}
【29.89%】【codeforces 734D】Anton and Chess的更多相关文章
- 【 BowWow and the Timetable CodeForces - 1204A 】【思维】
题目链接 可以发现 十进制4 对应 二进制100 十进制16 对应 二进制10000 十进制64 对应 二进制1000000 可以发现每多两个零,4的次幂就增加1. 用string读入题目给定的二进制 ...
- 【35.29%】【codeforces 557C】Arthur and Table
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...
- 【74.89%】【codeforces 551A】GukiZ and Contest
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...
- 【39.29%】【codeforces 552E】Vanya and Brackets
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...
- 【32.89%】【codeforces 574D】Bear and Blocks
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...
- 【codeforces 29B】Traffic Lights
[题目链接]:http://codeforces.com/problemset/problem/29/B [题意] 一辆车; 让从A开到B; 然后速度是v; (只有在信号灯前面才能停下来..否则其他时 ...
- 【codeforces 415D】Mashmokh and ACM(普通dp)
[codeforces 415D]Mashmokh and ACM 题意:美丽数列定义:对于数列中的每一个i都满足:arr[i+1]%arr[i]==0 输入n,k(1<=n,k<=200 ...
- 【搜索】【并查集】Codeforces 691D Swaps in Permutation
题目链接: http://codeforces.com/problemset/problem/691/D 题目大意: 给一个1到N的排列,M个操作(1<=N,M<=106),每个操作可以交 ...
- 【中途相遇法】【STL】BAPC2014 K Key to Knowledge (Codeforces GYM 100526)
题目链接: http://codeforces.com/gym/100526 http://acm.hunnu.edu.cn/online/?action=problem&type=show& ...
随机推荐
- 基于zookeeper实现的分布式锁
基于zookeeper实现的分布式锁 2011-01-27 • 技术 • 7 条评论 • jiacheo •14,941 阅读 A distributed lock base on zookeeper ...
- 页面事件(Init,Load,PreRender)执行顺序
简介 对由 Microsoft® Internet 信息服务 (IIS) 处理的 Microsoft® ASP.NET 页面的每个请求都会被移交到 ASP.NET HTTP 管道.HTTP 管道由一系 ...
- spring接收对象数组实例
JS var param= new Array(); var one= new Object; one.id = '1'; one.name= 'simba1'; param.push(one); v ...
- amazeui页面分析3
amazeui页面分析3 一.总结 1. 本质是list列表,是ul套li的形式,只不过li里面是图片 <li class="am-g am-list-item-desced am-l ...
- 硬件——STM32 , SN74HC573锁存器
74HC573是一款高速CMOS器件: 上图中:输出使能为:OE 锁存使能为:LE 典型电路: 上图中:PWR-AL-0,PWR-AL-1,PWR-AL-2:是单片机输出的高低电平给573 对应的 ...
- 9.10 Binder系统_Java实现_hello服务
怎么做?2.1 定义接口: 写IHelloService.aidl文件, 上传, 编译, 得到IHelloService.java 里面有Stub : onTransact, 它会分辨收到数据然后调用 ...
- 7、linux系统2440开发板域名解析问题
如果在linux系统中ping某一台电脑的ip地址可以ping 通: ~ >: ping 192.168.1.3PING 192.168.1.3 (192.168.1.3): 56 data b ...
- 漂亮的Android加载中动画:AVLoadingIndicatorView
AVLoadingIndicatorView 包含一组漂亮的Android加载中动画. IOS版本:here. 示例 Download Apk 用法 步骤1 Add dependencies in b ...
- 关于.c和.h 和定义变量的问题
最初调试的时候是因为有个错误在wavplay.h文件中 于是我跳到了recorderl.h中:从图中看到引用了main.h 出现这个问题的具体原因还是不太清楚: 不过我任务是因为: wavplay.h ...
- bc-win32-power-echo-vim-not-work
http://gnuwin32.sourceforge.net/packages.html linux ok, but win32 not ok [root@130-255-8-100 ~]# ech ...