oj.uz

Submission #499202

# Submission time Handle Problem Language Result Execution time Memory
499202 2021-12-27T12:37:46 Z LucaIlie XOR Sum (info1cup17_xorsum) C++17
7 / 100
 1600 ms 12688 KB 
#include <iostream>
#include <algorithm>
#include <math.h>

#define MAX_N 1000000

using namespace std;

int v[MAX_N], rest[MAX_N];

int countLower( int v[], int n, int a ) {
    int st, dr, mij;

    st = 0;
    dr = n;
    while ( dr - st > 1 ) {
        mij = (st + dr) / 2;

        if ( v[mij] > a )
            dr = mij;
        else
            st = mij;
    }

    if ( v[st] > a )
        return 0;
    return st + 1;
}

int main() {
    int n, r, maxLog2, st, dr, nrSume, res, i, p;

    cin >> n;
    maxLog2 = 0;
    for ( i = 0; i < n; i++ ) {
        cin >> v[i];
        if ( log2( v[i] ) > maxLog2 )
            maxLog2 = log2( v[i] );
    }

    res = 0;
    for ( p = 0; p <= maxLog2 + 1; p++ ) {
        for ( i = 0; i < n; i++ )
            rest[i] = v[i] & ((1 << (p + 1)) - 1);
        sort( rest, rest + n );
        nrSume = 0;
        for ( i = 0; i < n; i++ ) {
            r = v[i] & ((1 << (p + 1)) - 1);

            st = (1 << p) - r;
            if ( st < 0 )
                st += (1 << (p + 1));
            dr = (1 << (p + 1)) - 1 - r;
            if ( dr < 0 )
                dr += (1 << (p + 1));

            if ( st <= dr ) {
                nrSume += countLower( rest, n, dr ) - countLower( rest, n, st - 1 );
                if ( st <= r && r <= dr )
                    nrSume++;
            } else {
                nrSume += n - countLower( rest, n, st - 1 ) + countLower( rest, n, dr );
                if ( st <= r || r <= dr )
                    nrSume++;
            }
        }
        nrSume /= 2;

        if ( nrSume % 2 == 1 )
            res += (1 << p);
    }

    cout << res;

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 312 KB Output is correct
2 Correct 20 ms 372 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1648 ms 12688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1648 ms 12688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 312 KB Output is correct
2 Correct 20 ms 372 KB Output is correct
3 Incorrect 791 ms 2008 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 312 KB Output is correct
2 Correct 20 ms 372 KB Output is correct
3 Execution timed out 1648 ms 12688 KB Time limit exceeded
4 Halted 0 ms 0 KB -