oj.uz

Submission #970535

# Submission time Handle Problem Language Result Execution time Memory
970535 2024-04-26T16:44:35 Z RandomUser Holding (COCI20_holding) C++17
55 / 110
 97 ms 155948 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, l, r, K;
    cin >> n >> l >> r >> K;

    vector<int> v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i];

    int sum = 0;
    for(int i=l; i<=r; i++) sum += v[i];

    int dpL[l][n+1][K+1], dpR[n+2][n+2][K+1];
    memset(dpR, 0, sizeof(dpR));
    memset(dpL, 0, sizeof(dpL));

    for(int i=1; i<l; i++) {
        for(int j=l; j<=r; j++) {
            for(int k=0; k<=K; k++) {
                dpL[i][j][k] = min(dpL[i][j][k], dpL[i-1][j][k]);
                dpL[i][j][k] = min(dpL[i][j][k], dpL[i][j-1][k]);
                if(j - i <= k) dpL[i][j][k] = min(dpL[i][j][k], dpL[i-1][j-1][k-j+i] + v[i] - v[j]);
            }
        }
    }

    for(int i=r; i>=l; i--) {
        for(int j=n; j>=r+1; j--) {
            for(int k=0; k<=K; k++) {
                dpR[i][j][k] = min(dpR[i][j][k], dpR[i+1][j][k]);
                dpR[i][j][k] = min(dpR[i][j][k], dpR[i][j+1][k]);
                if(j - i <= k) dpR[i][j][k] = min(dpR[i][j][k], dpR[i-1][j-1][k-j+i] + v[j] - v[i]);
            }
        }
    }

    int mn = min(dpL[l-1][r][K], dpR[l][r+1][K]);
    for(int i=l; i<r; i++)
        for(int j=0; j<=K; j++)
            mn = min(mn, dpL[l-1][i][j] + dpR[i+1][r+1][K-j]);

    cout << sum + mn << '\n';
    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 9 ms 11056 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 9 ms 11056 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct
11 Correct 2 ms 3160 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 97 ms 155948 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 9 ms 11056 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct
11 Correct 2 ms 3160 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 97 ms 155948 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Incorrect 1 ms 952 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 9 ms 11056 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct
11 Correct 2 ms 3160 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 97 ms 155948 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Incorrect 1 ms 952 KB Output isn't correct
17 Halted 0 ms 0 KB -