結果

問題 No.1051 PQ Permutation
ユーザー SumitacchanSumitacchan
提出日時 2020-05-08 22:06:54
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 458 ms / 2,000 ms
コード長 3,627 bytes
コンパイル時間 1,899 ms
コンパイル使用メモリ 175,680 KB
実行使用メモリ 15,584 KB
最終ジャッジ日時 2023-09-19 07:38:52
合計ジャッジ時間 9,623 ms
ジャッジサーバーID
(参考情報)
judge12 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,384 KB
testcase_02 AC 2 ms
4,384 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 1 ms
4,384 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,384 KB
testcase_08 AC 2 ms
4,384 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 1 ms
4,384 KB
testcase_11 AC 1 ms
4,384 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 1 ms
4,384 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 136 ms
15,340 KB
testcase_16 AC 167 ms
15,336 KB
testcase_17 AC 448 ms
15,384 KB
testcase_18 AC 458 ms
15,452 KB
testcase_19 AC 451 ms
15,584 KB
testcase_20 AC 280 ms
15,448 KB
testcase_21 AC 267 ms
15,500 KB
testcase_22 AC 435 ms
15,440 KB
testcase_23 AC 272 ms
15,444 KB
testcase_24 AC 289 ms
15,388 KB
testcase_25 AC 14 ms
4,436 KB
testcase_26 AC 12 ms
4,380 KB
testcase_27 AC 3 ms
4,380 KB
testcase_28 AC 35 ms
5,012 KB
testcase_29 AC 11 ms
4,380 KB
testcase_30 AC 12 ms
4,384 KB
testcase_31 AC 5 ms
4,384 KB
testcase_32 AC 10 ms
4,380 KB
testcase_33 AC 5 ms
4,384 KB
testcase_34 AC 5 ms
4,384 KB
testcase_35 AC 72 ms
9,312 KB
testcase_36 AC 70 ms
9,316 KB
testcase_37 AC 113 ms
13,844 KB
testcase_38 AC 190 ms
15,424 KB
testcase_39 AC 101 ms
13,864 KB
testcase_40 AC 193 ms
15,448 KB
testcase_41 AC 188 ms
15,332 KB
testcase_42 AC 2 ms
4,380 KB
testcase_43 AC 2 ms
4,380 KB
testcase_44 AC 2 ms
4,380 KB
testcase_45 AC 1 ms
4,384 KB
testcase_46 AC 2 ms
4,380 KB
testcase_47 AC 2 ms
4,384 KB
testcase_48 AC 112 ms
13,736 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define Return(ans) { cout << (ans) << endl; return 0; }
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using Pdi = pair<double, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod



signed main(){

    int N, P, Q; cin >> N >> P >> Q;
    P--; Q--;
    vec A(N); cin >> A;
    REP(i, N) A[i]--;

    set<int> s;
    REP(i, N) if(i != Q) s.insert(i);
    
    int i0 = -1;
    REP(i, N){
        if(s.upper_bound(A[i]) != s.end()) i0 = i;
        
        if(s.count(A[i])){
            s.erase(A[i]);
            if(A[i] == P) s.insert(Q);
        }else break;
    }
    
    if(i0 == -1){
        Return(-1);
    }

    vec ans(N);
    s.erase(all(s));
    REP(i, N) if(i != Q) s.insert(i);
    REP(i, N){
        if(i < i0){
            ans[i] = A[i];
        }else if(i == i0){
            ans[i] = *(s.upper_bound(A[i]));
        }else{
            ans[i] = *(s.begin());
        }
        s.erase(ans[i]);
        if(ans[i] == P) s.insert(Q);
    }

    REP(i, N) cout << ans[i] + 1 << " ";
    cout << endl;

    return 0;
}
0