[CCC 2023 J1] Deliv-e-droid

Luogu

IDLGP9299

Time3000ms

Memory512MB

DifficultyP1

2023CCC（加拿大）

In the game, Deliv-e-droid, a robot droid has to deliver packages while avoiding obstacles. At the end of the game, the final score is calculated based on the following point system: - Gain $50$ points for every package delivered. - Lose $10$ points for every collision with an obstacle. - Earn a bonus $500$ points if the number of packages delivered is greater than the number of collisions with obstacles. Your job is to determine the final score at the end of a game. ## Input The input will consist of two lines. The first line will contain a non-negative integer $P$,representing the number of packages delivered. The second line will contain a non-negative integer $C$,representing the number of collisions with obstacles. ## Output The output will consist of a single integer $F$,representing the final score. [samples]

Samples

Input #1

5
2

Output #1

Input #2

0
10

Output #2

-100

API Response (JSON)

{
  "problem": {
    "name": "[CCC 2023 J1] Deliv-e-droid",
    "description": {
      "content": "In the game, Deliv-e-droid, a robot droid has to deliver packages while avoiding obstacles. At the end of the game, the final score is calculated based on the following point system: - Gain $50$ poin",
      "description_type": "Markdown"
    },
    "platform": "Luogu",
    "limit": {
      "time_limit": 3000,
      "memory_limit": 524288
    },
    "difficulty": {
      "LuoguStyle": "P1"
    },
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "LGP9299"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "In the game, Deliv-e-droid, a robot droid has to deliver packages while avoiding obstacles.\n\nAt the end of the game, the final score is calculated based on the following point system:\n- Gain $50$ poin...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments