結果

問題 No.1051 PQ Permutation
ユーザー kcvlex
提出日時 2020-05-08 22:53:54
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 269 ms / 2,000 ms
コード長 4,806 bytes
コンパイル時間 2,450 ms
コンパイル使用メモリ 165,032 KB
最終ジャッジ日時 2025-01-10 09:09:15
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#include <variant>
#define endl codeforces
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

vec<ll> solve() {
    auto emp = vec<ll>();
    ll n, p, q;
    std::cin >> n >> p >> q;
    p--; q--;
    vec<ll> pv(n);
    for (ll &e : pv) {
        std::cin >> e;
        e--;
    }

    auto ans1 = [&] {
        vec<ll> err(n, n);
        vec<ll> tmp;
        bool pf = false, qf = false;
        for (ll i = 0; i < n; i++) {
            ll e = pv[i];
            if (e == p) pf = true;
            if (e == q) qf = true;
            if (qf && !pf) return err;
            if (pf && e != p) tmp.push_back(e);
        }
        bool ok = std::next_permutation(ALL(tmp));
        if (!ok) return err;
        vec<ll> ret(n);
        ll idx = 0;
        for (; idx + tmp.size() < n; idx++) ret[idx] = pv[idx];
        for (ll i = 0; i < tmp.size(); i++) ret[idx + i] = tmp[i];
        return ret;
    }();

    std::set<ll> st;
    for (ll i = 0; i < n; i++) st.insert(i);
    vec<bool> used(n, false);
    std::stack<ll> stk;
    for (ll i = 0; i < n; i++) {
        ll e = pv[i];
        if (e != p && e != q) {
            used[e] = true;
            stk.push(e);
            st.erase(e);
            continue;
        }

        ll idx = i;
        while (true) {
            ll cur = pv[idx];
            ll val = -1;
            for (auto ite = st.upper_bound(cur); ite != st.end(); ++ite) {
                if (*ite == q) continue;
                val = *ite;
                break;
            }

            if (val != -1) {
                stk.push(val);
                used[val] = true;
                st.erase(val);
                break;
            }
            if (stk.empty()) return emp;
            ll e = stk.top();
            stk.pop();
            used[e] = false;
            st.insert(e);
            idx--;
        }
        break;
    }

    vec<ll> ans2(n);
    ll idx = stk.size();
    {
        ll tmp = idx;
        while (stk.size()) {
            ans2[tmp - 1] = stk.top();
            stk.pop();
            tmp--;
        }
    }

    while (st.size()) {
        auto ite = st.begin();
        if (*ite == q && !used[p]) ite = std::next(ite);
        ll e = *ite;
        ans2[idx++] = e;
        used[e] = true;
        st.erase(e);
    }

    return std::min(ans1, ans2);
}

int main() {
    auto ans = solve();
    if (ans.empty()) {
        std::cout << "-1\n";
    } else {
        ll n = ans.size();
        for (ll i = 0; i < n; i++) std::cout << ans[i] + 1 << " \n"[i + 1 == n];
    }
    return 0;
}
0