oj.uz

Submission #270481

# Submission time Handle Problem Language Result Execution time Memory
270481 2020-08-17T16:25:11 Z egekabas XOR Sum (info1cup17_xorsum) C++14
0 / 100
 502 ms 32612 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
ll n, a[1000009];
vector<pii> old, cur;
ll ans = 0;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    cin >> n;
    old.resize(n);
    for(ll i = 0; i < n; ++i)
        cin >> old[i].ff;
    for(ll bit = 0; bit < 34; ++bit){
        for(auto u : old)
            if((u.ff&(1<<bit)) == 0)
                cur.pb(u);
        
        for(auto u : old)
            if((u.ff&(1<<bit)))
                cur.pb({u.ff, u.ss+(1LL<<bit)});
        
    
        ll i1, i2, i3;
        i1 = i2 = i3 = n-1;
        ll cnt = 0;
        for(ll i = 0; i < n; ++i){
            i1 = max(i1, i-1);
            i2 = max(i2, i-1);
            i3 = max(i3, i-1);
            
            while(i1 >= i && cur[i].ss+cur[i1].ss >= (1LL<<bit))
                --i1;
            while(i2 >= i && cur[i].ss+cur[i2].ss >= (1LL<<(bit+1)))
                --i2;
            while(i3 >= i && cur[i].ss+cur[i3].ss >= (1LL<<(bit+1))+(1LL<<bit))
                --i3;
            
            cnt += i2-i1+n-1-i3;
        }
        if(cnt%2)
            ans += (1<<bit);
        swap(old, cur);
        cur.clear();
    }
    cout << ans << '\n';
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 502 ms 32612 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 502 ms 32612 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -