CodeForces362A Two Semiknights Meet(dfs)

原创 2016年06月01日 21:30:00

CodeForces362A Two Semiknights Meet

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Description

A boy Petya loves chess very much. He even came up with a chess piece of his own, a semiknight. The semiknight can move in any of these four directions: 2 squares forward and 2 squares to the right, 2 squares forward and 2 squares to the left, 2 squares backward and 2 to the right and 2 squares backward and 2 to the left. Naturally, the semiknight cannot move beyond the limits of the chessboard.

Petya put two semiknights on a standard chessboard. Petya simultaneously moves with both semiknights. The squares are rather large, so after some move the semiknights can meet, that is, they can end up in the same square. After the meeting the semiknights can move on, so it is possible that they meet again. Petya wonders if there is such sequence of moves when the semiknights meet. Petya considers some squares bad. That is, they do not suit for the meeting. The semiknights can move through these squares but their meetings in these squares don’t count.

Petya prepared multiple chess boards. Help Petya find out whether the semiknights can meet on some good square for each board.

Please see the test case analysis.

Input

The first line contains number t (1 ≤ t ≤ 50) — the number of boards. Each board is described by a matrix of characters, consisting of 8 rows and 8 columns. The matrix consists of characters “.”, “#”, “K”, representing an empty good square, a bad square and the semiknight’s position, correspondingly. It is guaranteed that matrix contains exactly 2 semiknights. The semiknight’s squares are considered good for the meeting. The tests are separated by empty line.

Output

For each test, print on a single line the answer to the problem: “YES”, if the semiknights can meet and “NO” otherwise.

Sample Input

Input

2
........
........
......#.
K..##..#
.......#
...##..#
......#.
K.......

........
........
..#.....
..#..#..
..####..
...##...
........
....K#K#

Output

YES
NO

Hint

Consider the first board from the sample. We will assume the rows and columns of the matrix to be numbered 1 through 8 from top to bottom and from left to right, correspondingly. The knights can meet, for example, in square (2, 7). The semiknight from square (4, 1) goes to square (2, 3) and the semiknight goes from square (8, 1) to square (6, 3). Then both semiknights go to (4, 5) but this square is bad, so they move together to square (2, 7).

On the second board the semiknights will never meet.

链接在这:题目链接


两个棋子k(其实就是象棋里的象或相),同时走看能否相遇,注意#可以经过,但不能在#处相遇,
dfs解决

代码:

#include<stdio.h>
#include<string.h>

char map[10][10];
int vis1[10][10];
int vis2[10][10];
int dxy[4][2]={2,2,2,-2,-2,2,-2,-2};
int x1,y1,x2,y2;

void dfs1 (int x,int y,int step)
{
    if(x<0||x>=8||y<0||y>=8)
        return;
    else if(map[x][y]=='K'||map[x][y]=='.'||map[x][y]=='#')
    {
        if(vis1[x][y]==0)
            vis1[x][y]=step;
        else
        {
            if(vis1[x][y]>step)
                vis1[x][y]=step;
            else
                return;
        }
        for(int i=0;i<4;i++)
        {
            int nx=x+dxy[i][0];
            int ny=y+dxy[i][1];
            dfs1(nx,ny,step+1);
        }
    }
}

void dfs2 (int x,int y,int step)
{
    if(x<0||x>=8||y<0||y>=8)
        return;
    else if(map[x][y]=='K'||map[x][y]=='.'||map[x][y]=='#')
    {
        if(vis2[x][y]==0)
            vis2[x][y]=step;
        else
        {
            if(vis2[x][y]>step)
                vis2[x][y]=step;
            else
                return;
        }
        for(int i=0;i<4;i++)
        {
            int nx=x+dxy[i][0];
            int ny=y+dxy[i][1];
            dfs2(nx,ny,step+1);
        }
    }
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int flag=0;
        memset(vis1,0,sizeof(vis1));
        memset(vis2,0,sizeof(vis2));
        for(int i=0;i<8;i++)
            scanf("%s",map[i]);
        for(int i=0;i<8;i++)
        {
            for(int j=0;j<8;j++)
            {
                if(map[i][j]=='K')
                {
                    if(flag==0)
                        x1=i,y1=j,flag=1;
                    else
                        x2=i,y2=j;
                }
            }
        }
        dfs1(x1,y1,1);
        dfs2(x2,y2,1);
        int ans=0;
        int max1=-1,max2=-1;
        for(int i=0;i<8;i++)
        {
            for(int j=0;j<8;j++)
            {
                if(map[i][j]!='#'&&vis1[i][j]!=0&&vis2[i][j]!=0&&(vis1[i][j]-vis2[i][j])%2==0)
                {
                    ans=1;
                }
                if(max1<vis1[i][j])
                    max1=vis1[i][j];
                if(max2<vis2[i][j])
                    max2=vis2[i][j];
            }
        }
        if(max1<=1||max2<=1)
            ans=0;
        if(ans)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Codeforecs-362A Two Semiknights Meet(dfs)

题意:骑士只能在8*8的方格中走田字格,就像中国象棋中的“相"一样。在给出n个...

Codeforces 362A Two Semiknights Meet

题目链接:http://codeforces.com/problemset/problem/362/A 题目大意:

Codeforces Round #212 (Div. 2) A A. Two Semiknights Meet

做一个高素质选手实在太难奥林匹克精神绝对不止止是体育在紧张的时候冷静下来读题分析真的挺重要的这个题目其实很简单。当然要求你有很强的编码经验和调试经验,题意还是有点坑爹的,这种棋盘搜索的题意都是有点坑爹...

Codeforces Round #212 (Div. 2) A. Two Semiknights Meet

这道题目的题意是给你一个8*8的矩阵,然后给出你两个K的位置,让你求两个K能不能相遇。 走的规则是:1.只能向上向上走两个的同时向右或者左走两个;2.向下走两个同时向右或者向左走两个; 解题思路就...

codeforces#290 B&&510 B Fox And Two Dots(简单dfs)

B. Fox And Two Dots 点击打开题目链接 time limit per test 2 seconds memory limit per test 256 mega...

Codeforces 510B:Fox And Two Dots(DFS变形+技巧)

B. Fox And Two Dots time limit per test 2 seconds memory limit per test 256 megabytes ...
  • zugofn
  • zugofn
  • 2016年08月14日 23:58
  • 141

CodeForces 510B Fox And Two Dots(深搜DFS)

题目: B. Fox And Two Dots time limit per test 2 seconds memory limit per test 256 megabytes in...

codeforces#36E Two Paths DFS

题目大意:给定一张n=10000,m4,无解 若度数为奇数
  • PoPoQQQ
  • PoPoQQQ
  • 2015年05月13日 15:44
  • 1203

CodeForces 510 B. Fox And Two Dots(DFS)

CodeForces 510 B. Fox And Two Dots(DFS)

CodeForces - 510B Fox And Two Dots(DFS)

Fox And Two Dots Fox Ciel is playing a mobile puzzle game called "Two Dots". The basic leve...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:CodeForces362A Two Semiknights Meet(dfs)
举报原因:
原因补充:

(最多只允许输入30个字)