問題一覧 > 通常問題

No.3509 Get More Money

レベル : / AI推定難易度 : 2700 / 実行時間制限 : 1ケース 2.000秒 / メモリ制限 : 1024 MB / 標準ジャッジ問題
タグ : (AC するまで非表示) / 解いたユーザー数 29
作問者 : Naru820 / テスター : Nzt3 rhoo Solalyth
お気に入りにしたユーザー ProblemId : 13156 / 自分の提出
問題文最終更新日: 2026-04-14 17:52:33
This statement was translated by AI (claude-opus-5-5, effort medium) and may contain errors or differ in nuance from the original. The original statement takes precedence. Back to the original
CPCTF 2026: PPC (順位表) の他の問題:

Problem Statement

Alice, a merchant, has decided to earn gold over the next $N$ days. Initially, Alice has $10^{100}$ gold and does not have even $1$ jewel.

On day $i$, Alice can make the following two types of transactions.

  • Pay $A_i$ gold to buy $1$ jewel. This transaction can be made at most $B_i$ times.
  • Sell $1$ jewel to receive $C_i$ gold. This transaction can be made only when she has $1$ or more jewels, and can be made at most $D_i$ times.

In addition, Alice's house has a storage vault that can hold at most $K$ jewels. Any jewel that Alice does not put in the vault is lost by the next day, but a jewel put in the vault is not lost, and she can use the stored jewels for transactions on subsequent days.

What is the maximum amount of gold Alice can earn through the transactions over the $N$ days?

More precisely, let $S$ gold be the maximum possible amount of gold Alice has after finishing the transactions on day $N$. Find $S - 10^{100}$.

There are $T$ test cases in total.

Constraints

  • $1 \leq T \leq 2 \times 10^5$
  • $1 \leq N \leq 2 \times 10^5$
  • $1 \le K \le 10^{12}$
  • $1 \le A_i,B_i,C_i,D_i \le 5 \times 10^6$
  • The sum of $N$ over all test cases is at most $2\times 10^5$.
  • All input values are integers.

Input

The input is given from standard input in the following format. Here, $\text{case}_i$ is the $i$-th test case.

$T$
$\text{case}_1$
$\text{case}_2$
$\vdots$
$\text{case}_{T}$
Each test case is given in the following format.
$N\ K$
$A_1 \ A_2 \ldots A_N$
$B_1 \ B_2 \ldots B_N$
$C_1 \ C_2 \ldots C_N$
$D_1 \ D_2 \ldots D_N$

Output

Output $T$ lines. The $i$-th line should contain the answer for $\text{case}_i$.

Sample

Sample 1
Input
3
3 2
1 3 2
3 3 1
2 1 3
1 3 2
4 1
4 2 1 3
5 6 2 3
7 3 1 9
5 1 4 8
13 4929798
1150434 88899 539811 1769519 4292449 4934296 4400709 64937 1760077 744701 456322 3779656 921043
1887669 2018657 3548740 193710 2991728 1964569 480243 2058687 4154332 3477027 3826799 1745255 2251591
3069743 1945307 3516424 4440181 1139192 489673 3089401 891641 1437747 2861899 984159 3969672 1605868
4638874 260809 499501 4269856 2551383 194827 2822117 1338907 2315113 866580 180577 1820692 1137521
Output
5
42
37267031954271

For the 1st test case, Alice can earn $5$ gold by making transactions as follows.

  • Day 1: Pay $3$ gold to buy $3$ jewels. Then, sell $1$ jewel to receive $2$ gold. Then, put $2$ jewels in the vault.
  • Day 2: Do nothing.
  • Day 3: Take $2$ jewels out of the vault. Sell $2$ jewels to receive $6$ gold.

It can also be proved that no matter how she makes transactions, she cannot earn $6$ gold or more. Therefore, output $5$.

For the 2nd test case as well, Alice can earn $42$ gold by making transactions as follows.

  • Day 1: Pay $20$ gold to buy $5$ jewels. Then, sell $5$ jewels to receive $35$ gold.
  • Day 2: Pay $2$ gold to buy $1$ jewel. Then, sell $1$ jewel to receive $3$ gold.
  • Day 3: Pay $1$ gold to buy $1$ jewel, and put it in the vault.
  • Day 4: Pay $9$ gold to buy $3$ jewels. Then, take $1$ jewel out of the vault, and sell $4$ jewels to receive $36$ gold.

提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。