Codeforces648div2B

最新推荐文章于 2023-06-27 22:37:20 发布

Luo_Xubo

最新推荐文章于 2023-06-27 22:37:20 发布

阅读量251

点赞数

分类专栏： Codeforces 文章标签：算法动态规划图论

本文链接：https://blog.csdn.net/Luo_Xubo/article/details/106611443

版权

Codeforces 专栏收录该内容

38 篇文章

订阅专栏

Codeforces648div2B

原题：

Ashish has n elements arranged in a line.

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).

思路：规律题，只要不全为零或不全为1就行，可以把那个不一样的当作跳板

ACcode：

#include <bits/stdc++.h>

using namespace std;
int a[60][60];
int main()
{
	int test=1;
	scanf("%d",&test);
	while(test--) {
		int n,a[505],b[505];
		cin>>n;
		bool flag=false;
		for(int i=0;i<n;i++) cin>>a[i];
		
		for(int j=0;j<n;j++) 
		{
			cin>>b[j];
			if(j>0&&b[j]!=b[j-1])
				flag = true;
		}
		if(is_sorted(a,a+n))
		{
			cout << "YES" << endl;
			continue;
		}
		cout << (flag?"YES":"NO") << endl;
	}
	return 0;
}