问了ai也找不出哪里re了，求调

#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<set>
using namespace std;
const int mod = 1e9 + 7;
//#define int long long
#define fo(i,a,n) for(int i=a;i<=n;i++)
int n, a, m;
bool is[100005];
void solve()
{
	queue<int>temp;
	cin >> n;
	fo(i, 1, n) { cin >> a; temp.push(a); }
	stack<int>r;
	while (n--)
	{
		cin >> a;
		if (is[a])
		{
			if (r.empty()||r.top() == a) { r.pop(); }
			else { cout << "No" << endl; return; }
		}
		else
		{
			while (!is[a])
			{
                if(temp.empty()){break;}
				is[temp.front()] = true;
				r.push(temp.front()); temp.pop();
			}
			r.pop();
		}
	}
	cout << "Yes" << endl;
    fo(i,1,100000){is[i]=false;}
}

signed main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int _;
	_ = 1;
	cin >> _;
	while (_--)
	{
		solve();
	}
	return 0;
}

//检查数组大小
//检查数组方括号内的内容
//检查l会不会写成1


/*
inline int read() >>读入优化
{
	int x=0; char ch=getchar();
	while (ch<'0' || ch>'9') ch=getchar();
	while (ch>='0' && ch<='9')
	{
		x=(x<<3)+(x<<1)+ch-48; ch=getchar();
	}
	return x;
}
inline void write(int x) >>输出优化
{
	 if(x<0) putchar('-'),x=-x;
	 if(x>9) write(x/10);
	 putchar(x%10+'0');
}

*/