結果

問題 No.1051 PQ Permutation
コンテスト
ユーザー ningenMe
提出日時 2020-05-09 14:24:55
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,961 bytes
コンパイル時間 2,549 ms
コンパイル使用メモリ 209,456 KB
最終ジャッジ日時 2025-01-10 09:49:22
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 32 WA * 14
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:52:9: warning: ‘px’ may be used uninitialized [-Wmaybe-uninitialized]
   52 |         if(px<qx){
      |         ^~
main.cpp:47:13: note: ‘px’ was declared here
   47 |         int px,qx;
      |             ^~
main.cpp:52:9: warning: ‘qx’ may be used uninitialized [-Wmaybe-uninitialized]
   52 |         if(px<qx){
      |         ^~
main.cpp:47:16: note: ‘qx’ was declared here
   47 |         int px,qx;
      |                ^~
main.cpp:67:13: warning: ‘qx’ may be used uninitialized [-Wmaybe-uninitialized]
   67 |     for(int i = qx+1; i < N; ++i) {
      |             ^
main.cpp:61:12: note: ‘qx’ was declared here
   61 |     int px,qx;
      |            ^~

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    int N,P,Q; cin >> N >> P >> Q;
    vector<int> A(N);
    for(int i = 0; i < N; ++i) {
        cin >> A[i];
    }
    auto B = A;
    auto C = A;
    int cnt=0;
    while (next_permutation(ALL(A))){
        cnt++;
        if(cnt*N >= 10000000) break;
        int px,qx;
        for(int i = 0; i < N; ++i) {
            if(P==A[i]) px=i;
            if(Q==A[i]) qx=i;
        }
        if(px<qx){
            for(int i = 0; i < N; ++i){
                cout << A[i] << " ";
            }
            cout << endl;
            return 0;
        }
    }
    corner(!next_permutation(ALL(B)),-1);
    int px,qx;
    for(int i = 0; i < N; ++i) {
        if(P==B[i]) px=i;
        if(Q==B[i]) qx=i;
    }
    set<int> st;
    for(int i = qx+1; i < N; ++i) {
        st.insert(B[i]);
    }
    int s=-1;
    for(int i = qx-1; 0 <= i; --i) {
        if(*st.rbegin()>B[i]){
            s=i;
            break;
        }
        st.insert(B[i]);
    }
    corner(s==-1,-1);
    vector<int> ans;
    for(int i = 0; i < s; ++i) {
        ans.push_back(B[i]);
    }
    int r = *st.lower_bound(B[s]);
    ans.push_back(r);
    st.erase(r);
    st.insert(B[s]);
    for(auto e:st){
        ans.push_back(e);
    }
    ans.push_back(Q);
    int t = 0;
    for(int i = 0; i < N; ++i){
        if(P==ans[i]) t=i;
    }
    sort(ans.begin()+t+1,ans.end());
    for(int i = 0; i < N; ++i){
        cout << ans[i] << " ";
    }
    cout << endl;

    return 0;
}
0