oj.uz

Submission #844612

# Submission time Handle Problem Language Result Execution time Memory
844612 2023-09-05T14:34:19 Z vjudge1 Holding (COCI20_holding) C++17
22 / 110
 26 ms 8672 KB 
#include <bits/stdc++.h>
using namespace std;
int dp[105][10005];
int dplast[105][10005];



signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, left, right, k; cin >> n >> left >> right >> k;

    vector<int> a(n+1);

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

    int sum = 0;
    for (int i = left; i <= right; i++) sum+=a[i];

    for(int l=0; l<=n; l++){
        for(int j=0; j<=k; j++){
            dp[l][j]=dplast[l][j]=sum;

        }
    }

    int ans=sum;

    for(int i=1; i<=n; i++){
        if(i>=left&&i<=right) continue;
        for(int l=left; l<=right; l++){
            for(int j=0; j<=k; j++){
                dp[l][j] = min(dp[l-1][j], dplast[l-1][j]);
                if(j>=abs(l-i))
                dp[l][j] = min(dp[l][j], dplast[l-1][j-abs(l-i)]-a[l]+a[i]);
                ans=min(ans, dp[l][j]);

            }
        }

        swap(dplast, dp);

        for(int l=0; l<=n; l++){
            for(int j=0; j<=k; j++){
                dp[l][j]=sum;

            }
        }
    }


    cout << ans;

}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8540 KB Output is correct
2 Correct 7 ms 8540 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 3 ms 8536 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 6 ms 8536 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8540 KB Output is correct
2 Correct 7 ms 8540 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 3 ms 8536 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 6 ms 8536 KB Output is correct
8 Incorrect 26 ms 8672 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8540 KB Output is correct
2 Correct 7 ms 8540 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 3 ms 8536 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 6 ms 8536 KB Output is correct
8 Incorrect 26 ms 8672 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8540 KB Output is correct
2 Correct 7 ms 8540 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 3 ms 8536 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 6 ms 8536 KB Output is correct
8 Incorrect 26 ms 8672 KB Output isn't correct
9 Halted 0 ms 0 KB -