P4387，0分，样例过

代码

#include<bits/stdc++.h>
using namespace std;
int n,a[100005],b,c;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		stack<int>op;
		queue<int>genshin;
		for(int j=1;j<=a[i];j++)
		{
			cin>>b;	
			op.push(b);
		}	
		for(int j=1;j<=a[i];j++)
		{
			cin>>c;
			genshin.push(c);
		}
		for(int j=1;j<=a[i];j++)
		{
			if(!op.empty())
			{
				if(op.top()!=genshin.front())
				{
					op.pop();
					genshin.pop();
				}
			}	
			else
			{
				break;
			}
		}
		if(op.empty())
		{
			cout<<"No"<<endl;
		}
		else
		{
			cout<<"Yes"<<endl;
		}
	} 
	return 0;
}