제출 #720354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
720354		GrandTiger1729	XOR Sum (info1cup17_xorsum)	C++17	0 / 100	525 ms	38956 KiB

xorsum

#include <bits/stdc++.h>
using namespace std;

const int N = 30;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    int ans = 0;
    if (n % 2 == 0){
        for (int j = 0; j < N; j++){
            int cnt = 0;
            for (int i = 0; i < n; i++){
                if (a[i] & 1 << j)
                    cnt++;
            }
            ans ^= (cnt & 1) << j;
        }
    }
    vector<pair<int, int>> res(n);
    for (int i = 0; i < n; i++)
        res[i] = make_pair(a[i] & 1, i);
    sort(res.begin(), res.end());
    auto calc = [&](int j) -> long long {
        int r = n;
        long long ret = 0;
        for (int i = 0; i < n; i++){
            while (r > 0 && res[r - 1].first >= (1 << j) - res[i].first) r--;
            ret += n - r;
            ret += res[i].first >= (1 << j - 1);
        }
        return ret;
    };
    long long cnt = calc(1) / 2;
    ans ^= (cnt & 1) << 1;
    for (int j = 2; j <= N; j++){
        vector<pair<int, int>> b, c;
        for (int i = 0; i < n; i++){
            if (a[res[i].second] & 1 << j)
                c.push_back(make_pair(res[i].first ^ 1 << j, res[i].second));
            else
                b.push_back(res[i]);
        }
        b.insert(b.end(), c.begin(), c.end());
        swap(res, b);
        cnt = calc(j) / 2;
        ans ^= (cnt & 1) << j;
    }
    cout << ans << '\n';
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

xorsum.cpp: In lambda function:
xorsum.cpp:32:44: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   32 |             ret += res[i].first >= (1 << j - 1);
      |                                          ~~^~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 21
• Subtask 4: 0 / 38
• Subtask 5: 0 / 23