Submission #8509639

---

Source Code Expand

#include <assert.h>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
 
#define rep(i, a, b) for (long long(i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(i) std::cerr << "debug " << i << std::endl
 
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}
 
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (int i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}
 
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
 
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}
 
long long pow_mod(long long a, long long b, long long mod=-1) {
  if ((a == 0)||(mod!=-1&&a%mod==0)) {
    return 0;
  }
 
  long long x = 1;
 
  while (b > 0) {
    if (b & 1) {
      x = (mod!=-1)?(x * a) % mod:x*a;
    }
    a = (mod!=-1)?(a * a) % mod:a*a;
    b >>= 1;
  }
  return x;
}

using ll = long long;
using P = std::pair<ll, ll>;
 
// const long long MOD = 998244353;
const long long MOD = 1e9 + 7;

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);

  ll n;
  std::cin>>n;

  std::vector<ll> a(n),b(n);
  rep(i,0,n)std::cin>>a[i];
  rep(i,0,n)std::cin>>b[i];

  ll ans=0;

  rep(bit,0,28){
    std::vector<ll> temp(n);
    rep(i,0,n)temp[i]=b[i]%(1ll<<(bit+1));
    std::sort(all(temp));

    ll cnt=0;

    rep(i,0,n){
      ll now=a[i]%(1ll<<(bit+1));
      cnt+=(ll)(std::lower_bound(all(temp),(1ll<<(bit+1))-now)-std::lower_bound(all(temp),(1ll<<bit)-now));
      cnt+=(ll)(std::lower_bound(all(temp),4*(1ll<<bit)-now)-std::lower_bound(all(temp),3*(1ll<<bit)-now));
    }

    if(cnt%2)ans+=(1ll<<bit);
  }

  std::cout<<ans<<"\n";

  return 0;
}

Submission Info

Judge Result