#479180 (C++14) No.1051 PQ Permutation

提出ソース

結果

問題	No.1051 PQ Permutation
ユーザー	haruki_K
提出日時	2020-05-08 23:15:36
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	83 ms / 2,000 ms
コード長	7,937 bytes
コンパイル時間	2,593 ms
コンパイル使用メモリ	179,332 KB
実行使用メモリ	12,880 KB
最終ジャッジ日時	2023-09-19 08:05:40
合計ジャッジ時間	6,636 ms
ジャッジサーバーID （参考情報）	judge15 / judge13

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,376 KB
testcase_01	AC	2 ms 4,380 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	2 ms 4,376 KB
testcase_04	AC	1 ms 4,380 KB
testcase_05	AC	1 ms 4,376 KB
testcase_06	AC	2 ms 4,380 KB
testcase_07	AC	2 ms 4,380 KB
testcase_08	AC	2 ms 4,380 KB
testcase_09	AC	2 ms 4,380 KB
testcase_10	AC	2 ms 4,384 KB
testcase_11	AC	2 ms 4,376 KB
testcase_12	AC	2 ms 4,380 KB
testcase_13	AC	1 ms 4,380 KB
testcase_14	AC	1 ms 4,384 KB
testcase_15	AC	73 ms 12,436 KB
testcase_16	AC	75 ms 12,484 KB
testcase_17	AC	40 ms 6,312 KB
testcase_18	AC	38 ms 6,128 KB
testcase_19	AC	39 ms 6,216 KB
testcase_20	AC	83 ms 12,512 KB
testcase_21	AC	80 ms 12,432 KB
testcase_22	AC	40 ms 6,276 KB
testcase_23	AC	80 ms 12,584 KB
testcase_24	AC	81 ms 12,620 KB
testcase_25	AC	7 ms 4,380 KB
testcase_26	AC	4 ms 4,380 KB
testcase_27	AC	2 ms 4,380 KB
testcase_28	AC	7 ms 4,380 KB
testcase_29	AC	3 ms 4,380 KB
testcase_30	AC	7 ms 4,380 KB
testcase_31	AC	3 ms 4,380 KB
testcase_32	AC	7 ms 4,380 KB
testcase_33	AC	2 ms 4,380 KB
testcase_34	AC	2 ms 4,376 KB
testcase_35	AC	20 ms 4,600 KB
testcase_36	AC	40 ms 7,876 KB
testcase_37	AC	23 ms 6,656 KB
testcase_38	AC	77 ms 12,440 KB
testcase_39	AC	46 ms 12,748 KB
testcase_40	AC	37 ms 6,260 KB
testcase_41	AC	78 ms 12,668 KB
testcase_42	AC	2 ms 4,380 KB
testcase_43	AC	2 ms 4,384 KB
testcase_44	AC	1 ms 4,380 KB
testcase_45	AC	2 ms 4,384 KB
testcase_46	AC	1 ms 4,376 KB
testcase_47	AC	2 ms 4,504 KB
testcase_48	AC	65 ms 12,880 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
// >>> segment tree
template <class Handler>
struct Segtree : Handler {
    using Value = typename Handler::Value;
    using Handler::unit; // () -> Value
    using Handler::merge; // (Value,Value) -> Value

    vector<Value> v; // use v[1..2*cap-1]
    int cap; // // capacity: power of 2
    int n; // original size

    Segtree() {}
    template <class... T> Segtree(T&&... x) { init(forward<T>(x)...); }

    template <class F, class = decltype(declval<F>()(0))>
    void init(int n, F gen)  {
        assert(n >= 0); this->n = n;
        cap = n; //for (cap = 1; cap < n; cap <<= 1) ;;
		v.resize(2*cap, unit());
        for (int i = 0; i < n; i++) v[cap+i] = gen(i);
        for (int i = cap-1; i >= 1; i--) v[i] = merge(v[2*i],v[2*i+1]);
    }
    void init(int n) { init(n, [&](int) { return unit(); }); }
    void init(int n, Value const& x) { init(n, [&](int) { return x; }); }
    void init(vector<Value> const& v) { init(v.size(), [&](int i) { return v[i]; }); }
    int size() const { return n; }

    void set(int i, Value const& x) {
        assert(0 <= i); assert(i < size());
        i += cap; v[i] = x;
        while (i > 1) i >>= 1, v[i] = merge(v[2*i],v[2*i+1]);
    }
    Value operator[](int i) const { return get(i); }
    Value get(int i) const {
        assert(0 <= i); assert(i < size());
        return v[cap + i];
    }
    // [l,r)
    Value get(int l, int r) const {
        assert(0 <= l); assert(l <= r); assert(r <= size());
        Value x = unit(), y = unit();
        for (l += cap, r += cap; l < r; l >>= 1, r >>= 1) {
            if (l&1) x = merge(x, v[l++]);
            if (r&1) y = merge(v[--r], y);
        }
        return merge(x,y);
    }
    vector<Value> dat() const {
        vector<Value> ret(size());
        for (int i = 0; i < size(); i++) ret[i] = get(i);
        return ret;
    }
};
// <<<

struct RangeMinPos {
    using Value = pair<int,int>;
    constexpr static Value unit() { return {INF,INF}; }
    constexpr static Value merge(Value x, Value y) { return min(x,y); }
};

int32_t main() {
    int n,p,q; cin >> n >> p >> q; p--,q--;
    vector<int> a(n); cin >> a;
    rep (i,n) a[i]--;

    {
        vector<int> c(n);
        rep (i,n) c[i] = n-1-i;
        if (a == c) quit(-1);

        dump(a);
        bool res = next_permutation(all(a));
        assert(res);
    }
    dump(a);

    {
        auto x = find(all(a),p)-a.begin();
        auto y = find(all(a),q)-a.begin();
        if (x < y) {
            rep (i,n) cout << a[i]+1 << " ";
            cout << endl;
            return 0;
        }
        if (q == n-1) {
            int ma = -1;
            loop (i,y+1,<n) chmax(ma,a[i]);
            repR (i,y) {
                if (a[i] > ma) {
                    chmax(ma,a[i]);
                } else {
                    int ma2 = -1, pos = -1;
                    loop (j,i+1,<n) {
                        if (a[j] != q && a[j] > a[i]) {
                            if (chmax(ma2, a[j])) pos = j;
                        }
                    }
                    assert(pos >= 0);
                    swap(a[i],a[pos]);
                    sort(a.begin()+i+1, a.end());
                    rep (i,n) cout << a[i]+1 << " ";
                    cout << endl;
                    return 0;
                }
            }
        }
    }
    Segtree<RangeMinPos> seg(n, [&](int i) { return mp(0,i); });
    vector<int> b(n);
    bool greater = false, exists_p = false;
    rep (i,n) {
        int l = (greater ? 0 : a[i]);
        rep (_,2) {
            auto val = seg.get(l,n);
            dump(i,l,val);
            if (val.fst > 0) quit(-1);

            int idx = val.snd;
            if (idx == q && !exists_p) {
                l = idx+1;
                continue;
            } else {
                b[i] = idx;
                if (idx == p) exists_p = true;
                if (!greater && a[i] < b[i]) greater = true;
                seg.set(idx,mp(1,idx));
                break;
            }
        }
    }
    dump(b);

    rep (i,n) cout << b[i]+1 << " ";
    cout << endl;
}

yukicoder

結果

テストケース

ソースコード