codeforces-scrape

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

1272B.md (3815B)


      1 Source: https://codeforces.com/problemset/problem/1272/B
      2 
      3 B. Snow Walking Robot
      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 Recently you have bought a snow walking robot and brought it home. Suppose your home is a cell $(0, 0)$ on an infinite grid.
     22 
     23 You also have the sequence of instructions of this robot. It is written as the string $s$ consisting of characters 'L', 'R', 'U' and 'D'. If the robot is in the cell $(x, y)$ right now, he can move to one of the adjacent cells (depending on the current instruction).
     24 
     25 * If the current instruction is 'L', then the robot can move to the left to $(x - 1, y)$;
     26 * if the current instruction is 'R', then the robot can move to the right to $(x + 1, y)$;
     27 * if the current instruction is 'U', then the robot can move to the top to $(x, y + 1)$;
     28 * if the current instruction is 'D', then the robot can move to the bottom to $(x, y - 1)$.
     29 
     30 You've noticed the warning on the last page of the manual: if the robot visits some cell (except $(0, 0)$) twice then it breaks.
     31 
     32 So the sequence of instructions is valid if the robot starts in the cell $(0, 0)$, performs the given instructions, visits no cell other than $(0, 0)$ two or more times and ends the path in the cell $(0, 0)$. Also cell $(0, 0)$ should be visited at most two times: at the beginning and at the end (if the path is empty then it is visited only once). For example, the following sequences of instructions are considered valid: "UD", "RL", "UUURULLDDDDLDDRRUU", and the following are considered invalid: "U" (the endpoint is not $(0, 0)$) and "UUDD" (the cell $(0, 1)$ is visited twice).
     33 
     34 The initial sequence of instructions, however, might be not valid. You don't want your robot to break so you decided to reprogram it in the following way: you will remove some (possibly, all or none) instructions from the initial sequence of instructions, then rearrange the remaining instructions as you wish and turn on your robot to move.
     35 
     36 Your task is to remove as few instructions from the initial sequence as possible and rearrange the remaining ones so that the sequence is valid. Report the valid sequence of the maximum length you can obtain.
     37 
     38 Note that you can choose any order of remaining instructions (you don't need to minimize the number of swaps or any other similar metric).
     39 
     40 You have to answer $q$ independent test cases.
     41 
     42 Input
     43 
     44 The first line of the input contains one integer $q$ ($1 \le q \le 2 \cdot 10^4$) — the number of test cases.
     45 
     46 The next $q$ lines contain test cases. The $i$-th test case is given as the string $s$ consisting of at least $1$ and no more than $10^5$ characters 'L', 'R', 'U' and 'D' — the initial sequence of instructions.
     47 
     48 It is guaranteed that the sum of $|s|$ (where $|s|$ is the length of $s$) does not exceed $10^5$ over all test cases ($\sum |s| \le 10^5$).
     49 
     50 Output
     51 
     52 For each test case print the answer on it. In the first line print the maximum number of remaining instructions. In the second line print the valid sequence of remaining instructions $t$ the robot has to perform. The moves are performed from left to right in the order of the printed sequence. If there are several answers, you can print any. If the answer is $0$, you are allowed to print an empty line (but you can don't print it).
     53 
     54 Example
     55 
     56 Input
     57 
     58 ```
     59 6
     60 LRU
     61 DURLDRUDRULRDURDDL
     62 LRUDDLRUDRUL
     63 LLLLRRRR
     64 URDUR
     65 LLL
     66 ```
     67 
     68 Output
     69 
     70 ```
     71 2
     72 LR
     73 14
     74 RUURDDDDLLLUUR
     75 12
     76 ULDDDRRRUULL
     77 2
     78 LR
     79 2
     80 UD
     81 0
     82 ```
     83 
     84 Note
     85 
     86 There are only two possible answers in the first test case: "LR" and "RL".
     87 
     88 The picture corresponding to the second test case:
     89 
     90  ![](https://espresso.codeforces.com/8c233989823f23fce1ba6dd363419f7cb755e78c.png) Note that the direction of traverse does not matter 
     91 
     92 Another correct answer to the third test case: "URDDLLLUURDR".