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

最新推荐文章于 2020-10-11 22:34:11 发布

weixin_43244265

最新推荐文章于 2020-10-11 22:34:11 发布

阅读量113

点赞数

分类专栏：题解

本文链接：https://blog.csdn.net/weixin_43244265/article/details/104494734

版权

题解专栏收录该内容

81 篇文章 1 订阅

订阅专栏

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
input
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
output
YES
NO
YES
YES
NO
YES

题意：给出有n个数的数组，再给出有m个数的数组p，a[p[i]]和a[p[i+1]]能交换，问最后能否得到不减序列

思路：跟冒泡排序过程一样，中间判断能不能交换就行

AC代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int a[110],b[110],v[110];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,m;
        int f=1;
        memset(v,0,sizeof(v));
        cin>>n>>m;
        for(int i=1;i<=n;i++)
            cin>>a[i];
        for(int i=1;i<=m;i++)
        {
            cin>>b[i];
            v[b[i]]=1;
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n-i;j++)
            {
                if(a[j]>a[j+1])
                {
                    if(v[j]==0)
                    {
                        f=0;
                    }
                    swap(a[j],a[j+1]);
                }
            }
        }
        if(f)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
}