oj.uz

답안 #67980

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
67980 2018-08-15T16:27:05 Z cdemirer XOR Sum (info1cup17_xorsum) C++17
45 / 100
 1600 ms 24684 KB 
#include <bits/stdc++.h>
#include <limits>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef pair<double, double> dodo;
typedef pair<ll, ll> llp;
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)


ll N;
vector<ll> A;
ll ans[31] = {0};

int main(int argc, char **argv) {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	cin >> N;
	A.resize(N);
	for (int i = 0; i < N; i++) cin >> A[i];
	
	for (ll k = 0; k < 31; k++) {
		vector<ll> B;
		for (int i = 0; i < A.size(); i++) if (!(A[i] & (1<<k))) B.pb(A[i]);
		for (int i = 0; i < A.size(); i++) if ((A[i] & (1<<k))) B.pb(A[i]);
		A = B;
		llp limits = mp(1<<k, (1<<(k+1))-1);
		llp range = mp(N-1, N-1);
		ll cnt = 0;
		for (int i = 0; i < N; i++) {
			while (range.first >= 0 && A[range.first]%(1<<(k+1)) + A[i]%(1<<(k+1)) >= limits.first) range.first--;
			while (range.second >= 0 && A[range.second]%(1<<(k+1)) + A[i]%(1<<(k+1)) > limits.second) range.second--;
			ans[k] += range.second - range.first;
			if (i > range.first && i <= range.second) cnt++;
		}
		ll limit = (1<<(k+1)) + (1<<k);
		range = mp(N-1, N-1);
		for (int i = 0; i < N; i++) {
			while (range.first >= 0 && A[range.first]%(1<<(k+1)) + A[i]%(1<<(k+1)) >= limit) range.first--;
			ans[k] += range.second - range.first;
			if (i > range.first && i <= range.second) cnt++;
		}
		ans[k] = (ans[k]+cnt)/2;
	}
	ll out = 0;
	for (int k = 0; k < 31; k++) {
		out |= ((ans[k]%2)<<k);
	}
	cout << out << endl;

	return 0;
}

Compilation message

xorsum.cpp: In function 'int main(int, char**)':
xorsum.cpp:30:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < A.size(); i++) if (!(A[i] & (1<<k))) B.pb(A[i]);
                   ~~^~~~~~~~~~
xorsum.cpp:31:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < A.size(); i++) if ((A[i] & (1<<k))) B.pb(A[i]);
                   ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 376 KB Output is correct
2 Correct 20 ms 652 KB Output is correct

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1667 ms 24684 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1667 ms 24684 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 376 KB Output is correct
2 Correct 20 ms 652 KB Output is correct
3 Correct 472 ms 24684 KB Output is correct
4 Correct 488 ms 24684 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 376 KB Output is correct
2 Correct 20 ms 652 KB Output is correct
3 Execution timed out 1667 ms 24684 KB Time limit exceeded
4 Halted 0 ms 0 KB -