Submission #28811515

---

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;
}

void solve() {
    int n;
    cin >> n;
    int n2 = 1ll<<n;
    vector<P> spices(n2);
    rep(i,n2-1) {
        ll c;
        cin >> c;
        spices[i] = {c,i+1};
    }
    sort(all(spices));

    vint base(n, 0);
    ll ans = 0;
    for (auto [cost, x] : spices) {
        rep(i,n) if (x>>i&1) x ^= base[i];
        if (x == 0) continue;
        ans += cost;
        int i = 0;
        while (!(x>>i&1)) i++;
        base[i] = x;
    }
    // print(base);
    // rep(i,n) rep(j,n) if ((base[i]>>j&1) && i != j) base[i] ^= base[j];
    // print(base);
    cout << ans << endl;
}

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

Submission Info

Judge Result