A16121 | Buttons
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Anna and Katie ended up in a secret laboratory.
There are $a+b+c$ buttons in the laboratory. It turned out that $a$ buttons can only be pressed by Anna, $b$ buttons can only be pressed by Katie, and $c$ buttons can be pressed by either of them. Anna and Katie decided to play a game, taking turns pressing these buttons. Anna makes the first turn. Each button can be pressed at most once, so at some point, one of the girls will not be able to make her turn.
The girl who cannot press a button loses. Determine who will win if both girls play optimally.
There are $a+b+c$ buttons in the laboratory. It turned out that $a$ buttons can only be pressed by Anna, $b$ buttons can only be pressed by Katie, and $c$ buttons can be pressed by either of them. Anna and Katie decided to play a game, taking turns pressing these buttons. Anna makes the first turn. Each button can be pressed at most once, so at some point, one of the girls will not be able to make her turn.
The girl who cannot press a button loses. Determine who will win if both girls play optimally.
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases.
Each test case consists of three integers $a$ , $b$ , and $c$ ( $1 \le a, b, c \le 10^9$ ) — the number of buttons that can only be pressed by Anna, the number of buttons that can only be pressed by Katie, and the number of buttons that can be pressed by either of them, respectively.
Each test case consists of three integers $a$ , $b$ , and $c$ ( $1 \le a, b, c \le 10^9$ ) — the number of buttons that can only be pressed by Anna, the number of buttons that can only be pressed by Katie, and the number of buttons that can be pressed by either of them, respectively.
输出格式
For each test case, output First if Anna wins, or Second if Katie wins.
输入输出样例
输入 #1
5 1 1 1 9 3 3 1 2 3 6 6 9 2 2 8
输出 #1
First First Second First Second
For the simplicity of the explanation, we will numerate the buttons by the numbers from $1$ to $a+b+c$ : the first $a$ buttons can only be pressed by Anna, the next $b$ buttons can only be pressed by Katie, and the last $c$ buttons can be pressed by either of them.
In the first test case, Anna can press the $3$ -rd button on the first turn. Then Katie will press the $2$ -nd button (since it is the only possible turn for her). Then Anna will press the $1$ -st button. Katie won't have a button to press, so Anna will win.
In the second test case, Anna can press the first nine buttons in some order on her turns. No matter what buttons Katie will press, all the buttons from the $10$ -th to the $15$ -th will be pressed after $12$ turns. On the $13$ -th turn, Anna will press one of the first nine buttons and Katie will not have a button to press on her turn. Thus, Anna will win.
In the third test case, the game can proceed as follows:
- On the $1$ -st turn Anna presses the $5$ -th button.
- On the $2$ -st turn Katie presses the $4$ -th button.
- On the $3$ -st turn Anna presses the $6$ -th button.
- On the $4$ -st turn Katie presses the $3$ -th button.
- On the $5$ -st turn Anna presses the $1$ -th button.
- On the $6$ -st turn Katie presses the $2$ -th button.
- Anna cannot make the turn, so Katie wins.
It can be shown that Katie can win no matter what moves Anna takes.
In the first test case, Anna can press the $3$ -rd button on the first turn. Then Katie will press the $2$ -nd button (since it is the only possible turn for her). Then Anna will press the $1$ -st button. Katie won't have a button to press, so Anna will win.
In the second test case, Anna can press the first nine buttons in some order on her turns. No matter what buttons Katie will press, all the buttons from the $10$ -th to the $15$ -th will be pressed after $12$ turns. On the $13$ -th turn, Anna will press one of the first nine buttons and Katie will not have a button to press on her turn. Thus, Anna will win.
In the third test case, the game can proceed as follows:
- On the $1$ -st turn Anna presses the $5$ -th button.
- On the $2$ -st turn Katie presses the $4$ -th button.
- On the $3$ -st turn Anna presses the $6$ -th button.
- On the $4$ -st turn Katie presses the $3$ -th button.
- On the $5$ -st turn Anna presses the $1$ -th button.
- On the $6$ -st turn Katie presses the $2$ -th button.
- Anna cannot make the turn, so Katie wins.
It can be shown that Katie can win no matter what moves Anna takes.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted