提出 #64374423

---

ソースコード 拡げる

#include <bits/stdc++.h>

#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;

template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }

const int maxn = 511;
i64 dp[maxn][maxn];
i64 a[maxn], pa[maxn];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    cout << fixed;
#ifdef LOCAL_DEFINE
    freopen("input.txt", "rt", stdin);
#endif

    int n;
    cin >> n;
    forn(i, n) cin >> a[i];
    forn(i, n) pa[i + 1] = pa[i] ^ a[i];

    forn(l, n + 1) forn(r, n + 1) dp[l][r] = 1e18;

    forn(r, n + 1) ford(l, r) {
        if (r - l == 1) {
            dp[l][r] = 0;
            continue;
        }
        if ((r - l) & 1) {
            fore(m, l + 1, r - 1) uin(dp[l][r], dp[l][m] + dp[m][r]);
        } else {
            i64 seg = pa[l] ^ pa[r];
            fore(m, l + 1, r - 1) uin(dp[l][r], dp[l][m] + dp[m][r] + ((m - l) & 1 ? 2 * seg : 0LL));
        }
    }

    i64 ans = dp[0][n];
    if (n & 1) ans += pa[n];
    cout << ans << '\n';

#ifdef LOCAL_DEFINE
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
    return 0;
}

提出情報

ジャッジ結果