oj.uz

답안 #270484

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
270484 2020-08-17T16:26:09 Z egekabas XOR Sum (info1cup17_xorsum) C++14
100 / 100
 794 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&(1LL<<bit)) == 0)
                cur.pb(u);
        for(auto u : old)
            if((u.ff&(1LL<<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 += (1LL<<bit);
        swap(old, cur);
        cur.clear();
    }
    cout << ans << '\n';
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 524 ms 32552 KB Output is correct
2 Correct 523 ms 31460 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 524 ms 32552 KB Output is correct
2 Correct 523 ms 31460 KB Output is correct
3 Correct 663 ms 32612 KB Output is correct
4 Correct 636 ms 31972 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 87 ms 4088 KB Output is correct
4 Correct 94 ms 4080 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 524 ms 32552 KB Output is correct
4 Correct 523 ms 31460 KB Output is correct
5 Correct 663 ms 32612 KB Output is correct
6 Correct 636 ms 31972 KB Output is correct
7 Correct 87 ms 4088 KB Output is correct
8 Correct 94 ms 4080 KB Output is correct
9 Correct 776 ms 32556 KB Output is correct
10 Correct 777 ms 32612 KB Output is correct
11 Correct 794 ms 32612 KB Output is correct