Back and Forth

AtCoder

IDabc051_c

Time2000ms

Memory256MB

Difficulty—

Dolphin resides in two-dimensional Cartesian plane, with the positive $x$\-axis pointing right and the positive $y$\-axis pointing up. Currently, he is located at the point $(sx,sy)$. In each second, he can move up, down, left or right by a distance of $1$. Here, both the $x$\- and $y$\-coordinates before and after each movement must be integers. He will first visit the point $(tx,ty)$ where $sx < tx$ and $sy < ty$, then go back to the point $(sx,sy)$, then visit the point $(tx,ty)$ again, and lastly go back to the point $(sx,sy)$. Here, during the whole travel, he is not allowed to pass through the same point more than once, except the points $(sx,sy)$ and $(tx,ty)$. Under this condition, find a shortest path for him. ## Constraints * $-1000 ≤ sx < tx ≤ 1000$ * $-1000 ≤ sy < ty ≤ 1000$ * $sx,sy,tx$ and $ty$ are integers. ## Input The input is given from Standard Input in the following format: $sx$ $sy$ $tx$ $ty$ [samples]

Samples

Input #1

0 0 1 2

Output #1

UURDDLLUUURRDRDDDLLU

One possible shortest path is:

*   Going from $(sx,sy)$ to $(tx,ty)$ for the first time: $(0,0)$ → $(0,1)$ → $(0,2)$ → $(1,2)$
*   Going from $(tx,ty)$ to $(sx,sy)$ for the first time: $(1,2)$ → $(1,1)$ → $(1,0)$ → $(0,0)$
*   Going from $(sx,sy)$ to $(tx,ty)$ for the second time: $(0,0)$ → $(-1,0)$ → $(-1,1)$ → $(-1,2)$ → $(-1,3)$ → $(0,3)$ → $(1,3)$ → $(1,2)$
*   Going from $(tx,ty)$ to $(sx,sy)$ for the second time: $(1,2)$ → $(2,2)$ → $(2,1)$ → $(2,0)$ → $(2,-1)$ → $(1,-1)$ → $(0,-1)$ → $(0,0)$

Input #2

\-2 -2 1 1

Output #2

UURRURRDDDLLDLLULUUURRURRDDDLLDL

API Response (JSON)

{
  "problem": {
    "name": "Back and Forth",
    "description": {
      "content": "Dolphin resides in two-dimensional Cartesian plane, with the positive $x$\\-axis pointing right and the positive $y$\\-axis pointing up.   Currently, he is located at the point $(sx,sy)$. In each second",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc051_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Dolphin resides in two-dimensional Cartesian plane, with the positive $x$\\-axis pointing right and the positive $y$\\-axis pointing up.  \nCurrently, he is located at the point $(sx,sy)$. In each second...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments