Codeforces Round #624 (Div. 3) B. WeirdSort

B. WeirdSort
time limit per test2 seconds
memory limit per test256 megabytes

Problem

You are given an array a of length n.

You are also given a set of distinct positions p1,p2,…,pm, where 1≤pi<n. The position pi means that you can swap elements a[pi] and a[pi+1]. You can apply this operation any number of times for each of the given positions.

Your task is to determine if it is possible to sort the initial array in non-decreasing order (a1≤a2≤⋯≤an) using only allowed swaps.

For example, if a=[3,2,1] and p=[1,2], then we can first swap elements a[2] and a[3] (because position 2 is contained in the given set p). We get the array a=[3,1,2]. Then we swap a[1] and a[2] (position 1 is also contained in p). We get the array a=[1,3,2]. Finally, we swap a[2] and a[3] again and get the array a=[1,2,3], sorted in non-decreasing order.

You can see that if a=[4,1,2,3] and p=[3,2] then you cannot sort the array.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1≤t≤100) — the number of test cases.

Then t test cases follow. The first line of each test case contains two integers n and m (1≤m<n≤100) — the number of elements in a and the number of elements in p. The second line of the test case contains n integers a1,a2,…,an (1≤ai≤100). The third line of the test case contains m integers p1,p2,…,pm (1≤pi<n, all pi are distinct) — the set of positions described in the problem statement.

Output

For each test case, print the answer — “YES” (without quotes) if you can sort the initial array in non-decreasing order (a1≤a2≤⋯≤an) using only allowed swaps. Otherwise, print “NO”.

Example

inputCopy

6
3 2
3 2 1
1 2
4 2
4 1 2 3
3 2
5 1
1 2 3 4 5
1
4 2
2 1 4 3
1 3
4 2
4 3 2 1
1 3
5 2
2 1 2 3 3
1 4

outputCopy

YES
NO
YES
YES
NO
YES

解释说明

题目是说，a 数组 在 p 数组内存储的所有位置可以和其后一位交换数值，采用模拟的方法，对 p 数组的值进行排序之后，对每一个可交换数值的位置进行部分排序，由题目可知，最多进行 n 次足可（也可以在遇到一次需要交换位置的时候，便回到第一位重新开始，以避免后面的数组过小影响了前面的数据，代码为代码2），模拟结束后，用C++的函数“is_sorted()”来判断是否有序，若有序，输出“YES”，否则，输出“NO”。

代码1

#include<bits/stdc++.h>
using namespace std;

int main(){
	int t;
	cin>>t;
	while(t--)
	{
		int n,m;
		cin>>n>>m;
		int a[n],p[m];
		for(int i=0;i<n;i++)    cin>>a[i]; 
		for(int j=0;j<m;j++)	cin>>p[j]; 
		sort(p,p+m);
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				if(a[p[j]]<a[p[j]-1])
					swap(a[p[j]],a[p[j]-1]); 
			}
		}
		if(is_sorted(a,a+n))
		cout<<"YES"<<endl;
		else
		cout<<"NO"<<endl;
		}
}

代码2

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int t,n,m;
int a[200],q[200],c[200];
int vis[200];
int main()
{
	cin>>t;
	while(t--)
	{
		memset(vis,0,sizeof(vis));
		cin>>n>>m;
		for(int i=1;i<=n;i++)cin>>a[i];
		for(int i=1;i<=m;i++)cin>>q[i],vis[q[i]]=1;
		int f=1;
		for(int i=1;i<n;i++)
		{
			if(a[i]>a[i+1]&&vis[i]) swap(a[i],a[i+1]),i=1;
			if(a[i]>a[i+1]&&!vis[i]){
				f=0;break;
			} 
		}
		f==1?cout<<"YES\n":cout<<"NO\n";
	}
}