-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathB.cpp
96 lines (87 loc) · 1.34 KB
/
B.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
93
94
95
96
//#pragma GCC optimize "trapv"
#include<bits/stdc++.h>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
int main()
{ quick;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
bool ok=true;
ll a[n],b[n];
fab(0,n,i)
cin>>a[i];
fab(0,n,i)
cin>>b[i];
fab(1,n,i)
{
if(a[i]<a[i-1])
{ok=false;
break;}
}
if(ok or n==1)
{
cout<<"Yes\n";
continue;
}
int cnt1=0,cnt2=0;
fab(0,n,i)
{
if(b[i]==0)
cnt1++;
else
cnt2++;
/*ll small=1e9;
int ind=i;
fab(i,n,j)
{
if(small>a[j])
{
small=a[j];
ind=j;
}
}
if(ind==i)
{continue;
ok=true;
}
int tp=b[ind];
ok=false;
fab(i,n,j)
{
if(b[j]!=tp)
{
swap(b[j],b[ind]);
swap(a[j],a[ind]);
ok=true;
break;
}
}
if(!ok)
break;*/
}
if(cnt1>0 and cnt2>0)
cout<<"Yes\n";
else
cout<<"No\n";
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}