codeforces-scrape

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

725C.md (2009B)


      1 Source: https://codeforces.com/problemset/problem/725/C
      2 
      3 C. Hidden Word
      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 Let’s define a grid to be a set of tiles with 2 rows and 13 columns. Each tile has an English letter written in it. The letters don't have to be unique: there might be two or more tiles with the same letter written on them. Here is an example of a grid:
     22 
     23 ```
     24 ABCDEFGHIJKLM  
     25 NOPQRSTUVWXYZ
     26 ```
     27 
     28 We say that two tiles are adjacent if they share a side or a corner. In the example grid above, the tile with the letter 'A' is adjacent only to the tiles with letters 'B', 'N', and 'O'. A tile is not adjacent to itself.
     29 
     30 A sequence of tiles is called a path if each tile in the sequence is adjacent to the tile which follows it (except for the last tile in the sequence, which of course has no successor). In this example, "ABC" is a path, and so is "KXWIHIJK". "MAB" is not a path because 'M' is not adjacent to 'A'. A single tile can be used more than once by a path (though the tile cannot occupy two consecutive places in the path because no tile is adjacent to itself).
     31 
     32 You’re given a string *s* which consists of 27 upper-case English letters. Each English letter occurs at least once in *s*. Find a grid that contains a path whose tiles, viewed in the order that the path visits them, form the string *s*. If there’s no solution, print "Impossible" (without the quotes).
     33 
     34 Input
     35 
     36 The only line of the input contains the string *s*, consisting of 27 upper-case English letters. Each English letter occurs at least once in *s*.
     37 
     38 Output
     39 
     40 Output two lines, each consisting of 13 upper-case English characters, representing the rows of the grid. If there are multiple solutions, print any of them. If there is no solution print "Impossible".
     41 
     42 Examples
     43 
     44 Input
     45 
     46 ```
     47 ABCDEFGHIJKLMNOPQRSGTUVWXYZ
     48 ```
     49 
     50 Output
     51 
     52 ```
     53 YXWVUTGHIJKLM  
     54 ZABCDEFSRQPON
     55 ```
     56 
     57 Input
     58 
     59 ```
     60 BUVTYZFQSNRIWOXXGJLKACPEMDH
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 Impossible
     67 ```