A13509 | Shuffle
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an array consisting of $n$ integers $a_1$ , $a_2$ , ..., $a_n$ . Initially $a_x = 1$ , all other elements are equal to $0$ .
You have to perform $m$ operations. During the $i$ -th operation, you choose two indices $c$ and $d$ such that $l_i \le c, d \le r_i$ , and swap $a_c$ and $a_d$ .
Calculate the number of indices $k$ such that it is possible to choose the operations so that $a_k = 1$ in the end.
You have to perform $m$ operations. During the $i$ -th operation, you choose two indices $c$ and $d$ such that $l_i \le c, d \le r_i$ , and swap $a_c$ and $a_d$ .
Calculate the number of indices $k$ such that it is possible to choose the operations so that $a_k = 1$ in the end.
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 100$ ) — the number of test cases. Then the description of $t$ testcases follow.
The first line of each test case contains three integers $n$ , $x$ and $m$ ( $1 \le n \le 10^9$ ; $1 \le m \le 100$ ; $1 \le x \le n$ ).
Each of next $m$ lines contains the descriptions of the operations; the $i$ -th line contains two integers $l_i$ and $r_i$ ( $1 \le l_i \le r_i \le n$ ).
The first line of each test case contains three integers $n$ , $x$ and $m$ ( $1 \le n \le 10^9$ ; $1 \le m \le 100$ ; $1 \le x \le n$ ).
Each of next $m$ lines contains the descriptions of the operations; the $i$ -th line contains two integers $l_i$ and $r_i$ ( $1 \le l_i \le r_i \le n$ ).
输出格式
For each test case print one integer — the number of indices $k$ such that it is possible to choose the operations so that $a_k = 1$ in the end.
输入输出样例
输入 #1
3 6 4 3 1 6 2 3 5 5 4 1 2 2 4 1 2 3 3 2 2 3 1 2
输出 #1
6 2 3
In the first test case, it is possible to achieve $a_k = 1$ for every $k$ . To do so, you may use the following operations:
1. swap $a_k$ and $a_4$ ;
2. swap $a_2$ and $a_2$ ;
3. swap $a_5$ and $a_5$ .
In the second test case, only $k = 1$ and $k = 2$ are possible answers. To achieve $a_1 = 1$ , you have to swap $a_1$ and $a_1$ during the second operation. To achieve $a_2 = 1$ , you have to swap $a_1$ and $a_2$ during the second operation.
1. swap $a_k$ and $a_4$ ;
2. swap $a_2$ and $a_2$ ;
3. swap $a_5$ and $a_5$ .
In the second test case, only $k = 1$ and $k = 2$ are possible answers. To achieve $a_1 = 1$ , you have to swap $a_1$ and $a_1$ during the second operation. To achieve $a_2 = 1$ , you have to swap $a_1$ and $a_2$ during the second operation.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted