zoukankan      html  css  js  c++  java
  • codeforces 362A找规律

    刚开始以为是搜索白忙活了原来是个简单的找规律,以后要多想啊

    此题是两马同时跳

    A. Two Semiknights Meet
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 and2 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 test(s)
    Input
    2
    ........
    ........
    ......#.
    K..##..#
    .......#
    ...##..#
    ......#.
    K.......
    
    ........
    ........
    ..#.....
    ..#..#..
    ..####..
    ...##...
    ........
    ....K#K#
    
    Output
    YES
    NO
    
    Note

    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. 


    http://blog.csdn.net/firwaless/article/details/16342823

    #include<stdio.h>
    #include<math.h>
    int main() {
    int m,i,j,t,startx,starty,endx,endy;
    char s[10][10];
    scanf("%d",&t);
    while(t--) {
    for(i=1;i<=8;i++)
    scanf("%s",s[i]+1);
    m=0;
    for(i=1;i<=8;i++)
    for(j=1;j<=8;j++) {
    if(s[i][j]=='K'&&m==0) {
    m=1;
    startx=i;
    starty=j;
    }
    else
    if(s[i][j]=='K') {
    endx=i;
    endy=j;
    }
    }
    startx=abs(startx-endx);
    endx=abs(starty-endy);
    if(startx%4==0&&endx%4==0)
    printf("YES ");
    else
    printf("NO ");
    }
    return 0;
    }


  • 相关阅读:
    [ACM_模拟] ZJUT 1155 爱乐大街的门牌号 (规律 长为n的含k个逆序数的最小字典序)
    [ACM_搜索] ZOJ 1103 || POJ 2415 Hike on a Graph (带条件移动3盘子到同一位置的最少步数 广搜)
    [ACM_动态规划] POJ 1050 To the Max ( 动态规划 二维 最大连续和 最大子矩阵)
    [ACM_搜索] POJ 1096 Space Station Shielding (搜索 + 洪泛算法Flood_Fill)
    [JAVA] java_实例 获得系统字体
    [JAVA] java仿windows 字体设置选项卡
    [JAVA] 一个可以编辑、编译、运行Java简单文件的记事本java实现
    [ACM_模拟] POJ 1094 Sorting It All Out (拓扑排序+Floyd算法 判断关系是否矛盾或统一)
    JS的数组相关知识
    JS的join方法
  • 原文地址:https://www.cnblogs.com/thefirstfeeling/p/4410902.html
Copyright © 2011-2022 走看看