Submission #29338202

---

Source Code Expand

// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
// using P = pair<ll,ll>;
using P = pair<int,int>;
using vint = vector<int>;
using vll = vector<ll>;
using vvint = vector<vector<int>>;
using vvll = vector<vector<ll>>;

// const ll INF = (ll)2e18+9;
const int INF = (int)2e9+7;
// const ll MOD = (ll)1e9+9;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

template<typename T>
void print(vector<T> v) {
    int n = v.size();
    rep(i,n) {
        if (i == 0) cout << v[i];
        else cout << ' ' << v[i];
    }
    cout << endl;
}

bool hasBit(ll x, int i) {
    return (x>>i)&1;
}

void solve() {
    int n;
    cin >> n;
    vll a(n);
    rep(i,n) cin >> a[i];

    ll ans = 0;
    rep(i,n) ans += a[i];

    vll nbits(30, 0);
    for (ll x : a) {
        rep(i,30) if (hasBit(x, i)) nbits[i]++;
    }

    for (ll x : a) {
        ll tot = 0;
        rep(i,30) {
            if (hasBit(x, i)) tot += (n- nbits[i]) * (1ll<<i);
            else tot += nbits[i] * (1ll<<i);
        }
        chmax(ans, tot);
    }
    cout << ans << endl;
}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result