Submission #5277094

---

Source Code Expand

#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;

template <typename T>
void printv(const vector<T> &v)
{
    int sz = v.size();
    for (int i = 0; i < sz; i++)
    {
        cout << v[i] << " \n"[i == sz - 1];
    }
}

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

    int n;
    cin >> n;
    vector<ll> a(n), dig(60, 0);
    cin >> a[0];
    cout << 0 << endl;
    ll x = a[0];
    for (int i = 1; i < n; i++)
    {
        cin >> a[i];
        for (int j = 0; j < 30; j++)
        {
            if (a[i] & (1 << j))
            {
                dig[j] = i - dig[j];
            }
        }
        ll sum = 0, c = 0;
        for (int j = 0; j < 50; j++)
        {
            if ((c + dig[j]) % 2)
                sum += (1LL << j);
            c = (c + dig[j]) / 2;
        }
        cout << x + sum << endl;
        for (int j = 0; j < 30; j++)
        {
            if (x & (1 << j))
            {
                dig[j]++;
            }
        }
        x ^= a[i];
    }
}

Submission Info

Judge Result