B. Trouble Sort
These elements are represented by two integers ai — the value of the element and bi — 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 ai.
He can perform the following operation any number of times:
Select any two elements i and j such that bi≠bj 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 ai after performing any number of operations.
Input
The first line contains one integer t (1≤t≤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≤n≤500) — the size of the arrays.
The second line contains n integers ai (1≤ai≤105) — the value of the i-th element.
The third line containts n integers bi (bi∈{0,1}) — the type of the i-th element.
Output
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).
Example
input
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
output
Yes
Yes
Yes
No
Yes
Note
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 bi≠bj. 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.
题意
类型有两种 0 或 1,只有不同类型的数组元素才可以交换,最后能交换成非递减序列输出 Yes,否则输出 No。
思路
Yes情况:
- 元素本身非递减。
- 0 和 1 各有一个,因为 0 和 1 可以任意交换,1 想去的位置可以通过 0,0 想去的位置可以通过 1。
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
typedef long long ll;
const int N = 510;
int a[N];
int main()
{
int t; cin >> t;
while (t--)
{
int n; cin >> n;
bool flag = false;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
if (a[i] < a[i - 1]) flag = true;
}
int b = 0, c = 0;
while (n--)
{
int x; cin >> x;
if (!x) b = 1;
else c = 1;
}
if (b && c || !flag) puts("Yes");
else puts("No");
}
return 0;
}