#562602 (C++17) No.1240 Or Sum of Xor Pair

提出ソース

結果

問題	No.1240 Or Sum of Xor Pair
ユーザー	haruki_K
提出日時	2020-10-04 21:34:06
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	300 ms / 2,000 ms
コード長	5,258 bytes
コンパイル時間	2,330 ms
コンパイル使用メモリ	207,984 KB
実行使用メモリ	7,036 KB
最終ジャッジ日時	2024-07-19 18:21:11
合計ジャッジ時間	13,128 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	251 ms 5,468 KB
testcase_01	AC	251 ms 5,600 KB
testcase_02	AC	251 ms 5,596 KB
testcase_03	AC	254 ms 5,504 KB
testcase_04	AC	255 ms 5,756 KB
testcase_05	AC	253 ms 5,500 KB
testcase_06	AC	252 ms 5,624 KB
testcase_07	AC	253 ms 5,584 KB
testcase_08	AC	255 ms 5,496 KB
testcase_09	AC	252 ms 5,628 KB
testcase_10	AC	257 ms 5,600 KB
testcase_11	AC	260 ms 5,540 KB
testcase_12	AC	262 ms 5,520 KB
testcase_13	AC	262 ms 5,732 KB
testcase_14	AC	263 ms 5,656 KB
testcase_15	AC	300 ms 6,944 KB
testcase_16	AC	299 ms 6,944 KB
testcase_17	AC	300 ms 6,944 KB
testcase_18	AC	298 ms 6,944 KB
testcase_19	AC	299 ms 6,940 KB
testcase_20	AC	299 ms 6,944 KB
testcase_21	AC	298 ms 6,940 KB
testcase_22	AC	299 ms 6,940 KB
testcase_23	AC	300 ms 6,944 KB
testcase_24	AC	300 ms 7,036 KB
testcase_25	AC	299 ms 6,944 KB
testcase_26	AC	298 ms 6,940 KB
testcase_27	AC	252 ms 6,940 KB
testcase_28	AC	253 ms 6,944 KB
testcase_29	AC	278 ms 6,944 KB
testcase_30	AC	266 ms 6,940 KB
testcase_31	AC	268 ms 6,940 KB
testcase_32	AC	274 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> 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,x; cin >> n >> x;
    vector<int> a(n); cin >> a;

    auto hadamard = [&](vector<int> &v) {
        int lg = __lg(sz(v));
        assert(sz(v) == 1LL<<lg);
        rep (k,lg) rep (i,1LL<<lg) if (~i>>k&1) {
            int j = i^(1LL<<k);
            auto x = v[i] + v[j];
            auto y = v[i] - v[j];
            v[i] = x;
            v[j] = y;
        }
    };

    auto sq = [&](vector<int> &v) {
        hadamard(v);
        rep (i,v.size()) v[i] *= v[i];
        hadamard(v);
        rep (i,v.size()) v[i] /= v.size();
    };

    const int LG = 18;

    int num = 0;
    {
        vector<int> v(1LL<<LG);
        rep (i,n) v[a[i]]++;
        sq(v);
        rep (i,x) num += v[i];
        num -= n;
        num /= 2;
    }
    dump(num);

    int ans = 0;
    rep (k,LG) {
        static vector<int> v(1LL<<LG);
        fill(all(v),0);

        int cnt = 0;
        rep (i,n) if (~a[i]>>k&1) v[a[i]]++, cnt--;
        sq(v);
        rep (i,x) cnt += v[i];
        cnt /= 2;
        ans += (num-cnt)<<k;
        dump(k,cnt);
    }

    cout << ans << endl;

}

yukicoder

結果

テストケース

ソースコード