HUD5821 Ball

Ball

                                                                           Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
                                                                                                Total Submission(s): 1083    Accepted Submission(s): 651
  

Problem Description

ZZX has a sequence of boxes numbered  1,2,...,n . Each box can contain at most one ball.

You are given the initial configuration of the balls. For  1≤i≤n , if the  i -th box is empty then  a[i]=0 , otherwise the i-th box contains exactly one ball, the color of which is a[i], a positive integer. Balls with the same color cannot be distinguished.

He will perform m operations in order. At the i-th operation, he collects all the balls from boxes l[i],l[i]+1,...,r[i]-1,r[i], and then arbitrarily put them back to these boxes. (Note that each box should always contain at most one ball)

He wants to change the configuration of the balls from a[1..n] to b[1..n] (given in the same format as a[1..n]), using these operations. Please tell him whether it is possible to achieve his goal.

 

Input

First line contains an integer t. Then t testcases follow. 
In each testcase: First line contains two integers n and m. Second line contains a[1],a[2],...,a[n]. Third line contains b[1],b[2],...,b[n]. Each of the next m lines contains two integers l[i],r[i].

1<=n<=1000,0<=m<=1000, sum of n over all testcases <=2000, sum of m over all testcases <=2000.

0<=a[i],b[i]<=n.

1<=l[i]<=r[i]<=n.

 

Output

For each testcase, print "Yes" or "No" in a line.

 

Sample Input

  
  

   
   5
4 1
0 0 1 1
0 1 1 1
1 4
4 1
0 0 1 1
0 0 2 2
1 4
4 2
1 0 0 0
0 0 0 1
1 3
3 4
4 2
1 0 0 0
0 0 0 1
3 4
1 3
5 2
1 1 2 2 0
2 2 1 1 0
1 3
2 4
  
  

 

Sample Output

  
  

   
   No
No
Yes
No
Yes
  
  

—————————————————————————————————

题目的意思是给出两个序列，和m次操作，每次操作可以把一段区间的数任意交换，稳能否变成第二个序列

思路：贪心，每个数对应下面的数肯定月左边越有利，所以先暴力配出一下判断每个数到达的位置，在每次操作只要把每段区间对应位置数排个序就好

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int a[1009],b[1009];
int u[1009],v[1009],vis[1009],x[1009];
int n,m;

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++) scanf("%d",&a[i]);
        for(int i=1;i<=n;i++) scanf("%d",&b[i]);
        memset(vis,0,sizeof vis);
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(a[i]==b[j]&&!vis[j]) {x[i]=j,vis[j]=1;break;}
        int flag=1;
        for(int i=1;i<=n;i++)
            if(!vis[i]) flag=0;
        for(int i=1;i<=m;i++) scanf("%d%d",&u[i],&v[i]);
        if(!flag) {printf("No\n");continue;}
        for(int i=1;i<=m;i++)
            sort(x+u[i],x+v[i]+1);
        for(int i=1;i<=n;i++)
            if(x[i]!=i) flag=0;
        if(flag) printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}