oj.uz

답안 #742046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
742046 2023-05-15T13:09:37 Z marvinthang XOR Sum (info1cup17_xorsum) C++17
100 / 100
 525 ms 17272 KB 
/*************************************
*    author: marvinthang             *
*    created: 15.05.2023 19:40:24    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

const int MAX = 1e6 + 6;
const int LOG = 30;

int N, A[MAX], B[MAX];

void init(void) {
    cin >> N;
    REP(i, N) cin >> A[i];
}

void process(void) {
    int res = 0;
    REP(b, LOG) {
        vector <int> left, right;
        REP(i, N) (BIT(A[i], b) ? right : left).push_back(A[i]);
        copy(ALL(left), A);
        copy(ALL(right), A + left.size());
        int j = N, k = N, l = N;
        REP(i, N) B[i] = A[i] & (MASK(b + 1) - 1);
        REP(i, N) {
            j = max(j, i);
            k = max(k, i);
            l = max(l, i);
            while (j > i && B[j - 1] + B[i] >= MASK(b)) --j;
            while (k > i && B[k - 1] + B[i] >= MASK(b + 1)) --k;
            while (l > i && B[l - 1] + B[i] >= MASK(b + 1) + MASK(b)) --l;
            if (k - j + N - l & 1) res ^= MASK(b);
        }
    }
    cout << res << '\n';
}

int main(void) {
    ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
    file("test");
    init();
    process();
    cerr << "Time elapsed: " << TIME << " s.\n";
    return (0^0);
}

Compilation message

xorsum.cpp: In function 'void process()':
xorsum.cpp:71:27: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   71 |             if (k - j + N - l & 1) res ^= MASK(b);
      |                 ~~~~~~~~~~^~~
xorsum.cpp: In function 'int main()':
xorsum.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
xorsum.cpp:79:5: note: in expansion of macro 'file'
   79 |     file("test");
      |     ^~~~
xorsum.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
xorsum.cpp:79:5: note: in expansion of macro 'file'
   79 |     file("test");
      |     ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 3 ms 436 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 403 ms 17184 KB Output is correct
2 Correct 377 ms 15476 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 403 ms 17184 KB Output is correct
2 Correct 377 ms 15476 KB Output is correct
3 Correct 450 ms 16924 KB Output is correct
4 Correct 403 ms 16644 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 3 ms 436 KB Output is correct
3 Correct 53 ms 2080 KB Output is correct
4 Correct 53 ms 2116 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 3 ms 436 KB Output is correct
3 Correct 403 ms 17184 KB Output is correct
4 Correct 377 ms 15476 KB Output is correct
5 Correct 450 ms 16924 KB Output is correct
6 Correct 403 ms 16644 KB Output is correct
7 Correct 53 ms 2080 KB Output is correct
8 Correct 53 ms 2116 KB Output is correct
9 Correct 525 ms 17272 KB Output is correct
10 Correct 507 ms 17228 KB Output is correct
11 Correct 495 ms 17260 KB Output is correct