oj.uz

Submission #1009496

# Submission time Handle Problem Language Result Execution time Memory
1009496 2024-06-27T15:08:08 Z windowwife XOR Sum (info1cup17_xorsum) C++17
100 / 100
 528 ms 35136 KB 
#include<bits/stdc++.h>
#define ll long long
#define task " "
using namespace std;
const int maxn = 1e6 + 1, mod = 1e9 + 7;
ll n, a[maxn], m[maxn], id[maxn], cnt = 0, idx = 0, res = 0;
int t, p, r;
vector<int> v[2];
int main ()
{
    //freopen(task".INP", "r", stdin);
    //freopen(task".OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        m[i] = 0;
        id[i] = i;
    }
    m[n + 1] = (1LL << 32);
    for (int j = 0; j <= 29; j++)
    {
        cnt = idx = 0; v[0].clear(); v[1].clear();
        for (int i = 1; i <= n; i++)
            v[(a[id[i]] >> j) & 1].push_back(id[i]);
        for (int i : v[0])
        {
            m[++idx] = a[i] & ((1LL << (j + 1)) - 1);
            id[idx] = i;
        }
        for (int i : v[1])
        {
            m[++idx] = a[i] & ((1LL << (j + 1)) - 1);
            id[idx] = i;
        }
        t = p = r = n + 1;
        for (int i = 1; i <= n; i++)
        {
            while (t > 1 && m[t - 1] >= (1LL << (j + 1)) - m[i]) t--;
            while (p > 1 && m[p - 1] >= (1LL << j) - m[i]) p--;
            while (r > 1 && m[r - 1] >= (1LL << j) + (1LL << (j + 1)) - m[i]) r--;
            cnt += (min(t, i + 1) - min(p, i + 1)) + (i + 1 - min(r, i + 1));
            //cnt += lower_bound(m + 1, m + i + 1, (1LL << (j + 1)) - m[i]) - lower_bound(m + 1, m + i + 1, (1LL << j) - m[i]);
            //cnt += lower_bound(m + 1, m + i + 1, (1LL << (j + 2)) - m[i]) - lower_bound(m + 1, m + i + 1, (1LL << j) + (1LL << (j + 1)) - m[i]);
        }
        res += (cnt & 1)*(1 << j);
    }
    cout << res;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 266 ms 33092 KB Output is correct
2 Correct 310 ms 32320 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 266 ms 33092 KB Output is correct
2 Correct 310 ms 32320 KB Output is correct
3 Correct 323 ms 34112 KB Output is correct
4 Correct 358 ms 35136 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 48 ms 9808 KB Output is correct
4 Correct 52 ms 9668 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 266 ms 33092 KB Output is correct
4 Correct 310 ms 32320 KB Output is correct
5 Correct 323 ms 34112 KB Output is correct
6 Correct 358 ms 35136 KB Output is correct
7 Correct 48 ms 9808 KB Output is correct
8 Correct 52 ms 9668 KB Output is correct
9 Correct 528 ms 33668 KB Output is correct
10 Correct 463 ms 33088 KB Output is correct
11 Correct 502 ms 33856 KB Output is correct