Problem:
Score : 600 points

Problem Statement

Given are two sequences A and B, both of length N.
A and B are each sorted in the ascending order.
Check if it is possible to reorder the terms of B so that for each i (1 \leq i \leq N) A_i \neq B_i holds, and if it is possible, output any of the reorderings that achieve it.

Constraints

1\leq N \leq 2 \times 10^5

1\leq A_i,B_i \leq N

A and B are each sorted in the ascending order.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 \cdots A_N
B_1 B_2 \cdots B_N

Output

If there exist no reorderings that satisfy the condition, print No.

If there exists a reordering that satisfies the condition, print Yes on the first line.
After that, print a reordering of B on the second line, separating terms with a whitespace.

If there are multiple reorderings that satisfy the condition, you can print any of them.

Sample Input 1

6
1 1 1 2 2 3
1 1 1 2 2 3

Sample Output 1

Yes
2 2 3 1 1 1

Sample Input 2

3
1 1 2
1 1 3

Sample Output 2

No

Sample Input 3

4
1 1 2 3
1 2 3 3

Sample Output 3

Yes
3 3 1 2

Solution in C++ (GCC 9.2.1) (judge verdict: Accepted)

/* #region Head */

// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

/* #region rand */

// [lb, ub] の値を等確率で発生させる
class Rand {
    using dist_type = std::uniform_int_distribution<>;

    ll _lb;
    ll _ub;
    std::random_device rd; // Will be used to obtain a seed for the random number engine
    std::mt19937 gen;      // Standard mersenne_twister_engine seeded with rd()
    dist_type dis;

  public:
    Rand(ll lb, ll ub) : _lb(lb), _ub(ub), rd(), gen(rd()), dis(lb, ub) {}
    inline int operator()() noexcept { return dis(gen); }
    inline void set_param(ll lb, ll ub) noexcept {
        if (lb == _lb && ub == _ub) return;
        dist_type::param_type param(lb, ub);
        dis.param(param);
    }
};

// [lb, ub) の値を等確率で発生させる
class RandDouble {
    std::random_device seed_gen;
    std::default_random_engine engine;
    std::uniform_real_distribution<> dist;

  public:
    RandDouble(double lb, double ub) : seed_gen(), engine(seed_gen()), dist(lb, ub) {}
    inline double operator()() noexcept { return dist(engine); }
};

/* #endregion */

/* #region Anneal */

// 誰でもできる焼きなまし法 - gasin’s blog http://gasin.hatenadiary.jp/entry/2019/09/03/162613
struct Anneal {
    using clk = chrono::system_clock;

    double timespan_ms; // 焼きなます時間
    double start_temp;  // 開始温度 (一回の遷移で動きうるスコア幅の最大値程度)
    double end_temp;    // 終了温度 (一回の遷移で動きうるスコア幅の最小値程度)
    RandDouble rd;
    clk::time_point start_time;
    double ms_elapsed;

    // コンストラクタ
    Anneal(double timespan_ms, double start_temp, double end_temp)
        : timespan_ms(timespan_ms), start_temp(start_temp), end_temp(end_temp), rd(0, 1), start_time(clk::now()),
          ms_elapsed(0) {}

    // スコアの差分から，遷移するかどうかを確率的に決定して返す
    inline bool transit(double dif) noexcept {
        clk::time_point cur_time = clk::now();
        ms_elapsed =
            static_cast<double>(chrono::duration_cast<chrono::microseconds>(cur_time - start_time).count() / 1000.0);
        // 温度関数
        double temperature = start_temp + (end_temp - start_temp) * (ms_elapsed / timespan_ms);
        // 遷移確率関数(最大化の場合)
        double prob = exp((double)dif / temperature);

        // cout << dif, prob, '\n';
        return prob > rd();
    }

    // transit の山登り版
    inline bool climb(double dif) noexcept {
        clk::time_point cur_time = clk::now();
        ms_elapsed =
            static_cast<double>(chrono::duration_cast<chrono::microseconds>(cur_time - start_time).count() / 1000.0);
        return dif > 0;
    }

