Submission #624927

#	Time	Username	Problem	Language	Result	Execution time	Memory
624927		Soul234	Holding (COCI20_holding)	C++14	110 / 110	80 ms	10540 KiB

holding

#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;

const int MXN = 1e2+5, MXK = 1e4+5;
int dp[2][MXN][MXK];

int N, L, R, K, A[MXN], ansL[MXN][MXK];
int sum = 0;

void solve() {
    cin >> N >> L >> R >> K;
    FOR(i,1,N+1) {
        cin>>A[i];
        if(i >= L && i <= R) sum += A[i];
    }
    FOR(i,L,R+1) {
        memset(dp[i&1], 0, sizeof dp[i&1]);
        ROF(j,1,L) {
            F0R(k, K+1) {
                dp[i&1][j][k] = max(dp[(i-1)&1][j][k], dp[i&1][j+1][k]);
                if(k >= i-j) ckmax(dp[i&1][j][k], dp[(i-1)&1][j+1][k-i+j] + A[i] - A[j]);
                if(j == 1) ckmax(ansL[i][k], dp[i&1][j][k]);
            }
        }
    }
    int mx = ansL[R][K];
    ROF(i,L,R+1) {
        memset(dp[i&1], 0, sizeof dp[i&1]);
        FOR(j,R+1, N+1)
            F0R(k, K+1) {
                dp[i&1][j][k] = max(dp[(i+1)&1][j][k], dp[i&1][j-1][k]);
                if(k >= j-i) ckmax(dp[i&1][j][k], dp[(i+1)&1][j-1][k-j+i] + A[i] - A[j]);
                if(j == N && i <= R+1 && i >= L) ckmax(mx, ansL[i-1][K-k] + dp[i&1][j][k]);
            }
    }
    cout << sum - mx << nl;
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message (stderr)

holding.cpp: In function 'void setIO(std::string)':
holding.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
holding.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 22 / 22
• Subtask 2: 33 / 33
• Subtask 3: 33 / 33
• Subtask 4: 22 / 22