結果

問題 No.1240 Or Sum of Xor Pair
ユーザー 👑 tute7627tute7627
提出日時 2020-09-25 22:30:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 737 ms / 2,000 ms
コード長 5,787 bytes
コンパイル時間 2,121 ms
コンパイル使用メモリ 207,132 KB
実行使用メモリ 142,336 KB
最終ジャッジ日時 2024-06-28 06:57:02
合計ジャッジ時間 12,805 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 17 ms
13,056 KB
testcase_04 AC 16 ms
13,184 KB
testcase_05 AC 14 ms
12,032 KB
testcase_06 AC 13 ms
11,008 KB
testcase_07 AC 11 ms
9,856 KB
testcase_08 AC 11 ms
9,600 KB
testcase_09 AC 14 ms
11,776 KB
testcase_10 AC 73 ms
37,504 KB
testcase_11 AC 87 ms
42,112 KB
testcase_12 AC 137 ms
56,576 KB
testcase_13 AC 125 ms
51,456 KB
testcase_14 AC 138 ms
56,832 KB
testcase_15 AC 722 ms
132,096 KB
testcase_16 AC 646 ms
132,096 KB
testcase_17 AC 656 ms
132,224 KB
testcase_18 AC 687 ms
131,968 KB
testcase_19 AC 644 ms
132,096 KB
testcase_20 AC 683 ms
132,224 KB
testcase_21 AC 703 ms
132,096 KB
testcase_22 AC 737 ms
131,968 KB
testcase_23 AC 606 ms
132,096 KB
testcase_24 AC 677 ms
132,224 KB
testcase_25 AC 604 ms
132,224 KB
testcase_26 AC 699 ms
132,224 KB
testcase_27 AC 2 ms
5,376 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 183 ms
5,376 KB
testcase_30 AC 96 ms
5,376 KB
testcase_31 AC 110 ms
5,376 KB
testcase_32 AC 335 ms
142,336 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
template<typename T, typename S, int size = 30>
struct BinaryTrie{
  struct Node{
    Node* next[2];
    ll num;
    S sum;
    Node(S iden):num(0), sum(iden), next{nullptr, nullptr}{};
  };
  S iden;
  T rev;
  Node* root;
  bitset<size>bit,bit2;
  BinaryTrie(S iden):iden(iden){
    rev = 0;
    root = new Node(iden);
  }
  void insert(T x, ll add, S adds){
    Node* pos = root;
    bit = rev^x;
    for(int i=size-1;i>=0;i--){
      if(pos->next[bit[i]]==nullptr){
        pos->next[bit[i]] = new Node(iden);
      }
      pos->num += add;
      pos->sum += adds;
      pos = pos->next[bit[i]];
    }
    pos->num += add;
    pos->sum+=adds;
  }
  void erase(T x, ll add, S adds){
    Node* pos = root;
    bit = rev^x;
    for(int i=size-1;i>=0;i--){
      pos->num -= add;
      pos->sum -= adds;
      pos = pos->next[bit[i]];
    }
    pos->num -= add;
  }
  void xor_all(T x){
    rev ^= x;
  }
  T max_element(){
    Node* pos = root;
    bit = ~rev;
    T val = 0;
    for(ll i=size-1;i>=0;i--){
      if(pos->next[bit[i]] != nullptr && pos->next[bit[i]]->num >= 1){
        pos = pos->next[bit[i]];
        val ^= T(1) << i;
      }
      else pos = pos->next[!bit[i]];
    }
    return val ^ rev;
  }
  T min_element(){
    Node* pos = root;
    bit = rev;
    T val = 0;
    for(ll i=size-1;i>=0;i--){
      if(pos->next[bit[i]] != nullptr && pos->next[bit[i]]->num >= 1){
        pos = pos->next[bit[i]];
        
      }
      else{
        pos = pos->next[!bit[i]];
        val ^= 1 << i;
      }
    }
    return val;
  }
  T kth_element(ll k){//下からk番目、0-indexed
    Node* pos = root;
    bit = rev;
    T val = 0;
    for(ll i=size-1;i>=0;i--){
      if(pos->next[bit[i]] != nullptr && pos->next[bit[i]]->num > k){
        pos = pos->next[bit[i]];
      }
      else{
        if(pos->next[bit[i]] != nullptr)k -= pos->next[bit[i]]->num;
        val ^= T(1) << i;
        pos = pos->next[!bit[i]];
      }
    }
    return val ^ rev;
  }
  ll num_all(){
    return root->num;
  }
  S count_lower(T x){ //x未満のnumの合計
    Node* pos = root;
    S ret=iden;
    bit = rev;
    bit2 = x;
    for(ll i=size-1;i>=0;i--){
      if(bit2[i]&&pos->next[bit[i]] != nullptr)ret += pos->next[bit[i]]->sum;
      if(pos->next[bit2[i]^bit[i]] != nullptr)pos = pos->next[bit2[i]^bit[i]];
      else break;
    }
    return ret;
  }
  ll lower_bound(T x){ 
    ll idx = count_lower(x);
    if(idx == num_all())return -1;
    else return kth_element(idx);
  }
  ll upper_bound(T x){
    return lower_bound(x + 1);
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,x;cin>>n>>x;
  const ll sz=20;
  struct A{
    array<array<ll,2>,sz>ar;
    A &operator+=(A &x){
      rep(j,0,2)rep(i,0,sz)ar[i][j]+=x.ar[i][j];
      return *this;
    }
  };
  A iden;
  rep(i,0,sz)rep(j,0,2)iden.ar[i][j]=0;
  BinaryTrie<int,A,sz>tri(iden);
  vector<ll>a(n);
  rep(i,0,n){
    cin>>a[i];
    tri.xor_all(a[i]);
    auto t=tri.count_lower(x);
    tri.xor_all(a[i]);
    A ins=iden;
    rep(j,0,sz){
      res+=t.ar[j][1]*(1<<j);
      if(a[i]&1<<j){
        //cout<<j spa t.ar[j][0]<<endl;
        res+=t.ar[j][0]*(1<<j);
      }
      ins.ar[j][bool(a[i]&1<<j)]++;
    }
    //cout<<res<<endl;
    //rep(j,0,5)cout<<t.ar[j][0] spa t.ar[j][1]<<" ";cout<<endl;
    //rep(j,0,5)cout<<ins.ar[j][0] spa ins.ar[j][1]<<" ";cout<<endl;
    tri.insert(a[i],1,ins);
  }
  cout<<res<<endl;
  return 0;
}
0