Submission #16710181

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define Mod 1000000007
#define Max 1000001
#define vt vector<long long>

void func(){
    ll n;
    cin>>n;
    ll a[n];
    ll b[n];
    unordered_map<ll, ll>ma, mb;
    for(int i=0; i<n; i++){
        
        cin>>a[i];
        ma[a[i]]++;
    }
    for(int i=0; i<n; i++){
        cin>>b[i];
        mb[b[i]]++;
    }
    vector<ll>v;
    ll i=0;
    ll j=n-1;
    
    while(true){
        ll s=v.size();
        if(s==n)
        {
            break;
        }
        if(a[i]!=b[j] && mb[b[j]]!=0){
            v.push_back(b[j]);
            mb[b[j]]--;
            i++;
            j--;
        }
        else if(a[i]==b[j]){
            bool ok=false;
            for(int k=0; k<n; k++){
                if(a[i]!=b[k] && mb[b[k]]!=0){
                    v.push_back(b[k]);
                    mb[b[k]]--;
                    ok=true;
                    break;
                }
            }
            if(!ok){
                cout<<"No"<<endl;
                return;
            }
            i++;
        }
        else if(a[i]!=b[j] && mb[b[j]]==0){
            bool ok=false;
            for(int k=0; k<n; k++){
                if(a[i]!=b[k] && mb[b[k]]!=0){
                    v.push_back(b[k]);
                    mb[b[k]]--;
                    ok=true;
                    break;
                }
            }
            if(!ok){
                cout<<"No"<<endl;
                return;
            }
            i++;
        }
    }
    cout<<"Yes"<<endl;
    for(auto i: v){
        cout<<i<<" ";
    }
    cout<<endl;
}

int main(){
 
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
 

// 
// int t;
// cin >> t;
// for(ll i=1; i<=t; i++)
// {
    func();
//    cout<<endl;
//cout<<func()<<endl;
 
//if(func())
//    cout<<"Yes"<< endl;
//else
//    cout <<"No"<<endl; 
//cout<<"Case"<<" "<<"#"<<i<<":"<<" "<<func()<<endl;
// }
return 0;
}

Submission Info

Judge Result