Submission #229231

#	Time	Username	Problem	Language	Result	Execution time	Memory
229231		VEGAnn	Holding (COCI20_holding)	C++14	110 / 110	59 ms	12536 KiB

holding

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 110;
const int K = 10010;
const int oo = 2e9;
int a[N], f[2][N][K], n, l, r, k, ans[N][K], answ[N][K], res = oo;

int main(){
    
    ios_base::sync_with_stdio(0); cin.tie(0);
    
//    freopen("in.txt","r",stdin);

    cin >> n >> l >> r >> k;
        
    for (int i = 1; i <= n; i++)
        cin >> a[i];
        
    for (int i = 0; i < n + 2; i++)
        fill(ans[i], ans[i] + k + 1, oo);
        
    for (int j = l - 1; j <= r; j++)
        for (int ost = 0; ost <= k; ost++)
            f[0][j][ost] = oo;
        
    f[0][l - 1][k] = 0;
    
    for (int i = l; i <= r; i++)
        f[0][l - 1][k] += a[i];
        
    int sum = f[0][l - 1][k], it = 0;
        
    for (int i = l; i > 0; i--, it ^= 1) {
            
        for (int j = l - 1; j <= r; j++)
            for (int ost = 0; ost <= k; ost++)
                f[it ^ 1][j][ost] = oo;
            
        for (int j = l - 1; j <= r; j++)
            for (int ost = 0; ost <= k; ost++){
                if (f[it][j][ost] == oo) continue;
                
                ans[j][ost] = min(ans[j][ost], f[it][j][ost]);
                
                if (i > 0)
                    f[it ^ 1][j][ost] = min(f[it ^ 1][j][ost], f[it][j][ost]);
                
                if (j < r)
                    f[it][j + 1][ost] = min(f[it][j + 1][ost], f[it][j][ost]);
                
                if (i > 0 && j < r) {
                    int n1 = i - 1, n2 = j + 1;
                    f[it ^ 1][n2][ost - (n2 - n1)] = min(f[it ^ 1][n2][ost - (n2 - n1)], f[it][j][ost] + a[n1] - a[n2]);
                }
            }
    }
    
    for (int ost = k; ost >= 0; ost--) 
        for (int i = l - 1; i <= r; i++){
            if (i >= l)
                ans[i][ost] = min(ans[i][ost], ans[i - 1][ost]);
            
            if (ost >= 0)
                ans[i][ost - 1] = min(ans[i][ost - 1], ans[i][ost]);
        }
    
    // right side
    
    for (int i = 0; i < n + 2; i++)
        fill(answ[i], answ[i] + k + 1, oo);
    
    for (int j = r + 1; j >= l; j--)
        for (int ost = 0; ost <= k; ost++)
            f[0][j][ost] = oo;
        
    it = 0;
    f[0][r + 1][k] = 0;
    
    for (int i = l; i <= r; i++)
        f[0][r + 1][k] += a[i];
        
    for (int i = r; i <= n; i++, it ^= 1){
            
        for (int j = r + 1; j >= l; j--)
            for (int ost = 0; ost <= k; ost++)
                f[it ^ 1][j][ost] = oo;
            
        for (int j = r + 1; j >= l; j--)
            for (int ost = 0; ost <= k; ost++){
                if (f[it][j][ost] == oo) continue;
                
                answ[j][ost] = min(answ[j][ost], f[it][j][ost]);
                
                if (i < n)
                    f[it ^ 1][j][ost] = min(f[it ^ 1][j][ost], f[it][j][ost]);
                
                if (j > l)
                    f[it][j - 1][ost] = min(f[it][j - 1][ost], f[it][j][ost]);
                
                if (i < n && j > l) {
                    int n1 = i + 1, n2 = j - 1;
                    f[it ^ 1][n2][ost - (n1 - n2)] = min(f[it ^ 1][n2][ost - (n1 - n2)], f[it][j][ost] + a[n1] - a[n2]);
                }
            }
    }
    
    for (int i = r + 1; i >= l; i--)
        for (int ost = 0; ost <= k; ost++) {
            if (i <= r)
                answ[i][ost] = min(answ[i][ost], answ[i + 1][ost]);
            
            int opp = k - ost;
            
            if (ans[i - 1][opp] < oo && answ[i][ost] < oo) 
                res = min(res, ans[i - 1][opp] + answ[i][ost]);
        }
        
    cout << res - sum;
    
    return 0;
}

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