oj.uz

Submission #1098791

# Submission time Handle Problem Language Result Execution time Memory
1098791 2024-10-10T02:00:10 Z anhthi XOR Sum (info1cup17_xorsum) C++14
100 / 100
 451 ms 26692 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define heap priority_queue
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)

 
template <class X, class Y>
    inline bool maximize(X &x, Y y) {
        return (x < y ? x = y, true : false);
    }
 
template <class X, class Y>
    inline bool minimize(X &x, Y y) {
        return (x > y ? x = y, true : false);
    }
 
template <class X>
    inline void compress(vector<X> &a) {
        sort(all(a));
        a.resize(unique(all(a)) - a.begin());
    }
 
int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcnt(ll x) { return __builtin_popcount(x); }
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
    return l + abs((ll) rng()) % (r - l + 1);
}
 
const ll oo = (ll) 1e18 + 5;
const int inf = (ll) 1e9 + 7, mod = (ll) 1e9 + 7;
 
const int N = 1e6 + 5, LOG = 30;
 
void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }

int n;
int a[N], v[N];
vector<int> cnt[2];
ll calc(ll base) {
    int r = n;
    ll ans = 0;
    forn(l, 1, n) {
        while (l < r && v[l] + v[r] > base) r--;
        if (v[l] + v[r] <= base)
            ans += r - l + 1;
    }
    return ans;
}
ll ok(int b) {
    int val = MASK(b);
    ll cur = calc(4 * val - 1) - calc(3 * val - 1)
        + calc(2 * val - 1) - calc(val - 1);
    return cur;
} 
    
int main(void) {
    
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n;
    rep(i, n) {
        cin >> a[i];
    }

    int all = 0;
    int ans = 0;    
    forn(I, 0, LOG) {
        all |= MASK(I);
        forn(i, 0, 1) cnt[i].clear();
        forn(i, 1, n) {
            cnt[BIT(a[i], I)].pb(a[i]);
        }
        forn(i, 1, sz(cnt[0])) a[i] = cnt[0][i - 1];
        forn(i, 1, sz(cnt[1])) a[i + sz(cnt[0])] = cnt[1][i - 1];

        forn(i, 1, n) v[i] = a[i] & all;

        if (ok(I) & 1) ans += MASK(I);
    } 

    cout << ans;

    return 0;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 21752 KB Output is correct
2 Correct 274 ms 20800 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 21752 KB Output is correct
2 Correct 274 ms 20800 KB Output is correct
3 Correct 345 ms 24004 KB Output is correct
4 Correct 324 ms 23364 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 46 ms 3004 KB Output is correct
4 Correct 46 ms 3152 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 310 ms 21752 KB Output is correct
4 Correct 274 ms 20800 KB Output is correct
5 Correct 345 ms 24004 KB Output is correct
6 Correct 324 ms 23364 KB Output is correct
7 Correct 46 ms 3004 KB Output is correct
8 Correct 46 ms 3152 KB Output is correct
9 Correct 444 ms 26548 KB Output is correct
10 Correct 451 ms 26692 KB Output is correct
11 Correct 440 ms 26684 KB Output is correct