zoukankan      html  css  js  c++  java
  • codeforces 655A A. Amity Assessment(水题)

    题目链接:

    A. Amity Assessment

     

    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Bessie the cow and her best friend Elsie each received a sliding puzzle on Pi Day. Their puzzles consist of a 2 × 2 grid and three tiles labeled 'A', 'B', and 'C'. The three tiles sit on top of the grid, leaving one grid cell empty. To make a move, Bessie or Elsie can slide a tile adjacent to the empty cell into the empty cell as shown below:

    In order to determine if they are truly Best Friends For Life (BFFLs), Bessie and Elsie would like to know if there exists a sequence of moves that takes their puzzles to the same configuration (moves can be performed in both puzzles). Two puzzles are considered to be in the same configuration if each tile is on top of the same grid cell in both puzzles. Since the tiles are labeled with letters, rotations and reflections are not allowed.

    Input

    The first two lines of the input consist of a 2 × 2 grid describing the initial configuration of Bessie's puzzle. The next two lines contain a2 × 2 grid describing the initial configuration of Elsie's puzzle. The positions of the tiles are labeled 'A', 'B', and 'C', while the empty cell is labeled 'X'. It's guaranteed that both puzzles contain exactly one tile with each letter and exactly one empty position.

    Output

    Output "YES"(without quotes) if the puzzles can reach the same configuration (and Bessie and Elsie are truly BFFLs). Otherwise, print "NO" (without quotes).

    Examples
    input
    AB
    XC
    XB
    AC
    output
    YES
    input
    AB
    XC
    AC
    BX
    output
    NO
    Note

    The solution to the first sample is described by the image. All Bessie needs to do is slide her 'A' tile down.

    In the second sample, the two puzzles can never be in the same configuration. Perhaps Bessie and Elsie are not meant to be friends after all...

    题意:问给你两种状态问是否能由第一种状态转化成第二种;

    思路:顺时针方向的顺序看是否符合;

    AC代码:

    #include <bits/stdc++.h>
    using namespace std;
    int main()
    {
        char a[5][3],b[3][3],ans1[5],ans2[5];
        scanf("%s",a[0]);
        scanf("%s",a[1]);
        scanf("%s",b[0]);
        scanf("%s",b[1]);
        int cnt=0,num=0;
        if(a[0][0]!='X')ans1[cnt++]=a[0][0];
        if(a[0][1]!='X')ans1[cnt++]=a[0][1];
        if(a[1][1]!='X')ans1[cnt++]=a[1][1];
        if(a[1][0]!='X')ans1[cnt++]=a[1][0];
        if(b[0][0]!='X')ans2[num++]=b[0][0];
        if(b[0][1]!='X')ans2[num++]=b[0][1];
        if(b[1][1]!='X')ans2[num++]=b[1][1];
        if(b[1][0]!='X')ans2[num++]=b[1][0];
        int n=10;
        while(n--){
        if(ans1[0]==ans2[0]&&ans1[1]==ans2[1]&&ans1[2]==ans2[2])
        {
            cout<<"YES"<<"
    ";
            return 0;
        }
        else
        {
            char m=ans2[0];
            for(int i=0;i<3;i++)
            {
                ans2[i]=ans2[i+1];
            }
            ans2[2]=m;
        }
        }
        cout<<"NO"<<endl;
        return 0;
    }
  • 相关阅读:
    浅入浅出数据结构(17)——有关排序算法的分析
    浅入浅出数据结构(16)——插入排序
    浅入浅出数据结构(15)——优先队列(堆)
    浅入浅出数据结构(14)——散列表
    浅入浅出数据结构(13)——平衡二叉查找树之AVL树
    浅入浅出数据结构(12)——从二分查找到二叉树
    老项目的#iPhone6与iPhone6Plus适配#Icon适配
    老项目的#iPhone6与iPhone6Plus适配#iOS8无法开启定位问题和#解决方案#
    老项目的#iPhone6于iPhone6Plus适配#iPhone6分辨率与适配
    iOS设备屏幕像素总览
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5294936.html
Copyright © 2011-2022 走看看