Submission #844916

#	Time	Username	Problem	Language	Result	Execution time	Memory
844916		fanwen	Holding (COCI20_holding)	C++17	110 / 110	88 ms	8536 KiB

holding

#include <bits/stdc++.h>

using namespace std;

#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }

template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

const int MAXN = 101;

int N, L, R, A[MAXN], K, dp[2][MAXN][MAXN * MAXN];

void you_make_it(void) {
    cin >> N >> L >> R >> K;
    int length = R - L + 1;
    FOR(i, 1, N) cin >> A[i];
    memset(dp, 0x3f, sizeof dp);
    dp[0][0][0] = 0;
    FOR(i, 1, N) {
    	memset(dp[i & 1], 0x3f, sizeof dp[i & 1]);
    	FOR(j, 0, length) {
    		FOR(k, 0, K) {
    			dp[i & 1][j][k] = dp[(i - 1) & 1][j][k];
    			if(j > 0) {
    				int cost = abs(i - (L + j - 1));
    				if(k - cost >= 0) {
    					minimize(dp[i & 1][j][k], dp[(i - 1) & 1][j - 1][k - cost] + A[i]);
    				}
    			}
    		}
    	}
    }
    cout << *min_element(dp[N & 1][length], dp[N & 1][length] + K + 1);
}

signed main() {

#ifdef LOCAL
    freopen("TASK.inp", "r", stdin);
    freopen("TASK.out", "w", stdout);
#endif
    auto start_time = chrono::steady_clock::now();

    cin.tie(0), cout.tie(0) -> sync_with_stdio(0);

    you_make_it();

    auto end_time = chrono::steady_clock::now();

    cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;

    return (0 ^ 0);
}

// Dream it. Wish it. Do it.

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