Submission #486965

#	Time	Username	Problem	Language	Result	Execution time	Memory
486965		Neos	Holding (COCI20_holding)	C++14	88 / 110	25 ms	16280 KiB

holding

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

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vii> vvii;

#define task "holding"
#define fastIO ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define forw(i, l, r) for( ll i = (l) ; i < (r) ; i++ )
#define forb(i, r, l) for( ll i = (r) ; i >= (l) ; i-- )
#define numBit(x) (__builtin_popcountll(1ll * (x)))
#define getBit(x, i) ((x) >> (i) & 1)
#define sz(x) (int)x.size()
#define mp make_pair
#define fi first
#define se second
#define ar array
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(x) cerr << #x << " = " << x << '\n';

const int N = 101;
const int M = 2502;

int n, l, r, k, a[N];
int dp[N][N][M];

int DP(int pos, int _at, int k) {
    if (_at > r) return (k < 0 ? 1e9 : 0);
    if (pos > n || k < 0) return 1e9;
    if (dp[pos][_at][k]) return dp[pos][_at][k];

    int cost = abs(pos - _at);

    int mn = DP(pos + 1, _at, k);
    if (k >= cost) mn = min(mn, DP(pos + 1, _at + 1, k - cost) + a[pos]);
    return dp[pos][_at][k] = mn;
}

int main() {
//    fastIO;
    cin >> n >> l >> r >> k;
    forw(i, 1, n + 1) cin >> a[i];
    cout << DP(1, l, k);
}

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