problem-sulving/AtCoder-abc171_e.cpp at main · sweetpotatoX/problem-sulving · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
//
// Created by abdob on 10/29/2022.
//
#include <bits/stdc++.h>

#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))

using namespace std;

template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; }
template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; }
template<typename T> istream& operator >> (istream& is, vector<T>& v) { for (auto& i: v) is >> i; return is; }
template<typename T> ostream& operator << (ostream& os, set<T> s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; }
template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; }

template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); }
template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); }

using lli = long long int;
using ull = unsigned long long;
using point = complex<double>;
using str = string;
template<typename T> using vec = vector<T>;

constexpr array<int, 8> di({0, 1, -1, 0, 1, -1, 1, -1});
constexpr array<int, 8> dj({1, 0, 0, -1, 1, -1, -1, 1});
constexpr lli mod = 1e9 + 7;

int main(int argc, char *argv[])
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.setf(ios_base::fixed);
    cout.precision(15);

    int n;
    while (cin >> n) {
        vec<lli> a(n);
        cin >> a;

        vec<lli> b(n, 0);

        for (int i = 0; i < 40; ++i) {
            vec<lli> c;
            each (j, a) {
                c.push_back(j & (1LL << i));
            }
            each (i, c) i = !!i;

            vec<lli> d;
            each (i, c) {
                if (i) d.push_back(0);
                else d.push_back(1);
            }
            lli x = 0;
            each (i, c) x ^= i;
            bool f = true;
            for (int j = 0; j < c.size(); ++j) {
                f = f && ((c[j] ^ x) == d[j]);
            }
            f = !f;
            for (int j = 0; j < c.size(); ++j) {
                b[j] |= (lli)(d[j] ^ f) << i;
            }
        }

        for (int i = 0; i < b.size(); ++i) {
            if (i) cout << ' ';
            cout << b[i];
        }
        cout << endl;
    }

    return 0;
}