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

• 問題: No.2665 Minimize Inversions of Deque
• ユーザー: Taiki0715
• 提出日時: 2024-03-08 21:28:30
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 69 ms / 2,000 ms
• コード長: 3,090 bytes
• コンパイル時間: 5,312 ms
• コンパイル使用メモリ: 313,836 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2024-03-08 21:28:40
• 合計ジャッジ時間: 9,570 ms
• ジャッジサーバーID （参考情報）: judge14 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	69 ms; 6,676 KB
testcase_02	AC	66 ms; 6,676 KB
testcase_03	AC	63 ms; 6,676 KB
testcase_04	AC	63 ms; 6,676 KB
testcase_05	AC	62 ms; 6,676 KB
testcase_06	AC	63 ms; 6,676 KB
testcase_07	AC	63 ms; 6,676 KB
testcase_08	AC	64 ms; 6,676 KB
testcase_09	AC	63 ms; 6,676 KB
testcase_10	AC	63 ms; 6,676 KB
testcase_11	AC	63 ms; 6,676 KB
testcase_12	AC	62 ms; 6,676 KB
testcase_13	AC	63 ms; 6,676 KB
testcase_14	AC	63 ms; 6,676 KB
testcase_15	AC	63 ms; 6,676 KB
testcase_16	AC	62 ms; 6,676 KB
testcase_17	AC	63 ms; 6,676 KB
testcase_18	AC	63 ms; 6,676 KB
testcase_19	AC	10 ms; 6,676 KB
testcase_20	AC	3 ms; 6,676 KB
testcase_21	AC	3 ms; 6,676 KB
testcase_22	AC	3 ms; 6,676 KB
testcase_23	AC	3 ms; 6,676 KB
testcase_24	AC	3 ms; 6,676 KB
testcase_25	AC	3 ms; 6,676 KB
testcase_26	AC	3 ms; 6,676 KB
testcase_27	AC	3 ms; 6,676 KB
testcase_28	AC	3 ms; 6,676 KB
testcase_29	AC	3 ms; 6,676 KB
testcase_30	AC	46 ms; 6,676 KB
testcase_31	AC	43 ms; 6,676 KB
testcase_32	AC	44 ms; 6,676 KB
testcase_33	AC	45 ms; 6,676 KB
testcase_34	AC	42 ms; 6,676 KB
testcase_35	AC	43 ms; 6,676 KB
testcase_36	AC	44 ms; 6,676 KB
testcase_37	AC	42 ms; 6,676 KB
testcase_38	AC	45 ms; 6,676 KB
testcase_39	AC	47 ms; 6,676 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
template<typename T>
T bs(T ok,T ng,const auto &judge){
  static_assert(is_integral<T>::value||is_floating_point<T>::value);
  static_assert(is_convertible_v<decltype(judge),function<bool(T)>>);
  if constexpr(is_integral<T>::value){
    while(abs(ok-ng)>1){
      T mid=(ok>>1)+(ng>>1)+(ok&ng&1);
      (judge(mid)?ok:ng)=mid;
    }
    return ok;
  }
  else{
    for(int i=0;i<120;i++){
      T mid=(ok+ng)/2;
      (judge(mid)?ok:ng)=mid;
    }
    return ok;
  }
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(16);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
void SOLVE(){
  int n;
  cin>>n;
  vector<int>p(n);
  cin>>p;
  p--;
  deque<int>ans{p[0]};
  fenwick_tree<int>BIT(n);
  ll inv=0;
  BIT.add(p[0],1);
  reps(i,1,n){
    int le=BIT.sum(0,p[i]);
    int ge=BIT.sum(p[i]+1,n);
    if(le<ge)ans.push_front(p[i]),inv+=le;
    else if(le>ge)ans.push_back(p[i]),inv+=ge;
    else{
      if(ans[0]<p[i])ans.push_back(p[i]),inv+=le;
      else ans.push_front(p[i]),inv+=ge;
    }
    BIT.add(p[i],1);
  }
  cout<<inv<<endl;
  rep(i,n)cout<<ans[i]+1<<" \n"[i+1==n];
}