結果

問題 No.1240 Or Sum of Xor Pair
ユーザー haruki_Kharuki_K
提出日時 2020-10-04 19:57:27
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 705 ms / 2,000 ms
コード長 5,609 bytes
コンパイル時間 2,653 ms
コンパイル使用メモリ 208,560 KB
実行使用メモリ 100,460 KB
最終ジャッジ日時 2023-09-27 00:09:29
合計ジャッジ時間 13,809 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 14 ms
9,220 KB
testcase_04 AC 14 ms
10,524 KB
testcase_05 AC 14 ms
11,020 KB
testcase_06 AC 12 ms
9,228 KB
testcase_07 AC 11 ms
9,428 KB
testcase_08 AC 11 ms
9,884 KB
testcase_09 AC 12 ms
9,424 KB
testcase_10 AC 63 ms
28,144 KB
testcase_11 AC 72 ms
28,736 KB
testcase_12 AC 124 ms
51,168 KB
testcase_13 AC 116 ms
51,060 KB
testcase_14 AC 127 ms
51,612 KB
testcase_15 AC 693 ms
99,024 KB
testcase_16 AC 632 ms
99,776 KB
testcase_17 AC 629 ms
100,404 KB
testcase_18 AC 640 ms
99,356 KB
testcase_19 AC 632 ms
99,388 KB
testcase_20 AC 668 ms
100,072 KB
testcase_21 AC 668 ms
99,756 KB
testcase_22 AC 698 ms
99,192 KB
testcase_23 AC 616 ms
100,460 KB
testcase_24 AC 705 ms
99,344 KB
testcase_25 AC 583 ms
99,620 KB
testcase_26 AC 664 ms
100,012 KB
testcase_27 AC 1 ms
4,388 KB
testcase_28 AC 1 ms
4,380 KB
testcase_29 AC 147 ms
4,560 KB
testcase_30 AC 64 ms
4,384 KB
testcase_31 AC 92 ms
4,384 KB
testcase_32 AC 258 ms
99,804 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) {
    using S = typename iterator_traits<It>::value_type;
    using T = conditional_t<is_signed_v<S>,i64,u64>;
    return accumulate(b,e,T{});
}
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }
// <<<

int32_t main() {
    int n,A; cin >> n >> A;
    vector<int> a(n); cin >> a;

    const int LG = 20;
    struct Node {
        array<int,LG> cnt = {};
        int num = 0, ch[2] = {-1,-1};
    };
    vector<Node> t(1);

    auto add = [&](int x) {
        static vector<int> path;
        path.clear();
        path.eb(0);

        rep (i,LG) {
            int b = x>>(LG-1-i)&1;
            int idx = path.back();
            if (t[idx].ch[b] < 0) {
                t[idx].ch[b] = t.size();
                t.eb();
            }
            path.eb(t[idx].ch[b]);
        }

        for (int idx : path) {
            t[idx].num++;
            rep (i,LG) if (x>>i&1) t[idx].cnt[i]++;
        }
    };

    auto calc = [&](int x) {
        int idx = 0, sum = 0;
        rep (i,LG) {
            int b = x>>(LG-1-i)&1, c = A>>(LG-1-i)&1;
            if (int nxt = t[idx].ch[b^c^1]; c == 1 && nxt >= 0) {
                auto &node = t[nxt];
                rep (j,LG) {
                    if (x>>j&1) {
                        sum += node.num << j;
                    } else {
                        sum += node.cnt[j] << j;
                    }
                }
            }
            int nxt = t[idx].ch[b^c];
            if (nxt < 0) break;
            idx = nxt;
        }
        dump(x,sum);
        return sum;
    };

    int ans = 0;
    for (int x : a) {
        ans += calc(x);
        add(x);
    }

    cout << ans << endl;

}
0