結果

問題 No.2061 XOR Sort
ユーザー eQe
提出日時 2025-04-20 22:50:34
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 363 ms / 2,000 ms
コード長 6,620 bytes
コンパイル時間 6,744 ms
コンパイル使用メモリ 334,284 KB
実行使用メモリ 175,008 KB
最終ジャッジ日時 2025-04-20 22:50:47
合計ジャッジ時間 12,117 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
namespace my{
#define eb emplace_back
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define RDVL(T,n,...) vec<T>__VA_ARGS__;resizes({n},__VA_ARGS__);lin(__VA_ARGS__)
#define VL(n,...) RDVL(ll,n,__VA_ARGS__)
#define jo(a,b) a##b
#define FO_IMPL(n,c) for(ll jo(_i,c)=n;jo(_i,c)-->0;)
#define FO(n) FO_IMPL(n,__COUNTER__)
#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define of(i,...) for(auto[i,i##stop,i##step]=range(1,__VA_ARGS__);i>=i##stop;i+=i##step)
#define fe(a,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):a)
#define bit_sizeof(T) ll(sizeof(T)*CHAR_BIT)
#define schrodinger(p,c) (p?c:remove_cvref_t<decltype(c)>{})
#define base_operator(op,type) auto operator op(const type&v)const{auto copy=*this;return copy op##=v;}
#define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{
#define use_ml998244353 using ml=atcoder::modint998244353
auto&operator>>(istream&i,atcoder::modint998244353&x){int t;i>>t;x=t;return i;}
auto&operator<<(ostream&o,const atcoder::modint998244353&x){return o<<(int)x.val();}
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
using index_t=int;
constexpr auto range(ll s,ll b){ll a=0;if(s)swap(a,b);return array{a-s,b,1-s*2};}
constexpr auto range(ll s,ll a,ll b,ll c=1){return array{a-s,b,(1-s*2)*c};}
const string newline{char(10)};
const string space{char(32)};
constexpr auto pow(auto x,auto n,auto e){assert(n>=0);decltype(x)r=e;for(;n;x*=x,n>>=1)if(n&1)r*=x;return r;}
constexpr auto pow(auto x,auto n){return pow(x,n,1);}
constexpr auto at2(auto x,auto i){return x>>i&1;}

template<class A,class B>struct pair{
  A a;B b;
  pair()=default;
  pair(A a,B b):a(a),b(b){}
  pair(const std::pair<A,B>&p):a(p.first),b(p.second){}
  auto operator<=>(const pair&)const=default;
  pair operator+(const pair&p)const{return{a+p.a,b+p.b};}
  friend istream&operator>>(istream&i,pair&p){return i>>p.a>>p.b;}
  friend ostream&operator<<(ostream&o,const pair&p){return o<<p.a<<space<<p.b;}
};

template<class T>struct queue:std::queue<T>{
  queue(const initializer_list<T>&a={}){fe(a,e)this->emplace(e);}
  queue(const vector<T>&a){fe(a,e)this->emplace(e);}
  ll size()const{return std::queue<T>::size();}
  T pop(){T r=this->front();std::queue<T>::pop();return r;}
  T sum()const{T r{};fe(*this,e)r+=e;return r;}
  friend ostream&operator<<(ostream&o,queue q){while(q.size())o<<q.pop()<<schrodinger(q.size()>0,space);return o;}
};

template<class...A>using pack_back_t=tuple_element_t<sizeof...(A)-1,tuple<A...>>;

template<class V>concept vectorial=is_base_of_v<vector<typename remove_cvref_t<V>::value_type>,remove_cvref_t<V>>;
template<class V>constexpr int rank(){if constexpr(vectorial<V>)return rank<typename V::value_type>()+1;else return 0;}
template<class T>struct core_t_helper{using core_t=T;};
template<vectorial V>struct core_t_helper<V>{using core_t=typename core_t_helper<typename V::value_type>::core_t;};
template<class T>using core_t=core_t_helper<T>::core_t;
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>ostream&operator<<(ostream&o,const vector<V>&v){ll n=v.size();fo(i,n)o<<v[i]<<schrodinger(i<n-1,vectorial<V>?newline:space);return o;}

template<class V>struct vec;
template<int rank,class T>struct hvec_helper{using type=vec<typename hvec_helper<rank-1,T>::type>;};
template<class T>struct hvec_helper<0,T>{using type=T;};
template<int rank,class T>using hvec=typename hvec_helper<rank,T>::type;

template<class V>struct vec:vector<V>{
  static constexpr int R=rank<vec<V>>();
  using C=core_t<V>;
  using vector<V>::vector;
  vec(const vector<V>&v){vector<V>::operator=(v);}
  vec(const auto&...a)requires(sizeof...(a)>=3){resizes(a...);}
  void resizes(const auto&...a){*this=make(a...);}
  static auto make(ll n,const auto&...a){if constexpr(sizeof...(a)==1)return vec<C>(n,array{a...}[0]);else return vec<decltype(make(a...))>(n,make(a...));}

  vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;}
  vec&operator+=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]+=u[i];return v;}
  vec&operator-=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]-=u[i];return v;}
  vec&operator+=(const C&c){fe(*this,e)e+=c;return*this;}
  vec&operator*=(const C&c){fe(*this,e)e*=c;return*this;}
  base_operator(^,vec)
  base_operator(+,vec)
  base_operator(-,vec)
  base_operator(+,C);
  base_operator(*,C);

  vec&operator++(){fe(*this,e)++e;return*this;}
  vec&operator--(){fe(*this,e)--e;return*this;}

  ll size()const{return vector<V>::size();}

  auto scan(const auto&f)const{
    pair<C,bool>r{};
    fe(*this,e)if constexpr(!vectorial<V>)r.b?f(r.a,e),r:r={e,1};else if(auto s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;
    return r;
  }
  auto sum()const{return scan([](auto&a,const auto&b){a+=b;}).a;}
};
template<class...A>requires(sizeof...(A)>=2)vec(const A&...a)->vec<hvec<sizeof...(A)-2,pack_back_t<A...>>>;
vec(ll)->vec<ll>;

template<class...A>void resizes(const array<ll,common_type_t<A...>::R+1>&s,A&...a){(apply([&](const auto&...b){a.resizes(b...); },s),...);}

void lin(auto&...a){(cin>>...>>a);}

void pp(const auto&...a){ll n=sizeof...(a);((cout<<a<<schrodinger(--n>0,space)),...);cout<<newline;}

template<unsigned_integral T,ll B=bit_sizeof(T)>struct msb_first_binary_trie{
  struct node{
    array<index_t,2>child;
    vec<index_t>accept;
    index_t elem_count=0;
    node()=default;
  };
  vec<node>data;

  msb_first_binary_trie(const vec<ll>&a={}):data(1){fo(i,a.size())emplace(a[i],i);}

  ll size()const{return data[0].elem_count;}
  ll size(ll i)const{return i?data[i].elem_count:0;}

  bool is_branching(ll i)const{return data[i].child[0]&&data[i].child[1];}

  void emplace(T a,index_t id=-1){
    auto cu=0;
    of(k,B){
      auto x=at2(a,k);
      if(!data[cu].child[x]){
        data[cu].child[x]=data.size();
        data.eb();
      }
      cu=data[cu].child[x];
      data[cu].elem_count++;
    }
    data[cu].accept.eb(id);
  }
};

single_testcase
void solve(){
  LL(N);
  VL(N,a);

  constexpr ll B=bit_sizeof(uint32_t);
  msb_first_binary_trie<uint32_t>mbt(a);
  queue<pair<index_t,ll>>q{{0,0}};

  use_ml998244353;
  vec<ll>is_branching(B+1);
  while(q.size()){
    auto[cu,d]=q.pop();
    is_branching[d]|=mbt.is_branching(cu);
    fo(x,2)if(mbt.data[cu].child[x])q.emplace(mbt.data[cu].child[x],d+1);
  }
  pp(ml(2).pow(is_branching.sum()));
}}
0