Codeforces_734_D

http://codeforces.com/problemset/problem/734/D

保存最近的八个方向的点，判断即可。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;

int x,y,n;
long long a[][];
char c[][];
int f(int x)
{
    if(x < )   return ;
    if(x == )  return ;
    return ;
}

int main()
{
    memset(a,0x3f,sizeof(a));
    memset(c,,sizeof(c));
    scanf("%d%d%d",&n,&x,&y);
    int s[],xx,yy;
    while(n--)
    {
        scanf("%s%d%d",s,&xx,&yy);
        xx -= x;
        yy -= y;
        if(xx !=  && yy !=  && abs(xx) != abs(yy))    continue;
        if(a[f(xx)][f(yy)] > max(abs(xx),abs(yy)))
        {
            a[f(xx)][f(yy)] = max(abs(xx),abs(yy));
            c[f(xx)][f(yy)] = s[];
        }
    }
    for(int i = ;i < ;i++)
    {
        for(int j = ;j < ;j++)
        {
            if(c[i][j] == 'Q')
            {
                printf("YES\n");
                return ;
            }
            if(c[i][j] == 'B' && (i+j)% == )
            {
                printf("YES\n");
                return ;
            }
            if(c[i][j] == 'R' &&(i+j)%)
            {
                printf("YES\n");
                return ;
            }
        }
    }
    printf("NO\n");
    return ;
}