A14053 | Pairs
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You have $2n$ integers $1, 2, \dots, 2n$ . You have to redistribute these $2n$ elements into $n$ pairs. After that, you choose $x$ pairs and take minimum elements from them, and from the other $n - x$ pairs, you take maximum elements.
Your goal is to obtain the set of numbers $\{b_1, b_2, \dots, b_n\}$ as the result of taking elements from the pairs.
What is the number of different $x$ -s ( $0 \le x \le n$ ) such that it's possible to obtain the set $b$ if for each $x$ you can choose how to distribute numbers into pairs and from which $x$ pairs choose minimum elements?
Your goal is to obtain the set of numbers $\{b_1, b_2, \dots, b_n\}$ as the result of taking elements from the pairs.
What is the number of different $x$ -s ( $0 \le x \le n$ ) such that it's possible to obtain the set $b$ if for each $x$ you can choose how to distribute numbers into pairs and from which $x$ pairs choose minimum elements?
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 1000$ ) — the number of test cases.
The first line of each test case contains the integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ).
The second line of each test case contains $n$ integers $b_1, b_2, \dots, b_n$ ( $1 \le b_1 < b_2 < \dots < b_n \le 2n$ ) — the set you'd like to get.
It's guaranteed that the sum of $n$ over test cases doesn't exceed $2 \cdot 10^5$ .
The first line of each test case contains the integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ).
The second line of each test case contains $n$ integers $b_1, b_2, \dots, b_n$ ( $1 \le b_1 < b_2 < \dots < b_n \le 2n$ ) — the set you'd like to get.
It's guaranteed that the sum of $n$ over test cases doesn't exceed $2 \cdot 10^5$ .
输出格式
For each test case, print one number — the number of different $x$ -s such that it's possible to obtain the set $b$ .
输入输出样例
输入 #1
3 1 1 5 1 4 5 9 10 2 3 4
输出 #1
1 3 1
In the first test case, $x = 1$ is the only option: you have one pair $(1, 2)$ and choose the minimum from this pair.
In the second test case, there are three possible $x$ -s. If $x = 1$ , then you can form the following pairs: $(1, 6)$ , $(2, 4)$ , $(3, 5)$ , $(7, 9)$ , $(8, 10)$ . You can take minimum from $(1, 6)$ (equal to $1$ ) and the maximum elements from all other pairs to get set $b$ .
If $x = 2$ , you can form pairs $(1, 2)$ , $(3, 4)$ , $(5, 6)$ , $(7, 9)$ , $(8, 10)$ and take the minimum elements from $(1, 2)$ , $(5, 6)$ and the maximum elements from the other pairs.
If $x = 3$ , you can form pairs $(1, 3)$ , $(4, 6)$ , $(5, 7)$ , $(2, 9)$ , $(8, 10)$ and take the minimum elements from $(1, 3)$ , $(4, 6)$ , $(5, 7)$ .
In the third test case, $x = 0$ is the only option: you can form pairs $(1, 3)$ , $(2, 4)$ and take the maximum elements from both of them.
In the second test case, there are three possible $x$ -s. If $x = 1$ , then you can form the following pairs: $(1, 6)$ , $(2, 4)$ , $(3, 5)$ , $(7, 9)$ , $(8, 10)$ . You can take minimum from $(1, 6)$ (equal to $1$ ) and the maximum elements from all other pairs to get set $b$ .
If $x = 2$ , you can form pairs $(1, 2)$ , $(3, 4)$ , $(5, 6)$ , $(7, 9)$ , $(8, 10)$ and take the minimum elements from $(1, 2)$ , $(5, 6)$ and the maximum elements from the other pairs.
If $x = 3$ , you can form pairs $(1, 3)$ , $(4, 6)$ , $(5, 7)$ , $(2, 9)$ , $(8, 10)$ and take the minimum elements from $(1, 3)$ , $(4, 6)$ , $(5, 7)$ .
In the third test case, $x = 0$ is the only option: you can form pairs $(1, 3)$ , $(2, 4)$ and take the maximum elements from both of them.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted