A15700 | Stand-up Comedian
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Eve is a beginner stand-up comedian. Her first show gathered a grand total of two spectators: Alice and Bob.
Eve prepared $a_1 + a_2 + a_3 + a_4$ jokes to tell, grouped by their type:
- type 1: both Alice and Bob like them;
- type 2: Alice likes them, but Bob doesn't;
- type 3: Bob likes them, but Alice doesn't;
- type 4: neither Alice nor Bob likes them.
Initially, both spectators have their mood equal to $0$ . When a spectator hears a joke he/she likes, his/her mood increases by $1$ . When a spectator hears a joke he/she doesn't like, his/her mood decreases by $1$ . If the mood of a spectator becomes negative (strictly below zero), he/she leaves.
When someone leaves, Eve gets sad and ends the show. If no one leaves, and Eve is out of jokes, she also ends the show.
Thus, Eve wants to arrange her jokes in such a way that the show lasts as long as possible. Help her to calculate the maximum number of jokes she can tell before the show ends.
Eve prepared $a_1 + a_2 + a_3 + a_4$ jokes to tell, grouped by their type:
- type 1: both Alice and Bob like them;
- type 2: Alice likes them, but Bob doesn't;
- type 3: Bob likes them, but Alice doesn't;
- type 4: neither Alice nor Bob likes them.
Initially, both spectators have their mood equal to $0$ . When a spectator hears a joke he/she likes, his/her mood increases by $1$ . When a spectator hears a joke he/she doesn't like, his/her mood decreases by $1$ . If the mood of a spectator becomes negative (strictly below zero), he/she leaves.
When someone leaves, Eve gets sad and ends the show. If no one leaves, and Eve is out of jokes, she also ends the show.
Thus, Eve wants to arrange her jokes in such a way that the show lasts as long as possible. Help her to calculate the maximum number of jokes she can tell before the show ends.
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of testcases.
The only line of each testcase contains four integers $a_1, a_2, a_3, a_4$ ( $0 \le a_1, a_2, a_3, a_4 \le 10^8$ ; $a_1 + a_2 + a_3 + a_4 \ge 1$ ) — the number of jokes of each type Eve prepared.
The only line of each testcase contains four integers $a_1, a_2, a_3, a_4$ ( $0 \le a_1, a_2, a_3, a_4 \le 10^8$ ; $a_1 + a_2 + a_3 + a_4 \ge 1$ ) — the number of jokes of each type Eve prepared.
输出格式
For each testcase, print a single integer — the maximum number of jokes Eve can tell before at least one of the spectators leaves or before she runs out of jokes.
输入输出样例
输入 #1
4 5 0 0 0 0 0 0 5 2 5 10 6 3 0 0 7
输出 #1
5 1 15 7
In the first testcase, Eve only has jokes of the first type. Thus, there's no order to choose. She tells all her jokes, both Alice and Bob like them. Their mood becomes $5$ . The show ends after Eve runs out of jokes.
In the second testcase, Eve only has jokes of the fourth type. Thus, once again no order to choose. She tells a joke, and neither Alice, nor Bob likes it. Their mood decrease by one, becoming $-1$ . They both have negative mood, thus, both leave, and the show ends.
In the third testcase, first, Eve tells both jokes of the first type. Both Alice and Bob has mood $2$ . Then she can tell $2$ jokes of the third type. Alice's mood becomes $0$ . Bob's mood becomes $4$ . Then $4$ jokes of the second type. Alice's mood becomes $4$ . Bob's mood becomes $0$ . Then another $4$ jokes of the third type. Alice's mood becomes $0$ . Bob's mood becomes $4$ . Then the remaining joke of the second type. Alice's mood becomes $1$ . Bob's mood becomes $3$ . Then one more joke of the third type, and a joke of the fourth type, for example. Alice's mood becomes $-1$ , she leaves, and the show ends.
In the fourth testcase, Eve should first tell the jokes both spectators like, then the jokes they don't. She can tell $4$ jokes of the fourth type until the spectators leave.
In the second testcase, Eve only has jokes of the fourth type. Thus, once again no order to choose. She tells a joke, and neither Alice, nor Bob likes it. Their mood decrease by one, becoming $-1$ . They both have negative mood, thus, both leave, and the show ends.
In the third testcase, first, Eve tells both jokes of the first type. Both Alice and Bob has mood $2$ . Then she can tell $2$ jokes of the third type. Alice's mood becomes $0$ . Bob's mood becomes $4$ . Then $4$ jokes of the second type. Alice's mood becomes $4$ . Bob's mood becomes $0$ . Then another $4$ jokes of the third type. Alice's mood becomes $0$ . Bob's mood becomes $4$ . Then the remaining joke of the second type. Alice's mood becomes $1$ . Bob's mood becomes $3$ . Then one more joke of the third type, and a joke of the fourth type, for example. Alice's mood becomes $-1$ , she leaves, and the show ends.
In the fourth testcase, Eve should first tell the jokes both spectators like, then the jokes they don't. She can tell $4$ jokes of the fourth type until the spectators leave.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted