제출 #1146492

#제출 시각아이디문제언어결과실행 시간메모리
1146492aliarapovXOR Sum (info1cup17_xorsum)C++20
0 / 100
89 ms196608 KiB
#include <iostream> 
#include <vector>
#include <bitset>

signed main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);std::cout.tie(nullptr);

    int n;
    std::cin >> n;
    std::vector<int> a(n);
    for (int &i : a) std::cin >> i;
    const int N = 1e9 + 1;
    std::bitset<N> bt;
    for (int i = 0; i < n; i++) bt[a[i]] = !bt[a[i]];
    std::bitset<N> ans;
    for (int i = 0; i < n; i++) {
        ans ^= bt << a[i];
        bt[a[i]] = !bt[a[i]];
    }
    int res = 0;
    for (int i = 0; i < N; i++) {
        if (ans[i]) res ^= i;
    }
    std::cout << res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...