O. Obfuscation technique

Codeforces

IDCFO

Time1000ms

Memory256MB

Difficulty—

English · Original

Chinese · Translation

Formal · Original

In the near future, an elite team of cybersecurity researchers known as the Digital Sentinels discovers that a clandestine group has developed a sophisticated obfuscation technique to hide messages within sentences. This technique allows critical information to go unnoticed, camouflaged among seemingly harmless data. During an undercover operation, the Sentinels intercept a text file that, at first glance, appears to contain only random characters. However, they suspect that this file hides a deactivation code essential to stop an out-of-control artificial intelligence threatening to take over global infrastructures. The string of text they have detected is 45 4c 20 43 4f 44 49 47 4f 20 44 45 20 44 45 53 41 43 54 49 56 41 43 49 4f 4e 20 45 53 3a 20 22 43 4f 44 45 3a 52 55 53 48 3a 54 45 43 22. As a member of the Digital Sentinels, you are tasked with decrypting this code to stop the artificial intelligence that is about to cause disruption in the global network. Given this message, output whatever the message requests from you. This is an only exit problem, so there is no input Whatever the message requests from you :) ## Input This is an only exit problem, so there is no input ## Output Whatever the message requests from you :) [samples]

最初，一只兔子位于二维平面上的 $(0, 0)$，它希望前往 $(x, y)$。它可以执行以下三种跳跃之一：第一行包含一个整数 $T$ $(1 lt.eq T lt.eq 10^4)$ —— 测试用例的数量。接下来的 $T$ 行，每行包含 $5$ 个整数 $x, y, A, B, C$ $(0 lt.eq x, y lt.eq 10^9, 0 lt.eq A, B, C lt.eq 10^9)$。对于每个测试用例，请输出一个整数，表示兔子跳到 $(x, y)$ 所需的最少胡萝卜数。 ## Input 第一行包含一个整数 $T$ $(1 lt.eq T lt.eq 10^4)$ —— 测试用例的数量。接下来的 $T$ 行，每行包含 $5$ 个整数 $x, y, A, B, C$ $(0 lt.eq x, y lt.eq 10^9, 0 lt.eq A, B, C lt.eq 10^9)$。 ## Output 对于每个测试用例，请输出一个整数，表示兔子跳到 $(x, y)$ 所需的最少胡萝卜数。 [samples]

**Definitions** Let $ T \in \mathbb{Z} $ be the number of test cases. For each test case $ k \in \{1, \dots, T\} $, let $ (x_k, y_k) \in \mathbb{Z}_{\geq 0}^2 $ be the target point, and let $ A_k, B_k, C_k \in \mathbb{Z}_{\geq 0} $ be the costs of three possible jumps. **Jump Operations** The rabbit can perform one of the following jumps from any point $ (a, b) $: 1. $ (a + 1, b + 1) $ with cost $ A_k $ 2. $ (a + 1, b) $ with cost $ B_k $ 3. $ (a, b + 1) $ with cost $ C_k $ **Constraints** 1. $ 1 \leq T \leq 10^4 $ 2. $ 0 \leq x_k, y_k \leq 10^9 $ 3. $ 0 \leq A_k, B_k, C_k \leq 10^9 $ **Objective** For each test case $ k $, find the minimum total cost to reach $ (x_k, y_k) $ from $ (0, 0) $ using any sequence of the above jumps.

API Response (JSON)

{
  "problem": {
    "name": "O. Obfuscation technique",
    "description": {
      "content": "In the near future, an elite team of cybersecurity researchers known as the Digital Sentinels discovers that a clandestine group has developed a sophisticated obfuscation technique to hide messages wi",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CFO"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "In the near future, an elite team of cybersecurity researchers known as the Digital Sentinels discovers that a clandestine group has developed a sophisticated obfuscation technique to hide messages wi...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "最初，一只兔子位于二维平面上的 $(0, 0)$，它希望前往 $(x, y)$。它可以执行以下三种跳跃之一：\n\n第一行包含一个整数 $T$ $(1 lt.eq T lt.eq 10^4)$ —— 测试用例的数量。接下来的 $T$ 行，每行包含 $5$ 个整数 $x, y, A, B, C$ $(0 lt.eq x, y lt.eq 10^9, 0 lt.eq A, B, C lt.eq 10^9)...",
      "is_translate": true,
      "language": "Chinese"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ T \\in \\mathbb{Z} $ be the number of test cases.  \nFor each test case $ k \\in \\{1, \\dots, T\\} $, let $ (x_k, y_k) \\in \\mathbb{Z}_{\\geq 0}^2 $ be the target point, and let $ A_k,...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments