oj.uz

답안 #818010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
818010 2023-08-09T23:26:20 Z farhan132 XOR Sum (info1cup17_xorsum) C++17
56 / 100
 1600 ms 26872 KB 
/***Farhan132***/
#pragma GCC optimize("Ofast,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>

using namespace std;
 
typedef int ll;
typedef double dd;
typedef pair<ll , ll> ii;
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clz(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
const ll mod =  (ll) 998244353;
// const ll mod =  (ll) 1e9 + 7;
const ll inf = numeric_limits<int>::max()-5;
const ll INF = (ll)2e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 1e6 + 5;

ll a[N];

ll bucket[N];

void solve(){

    ll n; cin >> n;

    ll ans = 0;
    mem(bucket, 0);

    for(ll i = 1; i <= n; i++) cin >> a[i];

    for(ll b = 0; b < 30; b++){
        vector < ll > A;
        for(ll i = 1; i <= n; i++){
            A.pb(a[i] % (1 << (b + 1)));
        }
        long long cnt = 0;
        ll now_bit = (1 << b); ll nxt_bit = (1 << (b + 1));
        if(nxt_bit < N){
            for(ll i = 0; i < n; i++){
                bucket[A[i]]++;
            }
            vector < ll > B;
            for(ll i = 0; i < N; i++){
                while(bucket[i]){
                    B.pb(i);
                    bucket[i]--;
                }
            }
            A = B;
        }else{
            sort(A.begin(), A.end());
        }
        ll l = n, r = n;
        for(ll i = 0; i < n; i++){
            while(l > 0 && A[l - 1] >= now_bit - A[i]) l--;
            while(r > 0 && A[r - 1] >= nxt_bit - A[i]) r--;
            if(r > i){
                cnt += r - max(i, l);
            }
        }
        l = n;
        for(ll i = 0; i < n; i++){
            while(l > 0 && A[l - 1] >= now_bit + nxt_bit - A[i]) l--;
            cnt += n - max(l, i);
        }
        if(cnt & 1) ans |= (1 << b);
    }

    cout << ans << '\n';



   return;
}

int main() {

    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        auto start_time = clock();
    #else
         // freopen("subsequence.in", "r", stdin);
         // freopen("subsequence.out", "w", stdout); 
         ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif

    //precalc();
 
    ll T = 1, CT = 0; //cin >> T; 
 
    while(T--){
        // cout << "Case #" << ++CT << ": ";
        solve();
    }
    
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

xorsum.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      | 
xorsum.cpp: In function 'int main()':
xorsum.cpp:118:15: warning: unused variable 'CT' [-Wunused-variable]
  118 |     ll T = 1, CT = 0; //cin >> T;
      |               ^~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 4308 KB Output is correct
2 Correct 37 ms 4308 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1338 ms 20124 KB Output is correct
2 Correct 1268 ms 23708 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1338 ms 20124 KB Output is correct
2 Correct 1268 ms 23708 KB Output is correct
3 Execution timed out 1601 ms 26872 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 4308 KB Output is correct
2 Correct 37 ms 4308 KB Output is correct
3 Correct 183 ms 5960 KB Output is correct
4 Correct 184 ms 5960 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 4308 KB Output is correct
2 Correct 37 ms 4308 KB Output is correct
3 Correct 1338 ms 20124 KB Output is correct
4 Correct 1268 ms 23708 KB Output is correct
5 Execution timed out 1601 ms 26872 KB Time limit exceeded
6 Halted 0 ms 0 KB -