結果
問題 | No.2665 Minimize Inversions of Deque |
ユーザー | otera |
提出日時 | 2024-03-08 22:20:47 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 88 ms / 2,000 ms |
コード長 | 14,186 bytes |
コンパイル時間 | 2,109 ms |
コンパイル使用メモリ | 217,540 KB |
実行使用メモリ | 14,532 KB |
最終ジャッジ日時 | 2024-09-29 19:51:43 |
合計ジャッジ時間 | 5,964 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 40 |
ソースコード
/*** author: otera* created: 03.08.2024 21:23:28**/#include<bits/stdc++.h>#include <cassert>#include <vector>#include <cassert>#include <numeric>#include <type_traits>namespace atcoder {namespace internal {#ifndef _MSC_VERtemplate <class T>using is_signed_int128 =typename std::conditional<std::is_same<T, __int128_t>::value ||std::is_same<T, __int128>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int128 =typename std::conditional<std::is_same<T, __uint128_t>::value ||std::is_same<T, unsigned __int128>::value,std::true_type,std::false_type>::type;template <class T>using make_unsigned_int128 =typename std::conditional<std::is_same<T, __int128_t>::value,__uint128_t,unsigned __int128>;template <class T>using is_integral = typename std::conditional<std::is_integral<T>::value ||is_signed_int128<T>::value ||is_unsigned_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using is_signed_int = typename std::conditional<(is_integral<T>::value &&std::is_signed<T>::value) ||is_signed_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int =typename std::conditional<(is_integral<T>::value &&std::is_unsigned<T>::value) ||is_unsigned_int128<T>::value,std::true_type,std::false_type>::type;template <class T>using to_unsigned = typename std::conditional<is_signed_int128<T>::value,make_unsigned_int128<T>,typename std::conditional<std::is_signed<T>::value,std::make_unsigned<T>,std::common_type<T>>::type>::type;#elsetemplate <class T> using is_integral = typename std::is_integral<T>;template <class T>using is_signed_int =typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,std::true_type,std::false_type>::type;template <class T>using is_unsigned_int =typename std::conditional<is_integral<T>::value &&std::is_unsigned<T>::value,std::true_type,std::false_type>::type;template <class T>using to_unsigned = typename std::conditional<is_signed_int<T>::value,std::make_unsigned<T>,std::common_type<T>>::type;#endiftemplate <class T>using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;template <class T>using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;template <class T> using to_unsigned_t = typename to_unsigned<T>::type;} // namespace internal} // namespace atcodernamespace atcoder {template <class T> struct fenwick_tree {using U = internal::to_unsigned_t<T>;public:fenwick_tree() : _n(0) {}explicit fenwick_tree(int n) : _n(n), data(n) {}void add(int p, T x) {assert(0 <= p && p < _n);p++;while (p <= _n) {data[p - 1] += U(x);p += p & -p;}}T sum(int l, int r) {assert(0 <= l && l <= r && r <= _n);return sum(r) - sum(l);}private:int _n;std::vector<U> data;U sum(int r) {U s = 0;while (r > 0) {s += data[r - 1];r -= r & -r;}return s;}};} // namespace atcodernamespace otera {template <typename T>struct compressor {public:static constexpr int absent = -1;compressor() : _xs(std::vector<T>{}) {}compressor(const std::vector<T> &vs) {add(vs);build();}void add(const std::vector<T> &vs) {std::copy(vs.begin(), vs.end(), std::back_inserter(_xs));}void add(const T &e) {_xs.emplace_back(e);}void build() {std::sort(_xs.begin(), _xs.end());_xs.erase(std::unique(_xs.begin(), _xs.end()), _xs.end());}int size() const {return _xs.size();}bool has_key(const T &e) const {return std::binary_search(_xs.begin(), _xs.end(), e);}std::vector<int> get(const std::vector<T> &vs) const {std::vector<int> res;std::transform(vs.begin(), vs.end(), std::back_inserter(res), [&](const T &e) {return get(e);});return res;}int get(const T &e, int default_value = absent) const {const int id = min_geq_index(e);return id != size() and _xs[id] == e ? id : default_value;}const T &operator[](int compressed_index) const {return _xs[compressed_index];}T min_gt(const T &e, const T &default_value) const {auto it = std::upper_bound(_xs.begin(), _xs.end(), e);return it == _xs.end() ? default_value : *it;}T min_geq(const T &e, const T &default_value) const {auto it = std::lower_bound(_xs.begin(), _xs.end(), e);return it == _xs.end() ? default_value : *it;}T max_lt(const T &e, const T &default_value) const {auto it = std::lower_bound(_xs.begin(), _xs.end(), e);return it == _xs.begin() ? default_value : *std::prev(it);}T max_leq(const T &e, const T &default_value) const {auto it = std::upper_bound(_xs.begin(), _xs.end(), e);return it == _xs.begin() ? default_value : *std::prev(it);}int min_gt_index(const T &e) const {return std::upper_bound(_xs.begin(), _xs.end(), e) - _xs.begin();}int min_geq_index(const T &e) const {return std::lower_bound(_xs.begin(), _xs.end(), e) - _xs.begin();}int max_lt_index(const T &e) const {return int(std::lower_bound(_xs.begin(), _xs.end(), e)- _xs.begin()) - 1;}int max_leq_index(const T &e) const {return int(std::upper_bound(_xs.begin(), _xs.end(), e)- _xs.begin()) - 1;}private:std::vector<T> _xs;};} // namespace oteranamespace otera {template<typename T>long long inversion_number(std::vector<T> a) {int _n = (int)a.size();compressor<T> ca(a);int _sz = (int)ca.size();atcoder::fenwick_tree<T> bit(_sz);long long res = 0;for(int i = 0; i < _n; ++ i) {int _pos = ca.get(a[i]);res += (long long)bit.sum(_pos + 1, _sz);bit.add(_pos, 1);}return res;}} // namespace oteranamespace otera {}using namespace std;using namespace otera;struct io_setup {io_setup(int precision = 20) {ios::sync_with_stdio(false);cin.tie(0);cout << fixed << setprecision(precision);}} io_setup_ {};#define int long longusing ll = long long;using ld = long double;using ull = unsigned long long;using i128 = __int128_t;using u128 = __uint128_t;#define repa(i, n) for(int i = 0; i < (n); ++ i)#define repb(i, a, b) for(int i = (a); i < (b); ++ i)#define repc(i, a, b, c) for(int i = (a); i < (b); i += (c))#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)#define rep1a(i, n) for(int i = 1; i <= (n); ++ i)#define rep1b(i, a, b) for(int i = (a); i <= (b); ++ i)#define rep1c(i, a, b, c) for(int i = (a); i <= (b); i += (c))#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)#define rev_repa(i, n) for(int i=(n)-1;i>=0;i--)#define rev_repb(i, a, b) for(int i=(b)-1;i>=(a);i--)#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)#define rev_rep1a(i, n) for(int i=(n);i>=1;i--)#define rev_rep1b(i, a, b) for(int i=(b);i>=(a);i--)#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)#define for_subset(t, s) for(ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))typedef pair<int, int> P;typedef pair<ll, ll> LP;#define pb push_back#define pf push_front#define ppb pop_back#define ppf pop_front#define eb emplace_back#define mkp make_pair#define mkt make_tuple#define fr first#define sc second#define all(c) std::begin(c), std::end(c)#define rall(c) std::rbegin(c), std::rend(c)#define lb(c, x) distance(std::begin(c), lower_bound(all(c), (x)))#define ub(c, x) distance(std::begin(c), upper_bound(all(c), (x)))#define Sort(a) sort(all(a))#define Rev(a) reverse(all(a))#define Uniq(a) sort(all(a));(a).erase(unique(all(a)),std::end(a))#define si(c) (int)(c).size()inline ll popcnt(ull a){ return __builtin_popcountll(a); }#define kth_bit(x, k) ((x>>k)&1)#define unless(A) if(!(A))#define elif else ifll modulo(ll n, ll d){ return (n % d + d) % d; };ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }template <typename T> constexpr inline int pow_m1(T n) { return -(n & 1) | 1; }template <typename T> constexpr inline T fld(const T x, const T y) { return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y; }template <typename T> constexpr inline T cld(const T x, const T y) { return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y; }#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)#define vec(type,name,...) vector<type>name(__VA_ARGS__)#define VEC(type,name,size) vector<type>name(size);in(name)#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))template <class T> using vc = vector<T>;template <class T> using vvc = vector<vc<T>>;template <class T> using vvvc = vector<vvc<T>>;template <class T> using vvvvc = vector<vvvc<T>>;template <class T> using pq = priority_queue<T>;template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;template <class T, class U> using umap = unordered_map<T, U>;template<class T> void scan(T& a){ cin >> a; }template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }void in(){}template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }void print(){ cout << ' '; }template<class T> void print(const T& a){ cout << a; }template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }int out(){ cout << '\n'; return 0; }template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }#define CHOOSE(a) CHOOSE2 a#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x#define debug_1(x1) cout<<#x1<<": "<<x1<<endl#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl#ifdef DEBUG#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }#else#define debug(...)#define dump(...)#endifvoid solve() {INT(n);VEC(int, p, n);rep(i, n) {-- p[i];}atcoder::fenwick_tree<int> bit(n);deque<int> ans;rep(i, n) {int pre = bit.sum(0, p[i]);int post = bit.sum(p[i] + 1, n);if(pre == post) {if(ans.front() < p[i] + 1) {ans.push_back(p[i] + 1);} else {ans.push_front(p[i] + 1);}} else if(pre < post) {ans.push_front(p[i] + 1);} else {ans.push_back(p[i] + 1);}bit.add(p[i], 1);}vc<int> res;for(int x: ans) {res.eb(x);}int sum = inversion_number(res);out(sum);out(res);}signed main() {int testcase = 1;in(testcase);while(testcase--) solve();return 0;}