oj.uz

Submission #389448

# Submission time Handle Problem Language Result Execution time Memory
389448 2021-04-14T06:03:32 Z cheissmart XOR Sum (info1cup17_xorsum) C++14
45 / 100
 1600 ms 8132 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << "LINE(" << __LINE__ << "): " << #x << " is " << x << endl

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

const int INF = 1e9 + 7, N = 1e6 + 1;

signed main()
{
    ios::sync_with_stdio(0), cin.tie(0);

    mt19937 rng(time(0));
    int n;
    cin >> n;
    //n = 10;
    vi a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        //a[i] = rng() % 100;
    }

    /*int myans = 0;
    for(int i = 0; i < n; i++)
        for(int j = i; j < n; j++)
            myans ^= a[i] + a[j];
    debug(myans);
    */
    int ans = 0;
    for(int bit = 0; bit < 30; bit++) {
        ll cnt = 0;
        vi aux(n);
        for(int i = 0; i < n; i++) {
            aux[i] = a[i] & ((1 << (bit + 1)) - 1);
            if((a[i] * 2) >> bit & 1) cnt++;
        }
        sort(ALL(aux));
        for(int i = 0, j = n, k = n; i < n; i++) {
            auto go = [&] (ll lb, ll rb) {
                lb -= aux[i], rb -= aux[i];
                //cnt += upper_bound(ALL(aux), rb) - lower_bound(ALL(aux), lb);
                while(j - 1 >= 0 && aux[j - 1] >= lb) j--;
                while(k - 1 >= 0 && aux[k - 1] > rb) k--;
                cnt += k - j;
            };
            go(1 << bit, (1 << (bit + 1)) - 1);
        }
        for(int i = 0, j = n, k = n; i < n; i++) {
            auto go = [&] (ll lb, ll rb) {
                lb -= aux[i], rb -= aux[i];
                //cnt += upper_bound(ALL(aux), rb) - lower_bound(ALL(aux), lb);
                while(j - 1 >= 0 && aux[j - 1] >= lb) j--;
                while(k - 1 >= 0 && aux[k - 1] > rb) k--;
                cnt += k - j;
            };
            go(3 << bit, (2LL << (bit + 1)) - 1);
        }
        //debug(cnt);
        assert(cnt % 2 == 0);
        cnt /= 2;
        if(cnt & 1) ans |= 1 << bit;
    }
    cout << ans << '\n';

}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 332 KB Output is correct
2 Correct 10 ms 348 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1686 ms 8132 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1686 ms 8132 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 332 KB Output is correct
2 Correct 10 ms 348 KB Output is correct
3 Correct 254 ms 1108 KB Output is correct
4 Correct 287 ms 1096 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 332 KB Output is correct
2 Correct 10 ms 348 KB Output is correct
3 Execution timed out 1686 ms 8132 KB Time limit exceeded
4 Halted 0 ms 0 KB -