結果

問題 No.1051 PQ Permutation
コンテスト
ユーザー masayoshi361
提出日時 2020-05-08 22:23:51
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
WA  
実行時間 -
コード長 6,882 bytes
コンパイル時間 1,616 ms
コンパイル使用メモリ 177,884 KB
実行使用メモリ 15,764 KB
最終ジャッジ日時 2024-07-05 19:43:57
合計ジャッジ時間 4,848 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 41 WA * 5
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:177:13: warning: ‘qi’ may be used uninitialized in this function [-Wmaybe-uninitialized]
  177 |     int pi, qi;
      |             ^~
main.cpp:245:9: warning: ‘pi’ may be used uninitialized in this function [-Wmaybe-uninitialized]
  245 |         if(pi>qi){
      |         ^~

ソースコード

diff # 

//header
#ifdef LOCAL
    #include "cxx-prettyprint-master/prettyprint.hpp"
    #define debug(x) cout << x << endl
#else
    #define debug(...) 42
#endif
    #pragma GCC optimize("Ofast")
    #include <bits/stdc++.h>
    //types
    using namespace std;
    using ll = long long;
    using ld = long double;
    typedef pair < ll , ll > Pl;        
    typedef pair < int, int > Pi;
    typedef vector<ll> vl;
    typedef vector<int> vi;
    template< typename T >
    using mat = vector< vector< T > >;
    template< int mod >
    struct modint {
        int x;

        modint() : x(0) {}

        modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

        modint &operator+=(const modint &p) {
            if((x += p.x) >= mod) x -= mod;
            return *this;
        }

        modint &operator-=(const modint &p) {
            if((x += mod - p.x) >= mod) x -= mod;
            return *this;
        }

        modint &operator*=(const modint &p) {
            x = (int) (1LL * x * p.x % mod);
            return *this;
        }

        modint &operator/=(const modint &p) {
            *this *= p.inverse();
            return *this;
        }

        modint operator-() const { return modint(-x); }

        modint operator+(const modint &p) const { return modint(*this) += p; }

        modint operator-(const modint &p) const { return modint(*this) -= p; }

        modint operator*(const modint &p) const { return modint(*this) *= p; }

        modint operator/(const modint &p) const { return modint(*this) /= p; }

        bool operator==(const modint &p) const { return x == p.x; }

        bool operator!=(const modint &p) const { return x != p.x; }

        modint inverse() const {
            int a = x, b = mod, u = 1, v = 0, t;
            while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
            }
            return modint(u);
        }

        modint pow(int64_t n) const {
            modint ret(1), mul(x);
            while(n > 0) {
            if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
            }
            return ret;
        }

        friend ostream &operator<<(ostream &os, const modint &p) {
            return os << p.x;
        }

        friend istream &operator>>(istream &is, modint &a) {
            int64_t t;
            is >> t;
            a = modint< mod >(t);
            return (is);
        }

        static int get_mod() { return mod; }
    };
    //abreviations
    #define all(x) (x).begin(), (x).end()
    #define rall(x) (x).rbegin(), (x).rend()
    #define rep_(i, a_, b_, a, b, ...) for (int i = (a), max_i = (b); i < max_i; i++)
    #define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
    #define rev(i,n) for(int i=n-1;i>=0;i--)
    #define SZ(x) ((int)(x).size())
    #define pb(x) push_back(x)
    #define eb(x) emplace_back(x)
    #define mp make_pair
    #define print(x) cout << x << endl
    #define lsum(x) accumulate(x, 0LL)
    #define vmax(a) *max_element(all(a))
    #define vmin(a) *min_element(all(a))
    //functions
    ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
    ll lcm(ll a, ll b) { return a/gcd(a, b)*b;}
    template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
    template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
    template< typename T >
    T mypow(T x, ll n) {
        T ret = 1;
        while(n > 0) {
            if(n & 1) (ret *= x);
            (x *= x);
            n >>= 1;
        }
        return ret;
    }
    ll modpow(ll x, ll n, const ll mod) {
        ll ret = 1;
        while(n > 0) {
            if(n & 1) (ret *= x);
            (x *= x);
            n >>= 1;
            x%=mod;
            ret%=mod;
        }
        return ret;
    }
    uint64_t my_rand(void) {
        static uint64_t x = 88172645463325252ULL;
        x = x ^ (x << 13); x = x ^ (x >> 7);
        return x = x ^ (x << 17);
    }
    //graph template
    template< typename T >
    struct edge {
        int src, to;
        T cost;

        edge(int to, T cost) : src(-1), to(to), cost(cost) {}

        edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

        edge &operator=(const int &x) {
            to = x;
            return *this;
        }
        operator int() const { return to; }
    };
    template< typename T >
    using Edges = vector< edge< T > >;
    template< typename T >
    using WeightedGraph = vector< Edges< T > >;

//constant
#define INF 4001002003004005006LL
#define inf 1000000005
#define mod 1000000007LL
#define endl '\n'
typedef modint<mod> mint;
const long double eps = 0.001;
const long double PI  = 3.141592653589793;
//library
int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << setprecision(20);
    int n, p, q;cin>>n>>p>>q;
    p--; q--;
    vi a(n);
    int pi, qi;
    rep(i, n){
        cin>>a[i];
        a[i]--;
        if(a[i] == p)pi = i;
        if(a[i] == q)qi = i;
    }

    bool sorted = true;
    vi tail;
    int mx = -1;
    int index = -1;
    vl ans(n);
    set<int> s;
    if(pi<qi){
        rev(i, n){
            s.insert(a[i]);
            tail.pb(a[i]);
            chmax(mx, a[i]);
            if(a[i]!=mx)sorted = false;
            if(sorted)continue;
            auto iter = s.lower_bound(a[i]);
            iter++;
            if(*iter == q){
                if(q == mx)continue;
                iter++;
            }
            index = i;
            ans[index] = *iter;
            break;
        }
    }else{
        rep(i, qi+1, n){
            tail.pb(a[i]);
            s.insert(a[i]);
            chmax(mx, a[i]);
            if(mx != a[i])sorted = false;
        }
        rev(i, qi+1){
            tail.pb(a[i]);
            chmax(mx, a[i]);
            s.insert(a[i]);
            if(mx != a[i])sorted = false;
            if(sorted)continue;
            auto iter = s.lower_bound(a[i]);
            iter++;
            if(*iter == q){
                if(q == mx)continue;
                iter++;
            }
            index = i;
            ans[index] = *iter;
            break;
        }
    }
    if(index == -1)cout << -1 << endl;
    else{
        rep(i, index)ans[i] = a[i];
        s.erase(ans[index]);
        auto iter = s.begin();
        rep(i, index+1, n){
            ans[i] = *iter;
            iter++;
        }
        rep(i, n){
            if(ans[i] == p)pi = i;
            if(ans[i] == q)qi = i;
        }
        if(pi>qi){
            rep(i, n){
                if(ans[i]==q)continue;
                if(ans[i] == p)cout << p+1 << ' ' << q+1 << ' ';
                else cout << ans[i]+1 << ' ';
            }
            cout << endl;
        }else{
            rep(i, n)cout << ans[i]+1 << ' ';
            cout << endl;
        }
    }
    return 0;

}
0