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

提出ソース

結果

問題	No.1240 Or Sum of Xor Pair
ユーザー	hitonanode
提出日時	2020-10-03 15:29:03
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,490 bytes
コンパイル時間	2,056 ms
コンパイル使用メモリ	211,036 KB
実行使用メモリ	51,892 KB
最終ジャッジ日時	2024-07-18 04:28:14
合計ジャッジ時間	11,426 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	11 ms 6,940 KB
testcase_04	AC	10 ms 6,944 KB
testcase_05	AC	8 ms 6,944 KB
testcase_06	AC	7 ms 6,940 KB
testcase_07	AC	7 ms 6,944 KB
testcase_08	AC	6 ms 6,940 KB
testcase_09	AC	8 ms 6,940 KB
testcase_10	AC	47 ms 14,968 KB
testcase_11	AC	53 ms 16,436 KB
testcase_12	AC	96 ms 24,064 KB
testcase_13	AC	84 ms 24,844 KB
testcase_14	AC	96 ms 24,848 KB
testcase_15	AC	586 ms 47,900 KB
testcase_16	AC	500 ms 48,528 KB
testcase_17	AC	554 ms 48,832 KB
testcase_18	AC	557 ms 47,244 KB
testcase_19	AC	545 ms 47,364 KB
testcase_20	AC	615 ms 47,720 KB
testcase_21	AC	553 ms 48,544 KB
testcase_22	AC	580 ms 47,348 KB
testcase_23	AC	480 ms 48,952 KB
testcase_24	AC	577 ms 48,644 KB
testcase_25	AC	479 ms 47,848 KB
testcase_26	AC	577 ms 48,592 KB
testcase_27	AC	2 ms 6,940 KB
testcase_28	AC	2 ms 6,944 KB
testcase_29	WA	-
testcase_30	AC	48 ms 6,940 KB
testcase_31	AC	69 ms 6,940 KB
testcase_32	AC	200 ms 51,892 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
    fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); };
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
//
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args>
void ndarray(vector<T>& vec, const V& val, int len, Args... args)
{
    vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); });
}
template <typename T>
bool chmax(T& m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T>
bool chmin(T& m, const T q) { return m > q ? (m = q, true) : false; }
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2>& l, const pair<T1, T2>& r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2>& l, const pair<T1, T2>& r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T>
vector<T> srtunq(vector<T> vec) { return sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()), vec; }
template <typename T>
istream& operator>>(istream& is, vector<T>& vec)
{
    return for_each(begin(vec), end(vec), [&](T& v) { is >> v; }), is;
}

// output
template <typename T, typename V>
ostream& dmpseq(ostream&, const T&, const string&, const string&, const string&);
#if __cplusplus >= 201703L
template <typename... T>
ostream& operator<<(ostream& os, const tuple<T...>& tpl)
{
    return apply([&os](auto&&... args) { ((os << args << ','), ...); }, tpl), os;
}
#endif
//
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) { return os << '(' << p.first << ',' << p.second << ')'; }
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& x) { return dmpseq<vector<T>, T>(os, x, "[", ",", "]"); }
template <typename T>
ostream& operator<<(ostream& os, const deque<T>& x) { return dmpseq<deque<T>, T>(os, x, "deq[", ",", "]"); }
template <typename T>
ostream& operator<<(ostream& os, const set<T>& x) { return dmpseq<set<T>, T>(os, x, "{", ",", "}"); }
template <typename T, typename TH>
ostream& operator<<(ostream& os, const unordered_set<T, TH>& x) { return dmpseq<unordered_set<T, TH>, T>(os, x, "{", ",", "}"); }
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& x) { return dmpseq<multiset<T>, T>(os, x, "{", ",", "}"); }
template <typename TK, typename T>
ostream& operator<<(ostream& os, const map<TK, T>& x) { return dmpseq<map<TK, T>, pair<TK, T>>(os, x, "{", ",", "}"); }
template <typename TK, typename T, typename TH>
ostream& operator<<(ostream& os, const unordered_map<TK, T, TH>& x) { return dmpseq<unordered_map<TK, T, TH>, pair<TK, T>>(os, x, "{", ",", "}"); }
template <typename T, typename V>
ostream& dmpseq(ostream& os, const T& seq, const string& pre, const string& sp, const string& suf)
{
    return os << pre, for_each(begin(seq), end(seq), [&](V x) { os << x << sp; }), os << suf;
}
template <typename T>
void print(const vector<T>& x) { dmpseq<vector<T>, T>(cout, x, "", " ", "\n"); }
#ifdef HITONANODE_LOCAL
constexpr int D = 9;
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
constexpr int D = 18;
#define dbg(x) {}
#endif


int main()
{
    int N, X;
    cin >> N >> X;
    vector<int> ch0 { -1 }, ch1 { -1 }, par { -1 }, cnt { 0 };
    vector dcnt(1, vector<int>(D, 0));

    auto new_node = [&](int now) -> int {
        int ret = ch0.size();
        ch0.emplace_back(-1);
        ch1.emplace_back(-1);
        par.emplace_back(now);
        cnt.emplace_back(0);
        dcnt.emplace_back(D, 0);
        return ret;
    };

    lint ret = 0;
    while (N--) {
        int a;
        cin >> a;
        {
            int now = 0;
            int val = 0;
            IREP(d, D)
            {
                if (now < 0) break;

                const int tgt = (X >> d) & 1;
                const int k = (a >> d) & 1;
                if (tgt == 1)
                {
                    int c = (k ? ch1[now] : ch0[now]);
                    if (c >= 0) {
                        REP(dd, D)
                        {
                            ret += (1LL << dd) * (((a >> dd) & 1) ? cnt[c] : dcnt[c][dd]);
                        }
                    }
                }
                if (k == tgt) val += 1 << d;
                now = (k == tgt ? ch0[now] : ch1[now]);
            }
        }
        {
            int now = 0;
            IREP(d, D)
            {
                int k = (a >> d) & 1;
                int nxt = k ? ch1[now] : ch0[now];
                if (nxt < 0)
                {
                    nxt = new_node(now);
                    (k ? ch1[now] : ch0[now]) = nxt;
                }
                now = nxt;
            }
            while (now >= 0)
            {
                cnt[now]++;
                REP(d, D) dcnt[now][d] += (a >> d) & 1;
                now = par[now];
            }
        }
    }
    cout << ret << '\n';
}

yukicoder

結果

テストケース

ソースコード