Submission #887208

#	Time	Username	Problem	Language	Result	Execution time	Memory
887208		zeta7532	Cigle (COI21_cigle)	C++17	20 / 100	496 ms	524288 KiB

cigle

#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)

ll f(vector<ll> &A,ll l,ll x,ll r){
    set<ll> s;
    ll cnt1=0;
    for(ll i=x;i>l;i--){
        cnt1+=A[i];
        s.insert(cnt1);
    }
    ll cnt2=0;
    for(ll i=x+1;i<r;i++){
        cnt2+=A[i];
        s.insert(cnt2);
    }
    return (r-l-1)-(ll)s.size();
}

int main() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];
    vector<vector<vector<ll>>> dp(N,vector<vector<ll>>(N,vector<ll>(N)));
    rep(i,N) rep(j,N) rep(k,N) dp[i][j][k]=f(A,i,j,k);
    vector<vector<ll>> ep(N,vector<ll>(N,0));
    rep(i,N){
        rep(j,N){
            rep(k,N){
                if(j<i) continue;
                if(k<j+1) continue;
                ep[j+1][k]=max(ep[j+1][k],ep[i][j]+dp[i][j][k]);
            }
        }
    }
    ll ans=0;
    rep(i,N) ans=max(ans,ep[i][N-1]);
    cout << ans << endl;
    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 11 / 11
• Subtask 3: 0 / 13
• Subtask 4: 0 / 15
• Subtask 5: 0 / 52