#958379 (C++23) No.2665 Minimize Inversions of Deque

提出ソース

結果

問題	No.2665 Minimize Inversions of Deque
ユーザー	coindarw
提出日時	2024-03-08 21:23:29
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	41 ms / 2,000 ms
コード長	6,796 bytes
コンパイル時間	4,749 ms
コンパイル使用メモリ	312,932 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-09-29 18:57:01
合計ジャッジ時間	7,901 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,816 KB
testcase_01	AC	31 ms 6,816 KB
testcase_02	AC	30 ms 6,816 KB
testcase_03	AC	30 ms 6,816 KB
testcase_04	AC	28 ms 6,820 KB
testcase_05	AC	29 ms 6,816 KB
testcase_06	AC	28 ms 6,816 KB
testcase_07	AC	29 ms 6,816 KB
testcase_08	AC	29 ms 6,816 KB
testcase_09	AC	29 ms 6,816 KB
testcase_10	AC	30 ms 6,820 KB
testcase_11	AC	29 ms 6,816 KB
testcase_12	AC	29 ms 6,820 KB
testcase_13	AC	29 ms 6,816 KB
testcase_14	AC	29 ms 6,816 KB
testcase_15	AC	29 ms 6,816 KB
testcase_16	AC	29 ms 6,816 KB
testcase_17	AC	30 ms 6,820 KB
testcase_18	AC	29 ms 6,816 KB
testcase_19	AC	5 ms 6,816 KB
testcase_20	AC	2 ms 6,816 KB
testcase_21	AC	2 ms 6,816 KB
testcase_22	AC	2 ms 6,820 KB
testcase_23	AC	3 ms 6,820 KB
testcase_24	AC	2 ms 6,820 KB
testcase_25	AC	2 ms 6,816 KB
testcase_26	AC	3 ms 6,816 KB
testcase_27	AC	3 ms 6,820 KB
testcase_28	AC	2 ms 6,820 KB
testcase_29	AC	2 ms 6,820 KB
testcase_30	AC	38 ms 6,816 KB
testcase_31	AC	35 ms 6,816 KB
testcase_32	AC	36 ms 6,820 KB
testcase_33	AC	37 ms 6,816 KB
testcase_34	AC	35 ms 6,820 KB
testcase_35	AC	35 ms 6,820 KB
testcase_36	AC	35 ms 6,820 KB
testcase_37	AC	36 ms 6,816 KB
testcase_38	AC	41 ms 6,816 KB
testcase_39	AC	38 ms 6,820 KB

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

ソースコード

raw source code

#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>

#include <atcoder/all>
#else
#include <mylibs/all.h>
#endif

using ll = long long;
using lll = __int128_t;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define length(v) ((int)(v).size())
constexpr int inf = 2'000'000'000;
constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;

// clang-format off
#define Vec(type, ...) __make_vec<type>(__VA_ARGS__)
template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>
auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));}
#define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__)
template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);}
template <class T, T init, class... Ts>
auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));}

template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;}
inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); }
template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); }

template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {};
template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>;
template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value;
template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>;
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>;
template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;}
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;}
template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;}
template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;}
void inp() {}
template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);}
template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];}
template <typename T>void oup(const T& a) {cout << a << "\n";}
template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);}

inline string YESNO(bool cond) { return cond ? "YES" : "NO"; }inline string yesno(bool cond) { return cond ? "yes" : "no"; }inline string YesNo(bool cond) { return cond ? "Yes" : "No"; }
inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;}
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)
template <typename T>void debug_out(T t) {cerr << t << "\n";}
template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);}
#endif

#ifdef ONLINE_JUDGE
#define todo(...) static_assert(false)
#else
#define todo(...)
#endif
// clang-format on

template <typename T>
struct BIT {
    int n;
    vector<T> data;
    BIT(int n) : n(n), data(n + 1, 0) {}
    BIT() {}
    void add(int i, T x = 1) {
        for (i++; i <= n; i += (i & -i)) data[i] += x;
    }
    T sum(int i) {
        T s(0);
        for (i++; i; i -= (i & -i)) s += data[i];
        return s;
    }
    T sum(int l, int r) { return sum(r - 1) - sum(l - 1); }
    T get(int i) { return sum(i) - sum(i - 1); }

    int lower_bound(T w) {
        if (w <= 0) {
            return 0;
        }
        int x = 0, r = 1;
        while (r < n) r <<= 1;
        for (int len = r; len > 0; len >>= 1) {
            if (x + len <= n && data[x + len] < w) {
                w -= data[x + len];
                x += len;
            }
        }
        return x;
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int Q;
    inp(Q);

    while (Q--) {
        int n;
        inp(n);
        vector<int> a(n);
        inp(a);
        BIT<int> bit(n + 1);
        deque<int> ans;
        ll inv = 0;
        rep(i, n) {
            int ai = a[i];
            int less = bit.sum(ai);
            int more = i - less;
            bit.add(ai);
            if (less < more) {
                ans.push_front(ai);
                inv += less;
            } else if (less > more) {
                ans.push_back(ai);
                inv += more;
            } else if (less == more) {
                if (i == 0) {
                    ans.push_back(ai);
                } else {
                    if (ans.front() < ai) {
                        ans.push_back(ai);
                        inv += more;
                    } else {
                        ans.push_front(ai);
                        inv += less;
                    }
                }
            }
        }
        oup(inv);
        oup(ans);
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード