提出 #28758809

---

ソースコード 拡げる

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

int n;
vint v, used;
vvint A;


int dfs(int depth) {
    if (depth == n) {
        int ans = 0;
        rep(i,n) ans ^= v[i];
        return ans;
    }

    int s = -1;
    rep(i,2*n) if (!used[i]) {
        s = i;
        used[s] = 1;
        break;
    }

    int ans = 0;
    rep(j,2*n) {
        if (!used[j]) {
            used[j] = 1;
            v.push_back(A[s][j]);
            chmax(ans, dfs(depth+1));
            v.pop_back();
            used[j] = 0;
        }
    }
    used[s] = 0;

    return ans;
}

void solve() {
    cin >> n;
    A.resize(2*n, vint(2*n, 0));
    used.resize(2*n, 0);
    rep(i,2*n-1) {
        rep2(j,i+1,2*n) {
            cin >> A[i][j];
        }
    }

    cout << dfs(0) << endl;
}

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

提出情報

ジャッジ結果