    // 時間切れかどうかを返す
    inline bool runnable() noexcept { return ms_elapsed < timespan_ms; }
};

/* #endregion */

// https://atcoder.jp/contests/abc178/submissions/16737446
// 「片方はダメな状態になっているものの中から選ぶ」方法
// https://twitter.com/chokudai/status/1305160143345053701
// 「0〜n-1 の順列」を用意する．
// 先頭 k 個の区間が「ダメな状態になっている箇所のインデックス」を格納する場所ということにする
class WantArray {
    using IntPredicate = function<bool(int)>;
    int n;
    vc<int> index;
    int k;

    void _swap(const int i, const int j) { swap(index[i], index[j]); }

  public:
    WantArray(const int n, IntPredicate want) : n(n), index(n), k(0) {
        iota(ALL(index), 0);
        set(want);
    }

    int get(int i) const noexcept { return index[i]; }

    void set(IntPredicate want) noexcept {
        k = 0;
        for (int i = n - 1; i >= k;) {
            if (want(index[i])) {
                _swap(i, k++);
            } else {
                --i;
            }
        }
    }

    void set(int i, bool want) noexcept {
        if (i < k) {
            if (want) return;
            _swap(i, --k);
        } else {
            if (want) {
                _swap(i, k++);
            } else
                return;
        }
    }

    void set(int i, int j, IntPredicate want) noexcept {
        if (i < k) {
            if (!want(index[i])) {
                _swap(i, --k);
                if (j == k) j = i;
            }
        } else {
            if (want(index[i])) {
                _swap(i, k);
                if (j == k++) j = i;
            }
        }
        set(j, want(index[j]));
    }

    int want() const noexcept { return k; }
};

// Problem
void solve() {
    ll n;
    cin >> n;
    vll a(n), b(n);
    cin >> a, b;

    reverse(ALL(b));
    ll cnt = 0;
    REP(i, 0, n) if (a[i] == b[i]) cnt++;
    if (cnt == 0) {
        Yn(true);
        cout >> b;
        return;
    }

    if (cnt * 2 > n) {
        Yn(false);
        return;
    }
    ll score = n - cnt;

    auto pred = [&](int i) -> bool { return a[i] == b[i]; };
    WantArray want(n, pred);

    Rand rand_want(0, cnt);
    Rand rand_all(0, n - 2);

    double timespan_ms = 1950.0; // 焼きなます時間
    double start_temp = 1.0;     // 開始温度 (一回の遷移で動きうるスコア幅の最大値程度);
    double end_temp = 0.01;      // 終了温度 (一回の遷移で動きうるスコア幅の最小値程度);
    Anneal anneal(timespan_ms, start_temp, end_temp);

    while (anneal.runnable()) {
        int idx_want = rand_want();
        int idx_all = rand_all();
        if (idx_all >= idx_want) idx_all++; // 重複回避用

        int idx_want2 = want.get(idx_want);
        int idx_all2 = want.get(idx_all);

        int diff = 0;
        // 競合していなかった部分を破壊するときはスコアを減ずる
        if (a[idx_want2] != b[idx_want2]) --diff;
        if (a[idx_all2] != b[idx_all2]) --diff;
        // swap 結果が競合していなければスコアに加算する
        if (a[idx_want2] != b[idx_all2]) ++diff;
        if (a[idx_all2] != b[idx_want2]) ++diff;

        // 焼き鈍し: transit(dif)
        // 山登り:  climb(dif)
        if (anneal.transit(diff)) {
            swap(b[idx_want2], b[idx_all2]); //
            want.set(idx_want, idx_all, pred);
            score += diff;
            if (score == n) break;
        }
    }

    if (score < n) {
        Yn(false);
        return;
    }
    Yn(true);
    cout >> b;
}

// entry point
int main() {
    solve();
    return 0;
}