A15749 | Game of the Year
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Monocarp and Polycarp are playing a computer game. This game features $n$ bosses for the playing to kill, numbered from $1$ to $n$ .
They will fight each boss the following way:
- Monocarp makes $k$ attempts to kill the boss;
- Polycarp makes $k$ attempts to kill the boss;
- Monocarp makes $k$ attempts to kill the boss;
- Polycarp makes $k$ attempts to kill the boss;
- ...
Monocarp kills the $i$ -th boss on his $a_i$ -th attempt. Polycarp kills the $i$ -th boss on his $b_i$ -th attempt. After one of them kills the $i$ -th boss, they move on to the $(i+1)$ -st boss. The attempt counters reset for both of them. Once one of them kills the $n$ -th boss, the game ends.
Find all values of $k$ from $1$ to $n$ such that Monocarp kills all bosses.
They will fight each boss the following way:
- Monocarp makes $k$ attempts to kill the boss;
- Polycarp makes $k$ attempts to kill the boss;
- Monocarp makes $k$ attempts to kill the boss;
- Polycarp makes $k$ attempts to kill the boss;
- ...
Monocarp kills the $i$ -th boss on his $a_i$ -th attempt. Polycarp kills the $i$ -th boss on his $b_i$ -th attempt. After one of them kills the $i$ -th boss, they move on to the $(i+1)$ -st boss. The attempt counters reset for both of them. Once one of them kills the $n$ -th boss, the game ends.
Find all values of $k$ from $1$ to $n$ such that Monocarp kills all bosses.
输入格式
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 bosses.
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le n$ ) — the index of attempt Monocarp kills each boss on.
The third line contains $n$ integers $b_1, b_2, \dots, b_n$ ( $1 \le b_i \le n$ ) — the index of attempt Polycarp kills each boss on.
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 bosses.
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le n$ ) — the index of attempt Monocarp kills each boss on.
The third line contains $n$ integers $b_1, b_2, \dots, b_n$ ( $1 \le b_i \le n$ ) — the index of attempt Polycarp kills each boss on.
The sum of $n$ over all testcases doesn't exceed $2 \cdot 10^5$ .
输出格式
For each testcase, print two lines. The first line should contain a single integer $\mathit{cnt}$ — the number of values of $k$ from $1$ to $n$ such that Monocarp kills all bosses. The second line should contain $\mathit{cnt}$ distinct integers — the values of $k$ themselves.
输入输出样例
输入 #1
3 3 1 1 1 2 3 1 1 1 1 4 1 4 3 2 3 3 4 1
输出 #1
3 1 2 3 1 1 2 2 4
Consider the last testcase of the example.
Let $k = 1$ . First, Monocarp makes one attempt to kill the first boss. It's successful, since $a_1 = 1$ . Then, Monocarp makes one attempt to kill the second boss. It's unsuccessful, since $a_2 > 1$ . So, Polycarp makes an attempt then. It's also unsuccessful, since $b_2 > 1$ . Then, Monocarp makes another attempt. It's still unsuccessful, since $a_2 > 2$ . This goes on until Polycarp finally kills the boss on his third attempt. Monocarp didn't kill this boss, thus, $k = 1$ isn't the answer.
Let $k = 2$ . Monocarp still kills the first boss on his first attempt. Then, he makes two unsuccessful attempts for the second boss. Then, Polycarp makes two unsuccessful attempts. Then, Monocarp makes two more attempts and kills the boss on his fourth attempt. The third boss is similar. First, two unsuccessful attempts by Monocarp. Then, two unsuccessful attempts by Polycarp. Then, Monocarp has two more attempts, but even his first one is successful, since $a_3 = 3$ . The fourth boss is also killed by Monocarp. Thus, $k = 2$ is the answer.
Let $k = 1$ . First, Monocarp makes one attempt to kill the first boss. It's successful, since $a_1 = 1$ . Then, Monocarp makes one attempt to kill the second boss. It's unsuccessful, since $a_2 > 1$ . So, Polycarp makes an attempt then. It's also unsuccessful, since $b_2 > 1$ . Then, Monocarp makes another attempt. It's still unsuccessful, since $a_2 > 2$ . This goes on until Polycarp finally kills the boss on his third attempt. Monocarp didn't kill this boss, thus, $k = 1$ isn't the answer.
Let $k = 2$ . Monocarp still kills the first boss on his first attempt. Then, he makes two unsuccessful attempts for the second boss. Then, Polycarp makes two unsuccessful attempts. Then, Monocarp makes two more attempts and kills the boss on his fourth attempt. The third boss is similar. First, two unsuccessful attempts by Monocarp. Then, two unsuccessful attempts by Polycarp. Then, Monocarp has two more attempts, but even his first one is successful, since $a_3 = 3$ . The fourth boss is also killed by Monocarp. Thus, $k = 2$ is the answer.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted