#1171755 (C++23) No.3590 I Love Inversions

• 問題: No.3590 I Love Inversions
• ユーザー: Taiki0715
• 提出日時: 2026-07-17 21:29:06
• 言語: C++23 (gcc 15.2.0 + boost 1.90.0)
• 結果: AC
• 実行時間: 2,129 ms / 5,000 ms
• コード長: 7,648 bytes
• コンパイル時間: 2,235 ms
• コンパイル使用メモリ: 338,084 KB
• 実行使用メモリ: 5,888 KB
• 平均クエリ数: 12104.46
• 最終ジャッジ日時: 2026-07-17 21:29:42
• 合計ジャッジ時間: 24,673 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge3_0

ファイルパターン	結果
other	AC * 43

ソースコード

#include <bits/stdc++.h>
using namespace std;
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 T1,typename T2,typename T3>istream &operator>>(istream &is,tuple<T1,T2,T3>&a){is>>std::get<0>(a)>>std::get<1>(a)>>std::get<2>(a);return is;}
template<typename T,size_t n>istream &operator>>(istream &is,array<T,n>&a){for(auto&i:a)is>>i;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 overload3(_1,_2,_3,name,...) name
#define rep1(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define reps(i,l,r) rep2(i,l,r)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)
#define yn(x) cout<<((x)?"Yes\n":"No\n")
#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())
template<typename T>
inline int fkey(vector<T>&z,T key){return lower_bound(z.begin(),z.end(),key)-z.begin();}
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;
}
#ifdef LOCAL
#include<debug.h>
#define SWITCH(a,b) (a)
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define SWITCH(a,b) (b)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
struct Timer{
  clock_t start;
  Timer(){
    start=clock();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout<<fixed<<setprecision(16);
  }
  inline double now(){return (double)(clock()-start)/1000;}
  #ifdef LOCAL
  ~Timer(){
    cerr<<"time:";
    cerr<<now();
    cerr<<"ms\n";
  }
  #endif
}timer;
void SOLVE();
int main(){
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
}
template<typename T>
long long inversion(const std::vector<T>&a){
  if(a.empty())return 0;
  std::vector<T>g[2];
  g[0].resize(a.size());
  g[1].resize(a.size());
  long long res=0;
  auto dfs=[&](auto self,int l,int r,int k)->void {
    if(l+1==r)g[k][l]=a[l];
    else{
      int mid=(l+r)/2;
      self(self,l,mid,k^1);
      self(self,mid,r,k^1);
      int lp=l,rp=mid,p=l;
      while(lp<mid||rp<r){
        if(rp==r||(lp<mid&&g[k^1][lp]<=g[k^1][rp]))g[k][p++]=g[k^1][lp++],res+=rp-mid;
        else g[k][p++]=g[k^1][rp++];
      }
    }
  };
  dfs(dfs,0,a.size(),0);
  return res;
}
template<typename T>
long long inversion(const std::vector<T>&a,const std::vector<T>&b){
  assert(a.size()==b.size());
  int n=a.size();
  std::vector<T>z(b);
  std::sort(z.begin(),z.end()),z.erase(std::unique(z.begin(),z.end()),z.end());
  std::vector<int>zb(n);
  std::vector<int>cnt(z.size());
  for(int i=0;i<n;i++)cnt[zb[i]=std::lower_bound(z.begin(),z.end(),b[i])-z.begin()]++;
  for(int i=1;i<(int)cnt.size();i++)cnt[i]+=cnt[i-1];
  std::vector<int>cnt2(cnt);
  std::vector<int>ord(n);
  for(int i=n-1;i>=0;i--)ord[--cnt[zb[i]]]=i;
  std::vector<int>za(n);
  for(int i=0;i<n;i++){
    int k=std::lower_bound(z.begin(),z.end(),a[i])-z.begin();
    if(k==(int)z.size()||z[k]!=a[i])return -1;
    za[i]=ord[cnt[k]++];
  }
  if(cnt!=cnt2)return -1;
  return inversion(za);
}
#include<type_traits>
#include<concepts>
template<typename T>
constexpr std::enable_if_t<std::numeric_limits<T>::digits<=32,int>msb(T n){return n==0?-1:31-__builtin_clz(n);}
template<typename T>
constexpr std::enable_if_t<(std::numeric_limits<T>::digits>32),int>msb(T n){return n==0?-1:63-__builtin_clzll(n);}

template<typename T>
constexpr std::enable_if_t<std::numeric_limits<T>::digits<=32,int>lsb(T n){return n==0?-1:__builtin_ctz(n);}
template<typename T>
constexpr std::enable_if_t<(std::numeric_limits<T>::digits>32),int>lsb(T n){return n==0?-1:__builtin_ctzll(n);}

template<typename T>
constexpr std::enable_if_t<std::is_integral_v<T>,T>floor_pow2(T n){return n==0?0:T(1)<<msb(n);}

template<typename T>
constexpr std::enable_if_t<std::is_integral_v<T>,T>ceil_pow2(T n){return n<=1?1:T(1)<<(msb(n-1)+1);}

template<std::integral T>
constexpr T safe_div(T a,T b){return a/b-(a%b&&(a^b)<0);}
template<std::integral T>
constexpr T safe_ceil(T a,T b){return a/b+(a%b&&(a^b)>0);}
template<typename M>
struct BinaryIndexedTree{
private:
  using S=typename M::S;
  std::vector<S>dat;
  int z;
public:
  BinaryIndexedTree(){}
  explicit BinaryIndexedTree(int n):z(ceil_pow2(n)),dat(n,M::e()){}
  explicit BinaryIndexedTree(const std::vector<S>&init):z(ceil_pow2((int)init.size())),dat(init){
    for(int i=0;i<(int)dat.size();i++){
      int j=i+((i+1)&-(i+1));
      if(j<(int)dat.size())dat[j]=M::op(dat[i],dat[j]);
    }
  }
  inline void add(int i,S x){
    while(i<(int)dat.size()){
      dat[i]=M::op(dat[i],x);
      i+=(i+1)&-(i+1);
    }
  }
  inline S sum(int i)const{
    S res=M::e();
    while(i>0){
      res+=dat[i-1];
      i-=i&-i;
    }
    return res;
  }
  inline S sum(int l,int r)const{
    S lp=M::e(),rp=M::e();
    while(l<r){
      rp=M::op(dat[r-1],rp);
      r-=r&-r;
    }
    while(r<l){
      lp=M::op(dat[l-1],lp);
      l-=l&-l;
    }
    return M::op(M::inverse(lp),rp);
  }
  int lower_bound(S k)const{
    int res=0;
    for(int i=z;i>=1;i>>=1){
      if(res+i<=(int)dat.size()&&dat[res+i-1]<k){
        k-=dat[res+i-1];
        res+=i;
      }
    }
    return res;
  }
  friend std::ostream &operator<<(std::ostream &os,const BinaryIndexedTree&bit){
    os<<"{";
    for(int i=0;i<(int)bit.dat.size();i++)os<<bit.sum(i,i+1)<<",}"[i+1==(int)bit.dat.size()];
    if(bit.dat.empty())os<<"}";
    return os;
  }
};
template<typename T=int>
struct MonoidAdd{
  using S=T;
  using F=std::nullptr_t;
  static inline S op(S x,S y){return x+y;}
  static inline S e(){return T();}
  static inline S mapping(F,const S&x,long long){return x;}
  static inline F composition(F,F){return nullptr;}
  static inline F id(){return nullptr;}
  static inline S inverse(S x){return -x;}
  static inline void revS(S&x){}
  static inline S pow(S x,long long p){return x*p;}
};
void SOLVE(){
  int n;
  cin>>n;
  #ifdef LOCAL
  vector<int>a(n);
  cin>>a;
  #endif
  auto query=[&](int l,int r)->ll {
    cout<<"? "<<l+1<<' '<<r<<endl;
    ll res;
    #ifdef LOCAL
    res=inversion<int>({a.begin()+l,a.begin()+r});
    #else
    cin>>res;
    #endif
    return res;
  };
  BinaryIndexedTree<MonoidAdd<int>>BIT(vector<int>(n,1));
  vector<ll>qres(n);
  rep(i,n)qres[i]=query(0,i+1);
  vector<int>ans(n);
  debug(qres);
  for(int i=n-1;i>=1;i--){
    ll r=qres[i],l=qres[i-1];
    ll diff=r-l;
    ll len=i+1;
    diff=len-diff-1;
    ll elem=BIT.lower_bound(diff+1);
    ans[i]=elem;
    debug(i,diff,elem);
    BIT.add(elem,-1);
  }
  rep(i,n)if(BIT.sum(i,i+1)==1)ans[0]=i;
  cout<<"!";
  rep(i,n)cout<<' '<<ans[i]+1;
  cout<<endl;
  #ifdef LOCAL
  assert(a==ans);
  #endif
}