제출 #1092510

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1092510		pubin06	XOR Sum (info1cup17_xorsum)	C++14	100 / 100	540 ms	24172 KiB

xorsum

#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(v) (int)(v).size()
using namespace std;
 
const int MXn = 1000005;
const long long oo = 1e18;
const int MOD = 1e9 + 7;
 
int N;
int a[MXn];
int t[MXn];
 
signed main(void) {
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    
    cin >> N;
    for (int i = 1; i <= N; i++) cin >> a[i];
    int mask = 0;
    int ans = 0;
    vector<int> v[2];
    v[0].resize(N);
    iota(begin(v[0]), end(v[0]), 1);
    for (int k = 0; k < 30; k++) {
    	mask |= (1 << k);
    	int num = 0;
    	vector<int> tmp[2];
    	for (int id: v[0]) tmp[(a[id] >> k) & 1].emplace_back(id);
    	for (int id: v[1]) tmp[(a[id] >> k) & 1].emplace_back(id);
    	v[0] = tmp[0];
    	v[1] = tmp[1];
    	for (int id: v[0]) t[++num] = (a[id] & mask);
    	for (int id: v[1]) t[++num] = (a[id] & mask);
    	int p1 = N, p2 = N, p3 = N;
    	int cnt = 0;
    	for (int i = 1; i <= N; i++) {
    		while (t[i] + t[p1] >= (1 << k) && p1 >= i) p1--;
    		while (t[i] + t[p2] >= (1 << (k + 1)) && p2 >= i) p2--;
    		while (t[i] + t[p3] >= ((1 << (k + 1)) + (1 << k)) && p3 >= i) p3--;
    		cnt += (max(p2, i - 1) - max(p1, i - 1)) + (N - max(i, p3 + 1) + 1);
    		cnt &= 1;
    	}
    	ans += (cnt << k);
    }
    cout << ans;
    
    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 21 / 21
• Subtask 4: 38 / 38
• Subtask 5: 23 / 23