結果

問題 No.1051 PQ Permutation
ユーザー もりをもりを
提出日時 2020-05-08 22:38:58
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 443 ms / 2,000 ms
コード長 9,348 bytes
コンパイル時間 2,657 ms
コンパイル使用メモリ 211,120 KB
実行使用メモリ 22,556 KB
最終ジャッジ日時 2023-09-19 07:53:13
合計ジャッジ時間 9,847 ms
ジャッジサーバーID
(参考情報)
judge15 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 2 ms
4,380 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 2 ms
4,376 KB
testcase_14 AC 1 ms
4,376 KB
testcase_15 AC 156 ms
22,556 KB
testcase_16 AC 192 ms
22,108 KB
testcase_17 AC 439 ms
14,236 KB
testcase_18 AC 425 ms
14,308 KB
testcase_19 AC 435 ms
14,308 KB
testcase_20 AC 308 ms
19,864 KB
testcase_21 AC 289 ms
20,292 KB
testcase_22 AC 443 ms
14,232 KB
testcase_23 AC 298 ms
19,824 KB
testcase_24 AC 310 ms
19,708 KB
testcase_25 AC 13 ms
4,720 KB
testcase_26 AC 11 ms
4,376 KB
testcase_27 AC 2 ms
4,380 KB
testcase_28 AC 32 ms
4,920 KB
testcase_29 AC 10 ms
4,384 KB
testcase_30 AC 12 ms
4,840 KB
testcase_31 AC 4 ms
4,384 KB
testcase_32 AC 11 ms
4,872 KB
testcase_33 AC 5 ms
4,376 KB
testcase_34 AC 4 ms
4,380 KB
testcase_35 AC 70 ms
12,776 KB
testcase_36 AC 72 ms
13,452 KB
testcase_37 AC 102 ms
13,388 KB
testcase_38 AC 169 ms
14,232 KB
testcase_39 AC 94 ms
13,304 KB
testcase_40 AC 170 ms
13,384 KB
testcase_41 AC 169 ms
13,316 KB
testcase_42 AC 2 ms
4,380 KB
testcase_43 AC 1 ms
4,380 KB
testcase_44 AC 1 ms
4,380 KB
testcase_45 AC 2 ms
4,376 KB
testcase_46 AC 2 ms
4,380 KB
testcase_47 AC 2 ms
4,380 KB
testcase_48 AC 113 ms
13,400 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: 関数 ‘int main()’ 内:
main.cpp:157:23: 警告: ‘q_idx’ may be used uninitialized [-Wmaybe-uninitialized]
  157 |         if (Q == A[i] and p_idx > q_idx) break; // 必ず Q -> P
      |             ~~~~~~~~~~^~~~~~~~~~~~~~~~~
main.cpp:119:16: 備考: ‘q_idx’ はここで定義されています
  119 |     int p_idx, q_idx;
      |                ^~~~~
main.cpp:157:23: 警告: ‘p_idx’ may be used uninitialized [-Wmaybe-uninitialized]
  157 |         if (Q == A[i] and p_idx > q_idx) break; // 必ず Q -> P
      |             ~~~~~~~~~~^~~~~~~~~~~~~~~~~
main.cpp:119:9: 備考: ‘p_idx’ はここで定義されています
  119 |     int p_idx, q_idx;
      |         ^~~~~

ソースコード

diff #

// #pragma GCC target ("avx")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define endl '\n'

#pragma region TEMPLATE

/* TYPE */
typedef long long ll;       typedef long double ld;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
typedef vector<pii> vpii;   typedef vector<pll> vpll;
typedef vector<int> vi;     typedef vector<ll> vl;
typedef vector<string> vst; typedef vector<bool> vb;
typedef vector<ld> vld;     typedef vector<vector<int>> vvi;
template<typename T, typename Cmp = less<>> using prique = priority_queue<T, vector<T>, Cmp>;
template<typename T> using prique_r = prique<T, greater<>>;
/* CONSTANT */
#define ln '\n'
const int INF = 1 << 30;    const ll INFF = 1LL << 60;  const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int MOD = 1e9 + 7;    const int MODD = 998244353; const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const double EPS = 1e-9;    const ld PI = 3.14159265358979323846264338327950288;
const int dx[] = { 1, 0, -1,  0,  1, -1, -1, 1, 0 };
const int dy[] = { 0, 1,  0, -1, -1, -1,  1, 1, 0 };
/* CONTAINER */
#define PB              emplace_back
#define ALL(v)          (v).begin(), (v).end()
#define RALL(v)         (v).rbegin(), (v).rend()
#define SORT(v)         sort(ALL(v))
#define RSORT(v)        sort(RALL(v))
#define LESS(x, val)    (lower_bound(x.begin(), x.end(), val) - x.begin())
#define LEQ(x, val)     (upper_bound(x.begin(), x.end(), val) - x.begin())
#define GREATER(x, val) (int)(x).size() - LEQ((x), (val))
#define GEQ(x, val)     (int)(x).size() - LESS((x), (val))
#define UNIQUE(v)       sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end())
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }
template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) { u = U(v...); }
template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) { for (auto &e : u) fill_v<T>(e, v...); }
/* LOOP */
#define _overload3(_1, _2, _3, name, ...) name
#define _REP(i, n)      REPI(i, 0, n)
#define REPI(i, a, b)   for (ll i = (ll)a; i < (ll)b; ++i)
#define REP(...)        _overload3(__VA_ARGS__, REPI, _REP,)(__VA_ARGS__)
#define _RREP(i, n)     RREPI(i, n, 0)
#define RREPI(i, a, b)  for (ll i = (ll)a; i >= (ll)b; --i)
#define RREP(...)       _overload3(__VA_ARGS__, RREPI, _RREP,)(__VA_ARGS__)
#define EACH(e, v)      for (auto& e : v)
#define PERM(v)         sort(ALL(v)); for (bool c##p = true; c##p; c##p = next_permutation(ALL(v)))
/* INPUT */
template<typename T> void SSS(T& t) { cin >> t; }
template<typename Head, typename... Tail> void SSS(Head&& head, Tail&&... tail) { cin >> head; SSS(tail...); }
#define SS(T, ...)      T __VA_ARGS__; SSS(__VA_ARGS__);
#define SV(T, v, n)     vector<T> v(n); for (auto& i : v) cin >> i;
#define SVV(T, v, n, m) vector<vector<T>> v(n, vector<T>(m)); for (auto& r : v) for (auto& i : r) cin >> i;
/* OUTPUT */
// PROTOTYPE DECLARATION
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j);
template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t);
template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)> = nullptr> ostream& operator<<(ostream &os, const C &c);
template<typename T> ostream &operator<<(ostream &os, const stack<T> &j);
template<typename T> ostream &operator<<(ostream &os, const queue<T> &j);
template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j);
// IMPLEMENTATION
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j) { return os << '{' << j.first << ", " << j.second << '}'; }
template<size_t num = 0, typename... T> enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {}
template<size_t num = 0, typename... T> enable_if_t<num <  sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) { os << get<num>(t); if (num + 1 < sizeof...(T)) os << ", "; PRINT_TUPLE<num + 1>(os, t); }
template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { PRINT_TUPLE(os << '{', t); return os << '}'; }
template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)>> ostream& operator<<(ostream &os, const C &c) { os << '{'; for (auto it = begin(c); it != end(c); it++) { if (begin(c) != it) os << ", "; os << *it; } return os << '}'; }
template<typename T> ostream &operator<<(ostream &os, const stack<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top());  return os << d; }
template<typename T> ostream &operator<<(ostream &os, const queue<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_back(c.front()); return os << d; }
template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top());  return os << d; }
// OUTPUT FUNCTION
template<typename T> int PV(T &v) { int sz = v.size(); for (int i = 0; i < sz; ++i) cout << v[i] << " \n"[i == sz - 1]; return 0; }
inline int print() { cout << endl; return 0; }
template<typename Head> int print(Head&& head){ cout << head; return print(); }
template<typename Head, typename... Tail> int print(Head&& head, Tail&&... tail) { cout << head << " "; return print(forward<Tail>(tail)...); }
#ifdef LOCAL
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); }
#define debug(...) do {cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false)
#else
#define dump(...)
#define debug(...)
#endif
/* OTHER */
#define fi              first
#define se              second
#define MP              make_pair
#define MT              make_tuple
#define tmax(x, y, z)   max((x), max((y), (z)))
#define tmin(x, y, z)   min((x), min((y), (z)))
template<typename T, typename A, typename B> inline bool between(T x, A a, B b) { return ((a <= x) && (x < b)); }
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll POW(ll a, ll b)                    { ll r = 1; do { if (b & 1)  r *= a;        a *= a; }       while (b >>= 1); return r; }
inline ll MOP(ll a, ll b, const ll &m = MOD) { ll r = 1; do { if (b & 1) (r *= a) %= m; (a *= a) %= m; } while (b >>= 1); return r; }
struct abracadabra {
    abracadabra() {
        cin.tie(nullptr); ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
        cerr << fixed << setprecision(5);
    };
} ABRACADABRA;

#pragma endregion

signed main() {

    SS(int, N, P, Q);
    SV(int, A, N);

    int p_idx, q_idx;
    REP(i, N) {
        if (A[i] == P) p_idx = i;
        if (A[i] == Q) q_idx = i;
    }

    int ok = -1;
    int nxt = -1;

    set<int> cand;
    REP(i, N) cand.emplace(i + 1);

    // A[i] -> A[i] + 1 以上にする
    // i = N - 1は自明に不可能
    REP(i, N - 1) {
        if (p_idx < i) {    // すでにPが現れた
            // 何をしてもいい
            auto itr = cand.lower_bound(A[i] + 1);
            if (itr != cand.end()) {
                ok = i;
                nxt = *itr;
            }
        } else {            // まだ
            auto itr1 = cand.lower_bound(A[i] + 1);
            if (itr1 != cand.end()) {
                if (*itr1 == Q) {
                    auto itr2 = cand.lower_bound(Q + 1);
                    if (itr2 != cand.end()) {
                        ok = i;
                        nxt = *itr2;
                    }
                } else {
                    ok = i;
                    nxt = *itr1;
                }
            }
        }
        cand.erase(A[i]);
        if (Q == A[i] and p_idx > q_idx) break; // 必ず Q -> P
    }

    // print(ok, nxt);

    if (ok == -1) return print(-1);

    // okについて構築
    // okまではAとおなじ
    vector<int> B;
    set<int> st;    REP(i, N) st.emplace(i + 1);
    REP(i, ok) {
        B.emplace_back(A[i]);
        st.erase(A[i]);
    }
    B.emplace_back(nxt);
    st.erase(nxt);

    bool hasP = st.count(P) > 0;
    bool hasQ = st.count(Q) > 0;

    if (hasP and hasQ and P > Q) {
        bool wait = false;
        EACH(e, st) {
            if (e == Q) wait = true;
            else {
                B.emplace_back(e);
                if (e == P and wait) B.emplace_back(Q);
            }
        }
    } else {
        while (not st.empty()) {
            B.emplace_back(*st.begin());
            st.erase(st.begin());
        }
    }

    PV(B);

}
0