Three Integers

AtCoder

IDarc143_a

Time2000ms

Memory256MB

Difficulty—

Three non-negative integers $A$, $B$, and $C$ are written on a blackboard. You can perform the following two operations any number of times in any order. * Subtract $1$ from two of the written integers of your choice. * Subtract $1$ from all of the written integers. Your objective is to make all the numbers on the blackboard $0$. Determine whether it is achievable. If it is, find the minimum number of times you need to perform an operation to achieve it. ## Constraints * $0 \leq A, B, C \leq 10^{18}$ ## Input Input is given from Standard Input in the following format: $A$ $B$ $C$ [samples]

Samples

Input #1

2 2 3

Output #1

3

Here is one way to make all the numbers $0$.

*   Subtract $1$ from $A$ and $C$. Now the numbers are $1$, $2$, $2$.
*   Subtract $1$ from $B$ and $C$. Now the numbers are $1$, $1$, $1$.
*   Subtract $1$ from all the numbers. Now the numbers are $0$, $0$, $0$.

Input #2

0 0 1

Output #2

\-1

Input #3

0 0 0

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Three Integers",
    "description": {
      "content": "Three non-negative integers $A$, $B$, and $C$ are written on a blackboard. You can perform the following two operations any number of times in any order. *   Subtract $1$ from two of the written inte",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "arc143_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Three non-negative integers $A$, $B$, and $C$ are written on a blackboard. You can perform the following two operations any number of times in any order.\n\n*   Subtract $1$ from two of the written inte...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments