题解 100% AC

#include <bits/stdc++.h>
using namespace std;
int in[1010],out[1010];
int main(){
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>in[i];
    while(m--){
        for(int i=1;i<=n;i++)cin>>out[i];
        stack<int>stk;
        int cur=1;
        for(int i=1;i<=n;i++){
            stk.push(in[i]);
            for(;stk.size()&&stk.top()==out[cur];){
                stk.pop();
                cur++;
            }
        }
        if(stk.size()) cout<<"No"<<endl;
        else cout<<"Yes"<<endl;
    }
    
    return 0;
}