Problem:
Score : 300 points

Problem Statement

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

Output

Print a string S that represents a shortest path for Dolphin.

The i-th character in S should correspond to his i-th movement.

The directions of the movements should be indicated by the following characters:

U: Up

D: Down

L: Left

R: Right

If there exist multiple shortest paths under the condition, print any of them.

Sample Input 1

0 0 1 2

Sample 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)

Sample Input 2

-2 -2 1 1

Sample Output 2

UURRURRDDDLLDLLULUUURRURRDDDLLDL

Solution in Scala (2.11.7) (judge verdict: Runtime Error)

object Main {

  import scala.collection.immutable.Queue

  case class Point(x: Int, y: Int) {
    def move(dx: Int, dy: Int): Point =
      Point(x + dx, y + dy)
  }

  def main(args: Array[String]): Unit = {
    val sc = new java.util.Scanner(System.in)

    val sx, sy, tx, ty = sc.nextInt()

    def solve(): List[Point] = {
      val delta = 1000
      val visited = Array.fill(2 * delta, 2 * delta)(false)

      def bfs(vector: Seq[(Int, Int)], start: Point, end: Point): List[Point] = {
        val localVisited = Array.fill(2 * delta, 2 * delta)(false)

        def isVisited(x: Int, y: Int): Boolean =
          visited(y + delta)(x + delta) || localVisited(y + delta)(x + delta)

        def loop(queue: Queue[(Point, List[Point])]): List[Point] =
          if (queue.nonEmpty) {
            val (point, path) = queue.head
            if (point.x == end.x && point.y == end.y) {
              path foreach (point => visited(point.y + delta)(point.x + delta) = true)
              path.reverse
            } else if ((point.x == sx && point.y == sy) ||
                (point.x == tx && point.y == ty) ||
                !isVisited(point.x, point.y)) {
              localVisited(point.y + delta)(point.x + delta) = true
              loop(
                queue.tail.enqueue(vector. map { case (dx, dy) =>
                  (point.move(dx, dy), point :: path)
                }. toList))
            } else loop(queue.tail)
          } else Nil // not reachable
        loop(Queue((Point(start.x, start.y), Nil)))
      }

      val vector = Seq((0, 1), (1, 0), (0, -1), (-1, 0))

      bfs(vector, Point(sx, sy), Point(tx, ty)) ++
        bfs(vector, Point(tx, ty), Point(sx, sy)) ++
          bfs(vector, Point(sx, sy), Point(tx, ty)) ++
            bfs(vector, Point(tx, ty), Point(sx, sy)) :+ Point(sx, sy)
    }

    println(solve().sliding(2).map { p =>
      val parent = p.head
      val child = p.tail.head
      (child.x - parent.x, child.y - parent.y) match {
        case (0, 1) => 'U'
        case (1, 0) => 'R'
        case (0, -1) => 'D'
        case (-1, 0) => 'L'
      }
    }. mkString)
  }

}