Hammer

AtCoder

IDabc270_b

Time2000ms

Memory256MB

Difficulty—

Takahashi is at the origin of a number line. He wants to reach a goal at coordinate $X$. There is a wall at coordinate $Y$, which Takahashi cannot go beyond at first. However, after picking up a hammer at coordinate $Z$, he can destroy that wall and pass through. Determine whether Takahashi can reach the goal. If he can, find the minimum total distance he needs to travel to do so. ## Constraints * $-1000 \leq X,Y,Z \leq 1000$ * $X$, $Y$, and $Z$ are distinct, and none of them is $0$. * All values in the input are integers. ## Input The input is given from Standard Input in the following format: $X$ $Y$ $Z$ [samples]

Samples

Input #1

10 -10 1

Output #1

10

Takahashi can go straight to the goal.

Input #2

20 10 -10

Output #2

40

The goal is beyond the wall. He can get there by first picking up the hammer and then destroying the wall.

Input #3

100 1 1000

Output #3

\-1

API Response (JSON)

{
  "problem": {
    "name": "Hammer",
    "description": {
      "content": "Takahashi is at the origin of a number line. He wants to reach a goal at coordinate $X$. There is a wall at coordinate $Y$, which Takahashi cannot go beyond at first.   However, after picking up a ham",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc270_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Takahashi is at the origin of a number line. He wants to reach a goal at coordinate $X$.\nThere is a wall at coordinate $Y$, which Takahashi cannot go beyond at first.  \nHowever, after picking up a ham...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments