Submission #496781

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
496781	2021-12-22T04:29:43 Z	armashka	XOR Sum (info1cup17_xorsum)	C++17	Compilation error	0 ms	0 KB

xorsum

#include <bits/stdc++.h>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            

ll n, a[N], cnt[N], ans;

const void solve(/*Armashka*/) {
	cin >> n;
	int mx = 0;
	for (int i = 1; i <= n; ++ i) cin >> a[i], mx = max(mx, a[i]);
	if (mx <= 4e3) {
		for (int i = 1; i <= n; ++ i) ++ cnt[a[i]];
		for (int i = 1; i <= 4e3; ++ i) {
			for (int j = i; j <= 4e3; ++ j) {
				ll col = cnt[i] * cnt[j];
				if (i == j) col = cnt[i] + cnt[i] * (cnt[i] - 1) / 2;
				if (odd(col)) ans ^= (i + j);
			}
		}
	} else {
		for (int i = 1; i <= n; ++ i) {
			for (int j = i; j <= n; ++ j) ans ^= (a[i] + a[j]);
		}
	}
	cout << ans << "\n";
}
            
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
        solve();
    }
}
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

Compilation message

xorsum.cpp:3: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    3 | #pragma comment(linker, "/stack:200000000")
      | 
xorsum.cpp: In function 'const void solve()':
xorsum.cpp:36:62: error: no matching function for call to 'max(int&, ll&)'
   36 |  for (int i = 1; i <= n; ++ i) cin >> a[i], mx = max(mx, a[i]);
      |                                                              ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from xorsum.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
xorsum.cpp:36:62: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'll' {aka 'long long int'})
   36 |  for (int i = 1; i <= n; ++ i) cin >> a[i], mx = max(mx, a[i]);
      |                                                              ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from xorsum.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:300:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  300 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:300:5: note:   template argument deduction/substitution failed:
xorsum.cpp:36:62: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'll' {aka 'long long int'})
   36 |  for (int i = 1; i <= n; ++ i) cin >> a[i], mx = max(mx, a[i]);
      |                                                              ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from xorsum.cpp:1:
/usr/include/c++/10/bits/stl_algo.h:3480:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)'
 3480 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3480:5: note:   template argument deduction/substitution failed:
xorsum.cpp:36:62: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   36 |  for (int i = 1; i <= n; ++ i) cin >> a[i], mx = max(mx, a[i]);
      |                                                              ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from xorsum.cpp:1:
/usr/include/c++/10/bits/stl_algo.h:3486:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3486 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3486:5: note:   template argument deduction/substitution failed:
xorsum.cpp:36:62: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   36 |  for (int i = 1; i <= n; ++ i) cin >> a[i], mx = max(mx, a[i]);
      |                                                              ^