#include<bits/stdc++.h>
using namespace std;
#define int long long int
void Solve(){
int n;
cin>>n;
vector<pair<int,int>> arr(n),brr(n);
vector<int> ans(n,0);
for(int i=0;i<n;i++){
cin>>arr[i].first;
arr[i].second=i;
}
for(int i=0;i<n;i++){
cin>>brr[i].first;
brr[i].second=i;
}
sort(arr.begin(),arr.end());
sort(brr.begin(),brr.end());
int i=n-1;
set<int> st;
for(i=n-1;i>=0;i--){
st.insert(arr[i].second);
st.insert(brr[i].second);
if(st.size()==(n-i))break;
}
for(int j=i;j<n;j++)ans[arr[j].second]=1;
for(auto i:ans)cout<<i;
cout<<endl;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int T=1;
cin>>T;
while(T--){
Solve();
}
return 0;
}
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |