Submission #67983

#TimeUsernameProblemLanguageResultExecution timeMemory
67983cdemirerXOR Sum (info1cup17_xorsum)C++17
Compilation error
0 ms0 KiB
#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; ll A[1000000]; ll B[1000000]; int bcnt; 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++) { bcnt = 0; for (int i = 0; i < N; i++) if (!(A[i] & (1<<k))) B[bcnt++] = (A[i]); for (int i = 0; i < N; i++) if ((A[i] & (1<<k))) B[bcnt++] = (A[i]); for (int i = 0; i < N; i++) A[i] = B[i]; 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 (stderr)

xorsum.cpp: In function 'int main(int, char**)':
xorsum.cpp:27:4: error: request for member 'resize' in 'A', which is of non-class type 'll [1000000] {aka long long int [1000000]}'
  A.resize(N);
    ^~~~~~