codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

645A.md (2053B)


      1 Source: https://codeforces.com/problemset/problem/645/A
      2 
      3 A. Amity Assessment
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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:
     22 
     23  ![](https://espresso.codeforces.com/438a9004bdcef57731d3c8424129ec617baeebfe.png) 
     24 
     25 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.
     26 
     27 Input
     28 
     29 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 a 2 × 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.
     30 
     31 Output
     32 
     33 Output "YES"(without quotes) if the puzzles can reach the same configuration (and Bessie and Elsie are truly BFFLs). Otherwise, print "NO" (without quotes).
     34 
     35 Examples
     36 
     37 Input
     38 
     39 ```
     40 AB  
     41 XC  
     42 XB  
     43 AC
     44 ```
     45 
     46 Output
     47 
     48 ```
     49 YES
     50 ```
     51 
     52 Input
     53 
     54 ```
     55 AB  
     56 XC  
     57 AC  
     58 BX
     59 ```
     60 
     61 Output
     62 
     63 ```
     64 NO
     65 ```
     66 
     67 Note
     68 
     69 The solution to the first sample is described by the image. All Bessie needs to do is slide her 'A' tile down.
     70 
     71 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...