A13516 | Trouble Sort
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Ashish has $n$ elements arranged in a line.
These elements are represented by two integers $a_i$ — the value of the element and $b_i$ — the type of the element (there are only two possible types: $0$ and $1$ ). He wants to sort the elements in non-decreasing values of $a_i$ .
He can perform the following operation any number of times:
- Select any two elements $i$ and $j$ such that $b_i \ne b_j$ and swap them. That is, he can only swap two elements of different types in one move.
Tell him if he can sort the elements in non-decreasing values of $a_i$ after performing any number of operations.
These elements are represented by two integers $a_i$ — the value of the element and $b_i$ — the type of the element (there are only two possible types: $0$ and $1$ ). He wants to sort the elements in non-decreasing values of $a_i$ .
He can perform the following operation any number of times:
- Select any two elements $i$ and $j$ such that $b_i \ne b_j$ and swap them. That is, he can only swap two elements of different types in one move.
Tell him if he can sort the elements in non-decreasing values of $a_i$ after performing any number of operations.
输入格式
The first line contains one integer $t$ $(1 \le t \le 100)$ — the number of test cases. The description of the test cases follows.
The first line of each test case contains one integer $n$ $(1 \le n \le 500)$ — the size of the arrays.
The second line contains $n$ integers $a_i$ $(1 \le a_i \le 10^5)$ — the value of the $i$ -th element.
The third line containts $n$ integers $b_i$ $(b_i \in \{0, 1\})$ — the type of the $i$ -th element.
The first line of each test case contains one integer $n$ $(1 \le n \le 500)$ — the size of the arrays.
The second line contains $n$ integers $a_i$ $(1 \le a_i \le 10^5)$ — the value of the $i$ -th element.
The third line containts $n$ integers $b_i$ $(b_i \in \{0, 1\})$ — the type of the $i$ -th element.
输出格式
For each test case, print "Yes" or "No" (without quotes) depending on whether it is possible to sort elements in non-decreasing order of their value.
You may print each letter in any case (upper or lower).
You may print each letter in any case (upper or lower).
输入输出样例
输入 #1
5 4 10 20 20 30 0 1 0 1 3 3 1 2 0 1 1 4 2 2 4 8 1 1 1 1 3 5 15 4 0 0 0 4 20 10 100 50 1 0 0 1
输出 #1
Yes Yes Yes No Yes
For the first case: The elements are already in sorted order.
For the second case: Ashish may first swap elements at positions $1$ and $2$ , then swap elements at positions $2$ and $3$ .
For the third case: The elements are already in sorted order.
For the fourth case: No swap operations may be performed as there is no pair of elements $i$ and $j$ such that $b_i \ne b_j$ . The elements cannot be sorted.
For the fifth case: Ashish may swap elements at positions $3$ and $4$ , then elements at positions $1$ and $2$ .
For the second case: Ashish may first swap elements at positions $1$ and $2$ , then swap elements at positions $2$ and $3$ .
For the third case: The elements are already in sorted order.
For the fourth case: No swap operations may be performed as there is no pair of elements $i$ and $j$ such that $b_i \ne b_j$ . The elements cannot be sorted.
For the fifth case: Ashish may swap elements at positions $3$ and $4$ , then elements at positions $1$ and $2$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted