結果

問題 No.1240 Or Sum of Xor Pair
ユーザー rniyarniya
提出日時 2021-09-27 12:58:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 469 ms / 2,000 ms
コード長 8,338 bytes
コンパイル時間 2,100 ms
コンパイル使用メモリ 204,988 KB
実行使用メモリ 12,284 KB
最終ジャッジ日時 2023-09-20 13:18:49
合計ジャッジ時間 20,405 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 424 ms
11,276 KB
testcase_01 AC 427 ms
11,172 KB
testcase_02 AC 424 ms
11,332 KB
testcase_03 AC 429 ms
11,196 KB
testcase_04 AC 431 ms
11,208 KB
testcase_05 AC 427 ms
11,252 KB
testcase_06 AC 428 ms
11,252 KB
testcase_07 AC 428 ms
11,240 KB
testcase_08 AC 431 ms
11,200 KB
testcase_09 AC 429 ms
11,320 KB
testcase_10 AC 433 ms
11,376 KB
testcase_11 AC 433 ms
11,288 KB
testcase_12 AC 435 ms
11,448 KB
testcase_13 AC 436 ms
11,428 KB
testcase_14 AC 436 ms
11,332 KB
testcase_15 AC 466 ms
11,964 KB
testcase_16 AC 467 ms
12,084 KB
testcase_17 AC 468 ms
12,080 KB
testcase_18 AC 467 ms
12,060 KB
testcase_19 AC 469 ms
12,216 KB
testcase_20 AC 467 ms
12,076 KB
testcase_21 AC 465 ms
12,012 KB
testcase_22 AC 465 ms
12,284 KB
testcase_23 AC 466 ms
12,060 KB
testcase_24 AC 468 ms
12,024 KB
testcase_25 AC 469 ms
12,044 KB
testcase_26 AC 468 ms
11,972 KB
testcase_27 AC 429 ms
11,180 KB
testcase_28 AC 427 ms
11,172 KB
testcase_29 AC 458 ms
12,028 KB
testcase_30 AC 440 ms
11,684 KB
testcase_31 AC 438 ms
11,628 KB
testcase_32 AC 446 ms
12,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

template <int i, typename T> void print_tuple(ostream&, const T&) {}
template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {
    if (i) os << ',';
    os << get<i>(t);
    print_tuple<i + 1, T, Args...>(os, t);
}
template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    os << '{';
    print_tuple<0, tuple<Args...>, Args...>(os, t);
    return os << '}';
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

#include <cassert>
#include <vector>

namespace set_function {
template <typename T> void subset_zeta_transform(std::vector<T>& f) {
    int n = f.size();
    assert((n & (n - 1)) == 0);
    for (int i = 1; i < n; i <<= 1) {
        for (int j = 0; j < n; j++) {
            if ((j & i) == 0) {
                f[j | i] += f[j];
            }
        }
    }
}

template <typename T> void subset_mobius_transform(std::vector<T>& f) {
    int n = f.size();
    assert((n & (n - 1)) == 0);
    for (int i = 1; i < n; i <<= 1) {
        for (int j = 0; j < n; j++) {
            if ((j & i) == 0) {
                f[j | i] -= f[j];
            }
        }
    }
}

template <typename T> void superset_zeta_transform(std::vector<T>& f) {
    int n = f.size();
    assert((n & (n - 1)) == 0);
    for (int i = 1; i < n; i <<= 1) {
        for (int j = 0; j < n; j++) {
            if ((j & i) == 0) {
                f[j] += f[j | i];
            }
        }
    }
}

template <typename T> void superset_mobius_transform(std::vector<T>& f) {
    int n = f.size();
    assert((n & (n - 1)) == 0);
    for (int i = 1; i < n; i <<= 1) {
        for (int j = 0; j < n; j++) {
            if ((j & i) == 0) {
                f[j] -= f[j | i];
            }
        }
    }
}

template <typename T> void walsh_hadamard_transform(std::vector<T>& f, bool inv = false) {
    int n = f.size();
    assert((n & (n - 1)) == 0);
    for (int i = 1; i < n; i <<= 1) {
        for (int j = 0; j < n; j++) {
            if ((j & i) == 0) {
                T x = f[j], y = f[j | i];
                f[j] = x + y, f[j | i] = x - y;
            }
        }
    }
    if (inv) {
        if (std::is_integral<T>::value) {
            for (auto& x : f) x /= n;
        } else {
            T inv_n = T(1) / f.size();
            for (auto& x : f) x *= inv_n;
        }
    }
}

template <typename T> std::vector<T> and_convolution(std::vector<T> f, std::vector<T> g) {
    assert(f.size() == g.size());
    superset_zeta_transform(f);
    superset_zeta_transform(g);
    for (size_t i = 0; i < f.size(); i++) f[i] *= g[i];
    superset_mobius_transform(f);
    return f;
}

template <typename T> std::vector<T> or_convolution(std::vector<T> f, std::vector<T> g) {
    assert(f.size() == g.size());
    subset_zeta_transform(f);
    subset_zeta_transform(g);
    for (size_t i = 0; i < f.size(); i++) f[i] *= g[i];
    subset_mobius_transform(f);
    return f;
}

template <typename T> std::vector<T> xor_convolution(std::vector<T> f, std::vector<T> g) {
    assert(f.size() == g.size());
    walsh_hadamard_transform(f);
    walsh_hadamard_transform(g);
    for (size_t i = 0; i < f.size(); i++) f[i] *= g[i];
    walsh_hadamard_transform(f, true);
    return f;
}
}  // namespace set_function

/**
 * @brief set function (FZT, FMT, FWHT)
 * @docs docs/convolution/set_function.md
 */

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
// const long long MOD = 1000000007;
const long long MOD = 998244353;

const int MAX_B = 18;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, X;
    cin >> N >> X;
    vector<int> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];

    long long ans = 0;
    vector<long long> cnt(1 << MAX_B, 0);
    for (int i = 0; i < N; i++) cnt[A[i]]++;
    vector<long long> conv = set_function::xor_convolution(cnt, cnt);
    for (int i = 0; i < X; i++) ans += conv[i] * i;

    for (int j = 0, mask = 1; j < MAX_B; j++, mask <<= 1) {
        fill(cnt.begin(), cnt.end(), 0);
        for (int i = 0; i < N; i++) {
            if (A[i] & mask) {
                cnt[A[i]]++;
                ans -= mask;
            }
        }
        conv = set_function::xor_convolution(cnt, cnt);
        for (int i = 0; i < X; i++) ans += conv[i] * mask;
    }

    cout << ans / 2 << '\n';
    return 0;
}
0