結果

問題 No.1240 Or Sum of Xor Pair
ユーザー yosupotyosupot
提出日時 2020-09-25 22:28:20
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 86 ms / 2,000 ms
コード長 7,164 bytes
コンパイル時間 1,432 ms
コンパイル使用メモリ 128,284 KB
実行使用メモリ 27,500 KB
最終ジャッジ日時 2023-09-10 15:44:08
合計ジャッジ時間 4,193 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 3 ms
4,376 KB
testcase_04 AC 3 ms
4,380 KB
testcase_05 AC 3 ms
4,380 KB
testcase_06 AC 3 ms
4,380 KB
testcase_07 AC 3 ms
4,388 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 3 ms
4,380 KB
testcase_10 AC 10 ms
5,312 KB
testcase_11 AC 12 ms
5,876 KB
testcase_12 AC 20 ms
7,684 KB
testcase_13 AC 17 ms
6,892 KB
testcase_14 AC 18 ms
7,680 KB
testcase_15 AC 84 ms
27,268 KB
testcase_16 AC 83 ms
27,500 KB
testcase_17 AC 82 ms
27,156 KB
testcase_18 AC 83 ms
27,288 KB
testcase_19 AC 81 ms
27,140 KB
testcase_20 AC 84 ms
27,208 KB
testcase_21 AC 86 ms
27,212 KB
testcase_22 AC 86 ms
27,208 KB
testcase_23 AC 81 ms
27,284 KB
testcase_24 AC 82 ms
27,096 KB
testcase_25 AC 76 ms
27,144 KB
testcase_26 AC 85 ms
27,144 KB
testcase_27 AC 2 ms
4,380 KB
testcase_28 AC 2 ms
4,380 KB
testcase_29 AC 43 ms
27,172 KB
testcase_30 AC 26 ms
15,000 KB
testcase_31 AC 27 ms
15,072 KB
testcase_32 AC 61 ms
27,076 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL




#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <complex>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;



#include <unistd.h>

struct Scanner {
    int fd = -1;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += ::read(fd, line + ed, (1 << 15) - ed);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) {
            bool sep = false;
            for (size_t i = st; i < ed; i++) {
                if (isspace(line[i])) {
                    sep = true;
                    break;
                }
            }
            if (!sep) reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] & 0xf);
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    int read_unsafe() { return 0; }
    template <class H, class... T> int read_unsafe(H& h, T&... t) {
        bool f = read_single(h);
        if (!f) return 0;
        return 1 + read_unsafe(t...);
    }
    Scanner(FILE* fp) : fd(fileno(fp)) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }
    void write_single(__int128 val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }

    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};

Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

V<int> a;
VV<int> cnt;

// val, cnt
pair<ll, ll> all_mul(int la, int ra, int lb, int rb, int h) {
    pair<ll, ll> ans = {0, 1LL * (ra - la) * (rb - lb)};
    for (int i = 0; i <= h; i++) {
        ll c0 = (ra - la) - (cnt[ra][i] - cnt[la][i]);
        ll c1 = (rb - lb) - (cnt[rb][i] - cnt[lb][i]);
        ans.first += (ans.second - c0 * c1) * (1 << i);
    }
    return ans;
}

pair<ll, ll> solve(int la, int ra, int lb, int rb, int h, int x) {
    if (la == ra || lb == rb) return {0, 0};
    if (h == -1) {
        return {0, 0};
    }
    int ma = la, mb = lb;
    while (ma < ra && !(a[ma] & (1 << h))) ma++;
    while (mb < rb && !(a[mb] & (1 << h))) mb++;
    pair<ll, ll> ans;
    if (x & (1 << h)) {
        auto q0 = all_mul(la, ma, lb, mb, h);
        auto q1 = all_mul(ma, ra, mb, rb, h);
        auto p0 = solve(la, ma, mb, rb, h - 1, x);
        auto p1 = solve(ma, ra, lb, mb, h-1, x);
        ans = {p0.first + p1.first, p0.second + p1.second};
        ans.first += ans.second * (1 << h);
        ans.first += q0.first + q1.first;
        ans.second += q0.second + q1.second;
    } else {
        auto p0 = solve(la, ma, lb, mb, h-1, x);
        auto p1 = solve(ma, ra, mb, rb, h-1, x);
        ans = {p0.first + p1.first, p0.second + p1.second};
        ans.first += p1.second * (1 << h);
    }
                                  ;
    return ans;
}

int main() {
    int n, x;
    sc.read(n, x);
    a = V<int>(n);
    for (int i = 0; i < n; i++) {
        sc.read(a[i]);
    }
    sort(a.begin(), a.end());
    cnt = VV<int>(n + 1, V<int>(19));
    for (int i = 0; i < n; i++) {
        cnt[i + 1] = cnt[i];
        for (int h = 0; h < 19; h++) {
            if (a[i] & (1 << h)) cnt[i + 1][h]++;
        }
    }

    auto ans = solve(0, n, 0, n, 18, x);

    for (int i = 0; i < n; i++) {
        ans.first -= a[i];
    }

    pr.writeln(ans.first / 2);
    return 0;
}
0