結果

問題 No.1240 Or Sum of Xor Pair
コンテスト
ユーザー heno239
提出日時 2020-11-18 21:24:23
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 531 ms / 2,000 ms
コード長 4,761 bytes
コンパイル時間 2,522 ms
コンパイル使用メモリ 125,692 KB
実行使用メモリ 51,904 KB
最終ジャッジ日時 2024-07-23 09:11:16
合計ジャッジ時間 10,814 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
struct modint {
    ll n;
    modint() :n(0) { ; }
    modint(ll m) :n(m) {
        if (n >= mod)n %= mod;
        else if (n < 0)n = (n % mod + mod) % mod;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}


struct Node {
    Node* ch[2];
    int cnt[18];
    int num;
    Node() {
        rep(i, 2)ch[i] = NULL; rep(i, 18)cnt[i] = 0; num = 0;
    }
};

void add(Node* nd,int x) {
    nd->num++;
    rep(i, 18) {
        if (x & (1 << i))nd->cnt[i]++;
    }
    per(i, 18) {
        int t = 0;
        if (x & (1 << i)) {
            t = 1;
        }
        if (nd->ch[t] == NULL)nd->ch[t] = new Node();
        nd = nd->ch[t];
        nd->num++;
        rep(j, 18) {
            if (x & (1 << j))nd->cnt[j]++;
        }
    }
}

int s;
ll query(Node* nd, int x) {
    ll res = 0;
    if (s == (1 << 18)) {
        rep(j, 18) {
            if (x & (1 << j)) {
                res += (ll)nd->num * (1 << j);
            }
            else {
                res += (ll)nd->cnt[j] * (1 << j);
            }
        }
        return res;
    }
    per(i, 18) {
        int u = 0;
        if (x & (1 << i))u = 1;
        if (s & (1 << i)) {
            if (nd->ch[0 ^ u] != NULL) {
                Node* cop = nd->ch[0 ^ u];
                rep(j, 18) {
                    if (x & (1 << j)) {
                        res += (ll)cop->num * (1 << j);
                    }
                    else {
                        res += (ll)cop->cnt[j] * (1 << j);
                    }
                }
            }
            if (nd->ch[1^u] == NULL)return res;
            nd = nd->ch[1^u];
        }
        else {
            if (nd->ch[0^u] == NULL)return res;
            nd = nd->ch[0^u];
        }
    }
    return res;
}
void solve() {
    int n; cin >> n >> s;
    vector<int> a(n);
    rep(i, n)cin >> a[i];
    Node* nd = new Node();
    rep(i, n)add(nd, a[i]);
    ll ans = 0;
    rep(i, n)ans += query(nd, a[i]);
    
    rep(i, n)ans -= a[i];
    //cout << ans << "\n";
    ans /= 2;
    cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(15);
    //init_f();
    //init();
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}
0