A15681 | Tea Tasting
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
A tea manufacturer decided to conduct a massive tea tasting. $n$ sorts of tea will be tasted by $n$ tasters. Both the sorts of tea and the tasters are numbered from $1$ to $n$ . The manufacturer prepared $a_i$ milliliters of the $i$ -th sort of tea. The $j$ -th taster can drink $b_j$ milliliters of tea at once.
The tasting will be conducted in steps. During the first step, the $i$ -th taster tastes the $i$ -th sort of tea. The $i$ -th taster drinks $\min(a_i, b_i)$ tea (how much is available of the $i$ -th sort and how much the $i$ -th taster can drink). $a_i$ also decreases by this amount.
Then all tasters move to the previous sort of tea. Thus, during the second step, the $i$ -th taster tastes the $(i-1)$ -st sort of tea. The $i$ -th taster drinks $\min(a_{i-1}, b_i)$ tea. The $1$ -st person ends the tasting.
During the third step, the $i$ -th taster tastes the $(i-2)$ -nd sort of tea. The $2$ -nd taster ends the tasting. This goes on until everyone ends the tasting.
Take a look at the tasting process for $n = 3$ , $a = [10, 20, 15]$ , $b = [9, 8, 6]$ . In the left row, there are the current amounts of each sort of tea. In the right column, there are current amounts of tea each taster has drunk in total. The arrow tells which taster each tea goes to on the current step. The number on the arrow is the amount — minimum of how much is available of the sort of tea and how much the taster can drink.
For each taster, print how many milliliters of tea he/she will drink in total.
The tasting will be conducted in steps. During the first step, the $i$ -th taster tastes the $i$ -th sort of tea. The $i$ -th taster drinks $\min(a_i, b_i)$ tea (how much is available of the $i$ -th sort and how much the $i$ -th taster can drink). $a_i$ also decreases by this amount.
Then all tasters move to the previous sort of tea. Thus, during the second step, the $i$ -th taster tastes the $(i-1)$ -st sort of tea. The $i$ -th taster drinks $\min(a_{i-1}, b_i)$ tea. The $1$ -st person ends the tasting.
During the third step, the $i$ -th taster tastes the $(i-2)$ -nd sort of tea. The $2$ -nd taster ends the tasting. This goes on until everyone ends the tasting.
Take a look at the tasting process for $n = 3$ , $a = [10, 20, 15]$ , $b = [9, 8, 6]$ . In the left row, there are the current amounts of each sort of tea. In the right column, there are current amounts of tea each taster has drunk in total. The arrow tells which taster each tea goes to on the current step. The number on the arrow is the amount — minimum of how much is available of the sort of tea and how much the taster can drink.
For each taster, print how many milliliters of tea he/she will drink in total.
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of testcases.
The first line of each testcase contains a single integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ) — the number of sorts of tea and the number of tasters.
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 10^9$ ) — the amount of each sort of tea.
The third line contains $n$ integers $b_1, b_2, \dots, b_n$ ( $1 \le b_i \le 10^9$ ) — the amount of tea each taster can drink at once.
The sum of $n$ over all testcases doesn't exceed $2 \cdot 10^5$ .
The first line of each testcase contains a single integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ) — the number of sorts of tea and the number of tasters.
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 10^9$ ) — the amount of each sort of tea.
The third line contains $n$ integers $b_1, b_2, \dots, b_n$ ( $1 \le b_i \le 10^9$ ) — the amount of tea each taster can drink at once.
The sum of $n$ over all testcases doesn't exceed $2 \cdot 10^5$ .
输出格式
For each testcase, print $n$ integers — the $i$ -th value should be equal to the total amount of tea the $i$ -th taster will drink.
输入输出样例
输入 #1
4 3 10 20 15 9 8 6 1 5 7 4 13 8 5 4 3 4 2 1 3 1000000000 1000000000 1000000000 1 1 1000000000
输出 #1
9 9 12 5 3 8 6 4 1 2 2999999997
The first testcase is described in the statement. Here are the remaining amounts of each sort of tea after each step and the total amount of tea each taster has drunk:
- $a = [1, 12, 9]$ , $\mathit{ans} = [9, 8, 6]$
- $a = [0, 6, 9]$ , $\mathit{ans} = [9, 9, 12]$
- $a = [0, 6, 9]$ , $\mathit{ans} = [9, 9, 12]$
In the second testcase, the only taster drinks $\min(5, 7)$ milliliters of tea of the only sort.
Here are the remaining amounts of each sort of tea after each step and the total amount of tea each taster has drunk for the third testcase:
- $a = [10, 4, 3, 3]$ , $\mathit{ans} = [3, 4, 2, 1]$ ;
- $a = [6, 2, 2, 3]$ , $\mathit{ans} = [3, 8, 4, 2]$ ;
- $a = [4, 1, 2, 3]$ , $\mathit{ans} = [3, 8, 6, 3]$ ;
- $a = [3, 1, 2, 3]$ , $\mathit{ans} = [3, 8, 6, 4]$ .
Here are the remaining amounts of each sort of tea after each step and the total amount of tea each taster has drunk for the fourth testcase:
- $a = [999999999, 999999999, 0]$ , $\mathit{ans} = [1, 1, 1000000000]$ ;
- $a = [999999998, 0, 0]$ , $\mathit{ans} = [1, 2, 1999999999]$ ;
- $a = [0, 0, 0]$ , $\mathit{ans} = [1, 2, 2999999997]$ .
- $a = [1, 12, 9]$ , $\mathit{ans} = [9, 8, 6]$
- $a = [0, 6, 9]$ , $\mathit{ans} = [9, 9, 12]$
- $a = [0, 6, 9]$ , $\mathit{ans} = [9, 9, 12]$
In the second testcase, the only taster drinks $\min(5, 7)$ milliliters of tea of the only sort.
Here are the remaining amounts of each sort of tea after each step and the total amount of tea each taster has drunk for the third testcase:
- $a = [10, 4, 3, 3]$ , $\mathit{ans} = [3, 4, 2, 1]$ ;
- $a = [6, 2, 2, 3]$ , $\mathit{ans} = [3, 8, 4, 2]$ ;
- $a = [4, 1, 2, 3]$ , $\mathit{ans} = [3, 8, 6, 3]$ ;
- $a = [3, 1, 2, 3]$ , $\mathit{ans} = [3, 8, 6, 4]$ .
Here are the remaining amounts of each sort of tea after each step and the total amount of tea each taster has drunk for the fourth testcase:
- $a = [999999999, 999999999, 0]$ , $\mathit{ans} = [1, 1, 1000000000]$ ;
- $a = [999999998, 0, 0]$ , $\mathit{ans} = [1, 2, 1999999999]$ ;
- $a = [0, 0, 0]$ , $\mathit{ans} = [1, 2, 2999999997]$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted