-
Notifications
You must be signed in to change notification settings - Fork 10
/
HackerEarth Permutation Swaps.cpp
92 lines (84 loc) · 2.39 KB
/
HackerEarth Permutation Swaps.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
/*
U have option to make swap of some given indices .Now Will u be able to make swaps to make second array from first array ?
if (1,2) and (2,5) (2, 4) are allowed swapping indices then u can see that one(1) index element can go four(4) index also by double swapping,beacuse these are connected components!!
That means all given indices should be taken as a graph .Then take all elements of connected components and compare connected elements of arr1 to arr2
Obviously it should be same for all element . Now go and code
*/
#include<bits/stdc++.h>
using namespace std;
const int mx=1e5+1;
bool visited[mx];
int firstarr[mx];
int secondarr[mx];
vector<int> swappable_elemnts_of_first;
vector<int> swappable_elemnts_of_second;
vector<int>v[mx];
void dfs(int i)
{
visited[i]=true;
swappable_elemnts_of_first.push_back(firstarr[i]);
swappable_elemnts_of_second.push_back(secondarr[i]);
vector<int>::iterator it;
for(it=v[i].begin();it!=v[i].end();it++)
{
if(!visited[(*it)])
{
dfs((*it));
}
}
}
int main()
{
int t,n,m,a,b;
cin>>t;
while(t--)
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>firstarr[i];
}
for(int j=1;j<=n;j++)
{
cin>>secondarr[j];
}
while(m--)
{
cin>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
memset(visited,false,sizeof(visited));
bool ok=true;
for(int k=1;k<=n;k++)
{
if(!visited[k])
{
swappable_elemnts_of_first.clear();
swappable_elemnts_of_second.clear();
dfs(k);
sort(swappable_elemnts_of_first.begin(),swappable_elemnts_of_first.end());
sort(swappable_elemnts_of_second.begin(),swappable_elemnts_of_second.end());
if(swappable_elemnts_of_first!=swappable_elemnts_of_second)
{
ok=false;
//cout<<"NO"<<endl;
break;
}
}
}
if(ok)
{
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}
for(int p=1;p<=n;p++)
{
v[p].clear();
}
}
return 0;
}