oj.uz

답안 #212094

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212094 2020-03-22T09:10:28 Z NONAME Holding (COCI20_holding) C++17
88 / 110
 85 ms 106616 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 55;
const int K = 10010;
const int oo = 2e9;
int a[N], f[N][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 = 1; i <= n; i++)
        for (int j = 0; j <= n + 1; j++)
            for (int kl = 0; kl <= k; kl++)
                f[i][j][kl] = oo;
        
    for (int i = 0; i < n + 2; i++)
        fill(ans[i], ans[i] + k + 1, oo);
        
    f[l][l - 1][k] = 0;
    
    for (int i = l; i <= r; i++)
        f[l][l - 1][k] += a[i];
        
    for (int i = l; i > 0; i--)
        for (int j = l - 1; j <= r; j++)
            for (int ost = 0; ost <= k; ost++){
                if (f[i][j][ost] == oo) continue;
                
                ans[j][ost] = min(ans[j][ost], f[i][j][ost]);
                
                if (i > 0)
                    f[i - 1][j][ost] = min(f[i - 1][j][ost], f[i][j][ost]);
                
                if (j < r)
                    f[i][j + 1][ost] = min(f[i][j + 1][ost], f[i][j][ost]);
                
                if (i > 0 && j < r) {
                    int n1 = i - 1, n2 = j + 1;
                    f[n1][n2][ost - (n2 - n1)] = min(f[n1][n2][ost - (n2 - n1)], f[i][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 i = 1; i <= n; i++)
        for (int j = 0; j <= n + 1; j++)
            for (int kl = 0; kl <= k; kl++)
                f[i][j][kl] = oo;
        
    f[r][r + 1][k] = 0;
    
    for (int i = l; i <= r; i++)
        f[r][r + 1][k] += a[i];
        
    for (int i = r; i <= n; i++)
        for (int j = r + 1; j >= l; j--)
            for (int ost = 0; ost <= k; ost++){
                if (f[i][j][ost] == oo) continue;
                
                answ[j][ost] = min(answ[j][ost], f[i][j][ost]);
                
                if (i < n)
                    f[i + 1][j][ost] = min(f[i + 1][j][ost], f[i][j][ost]);
                
                if (j > l)
                    f[i][j - 1][ost] = min(f[i][j - 1][ost], f[i][j][ost]);
                
                if (i < n && j > l) {
                    int n1 = i + 1, n2 = j - 1;
                    f[n1][n2][ost - (n1 - n2)] = min(f[n1][n2][ost - (n1 - n2)], f[i][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 - f[r][r + 1][k];
    
    return 0;
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 10 ms 8192 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 10 ms 8192 KB Output is correct
8 Correct 10 ms 12032 KB Output is correct
9 Correct 12 ms 12416 KB Output is correct
10 Correct 11 ms 12544 KB Output is correct
11 Correct 13 ms 13568 KB Output is correct
12 Correct 11 ms 12544 KB Output is correct
13 Correct 79 ms 106616 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 10 ms 8192 KB Output is correct
8 Correct 10 ms 12032 KB Output is correct
9 Correct 12 ms 12416 KB Output is correct
10 Correct 11 ms 12544 KB Output is correct
11 Correct 13 ms 13568 KB Output is correct
12 Correct 11 ms 12544 KB Output is correct
13 Correct 79 ms 106616 KB Output is correct
14 Correct 9 ms 11392 KB Output is correct
15 Correct 10 ms 12160 KB Output is correct
16 Correct 9 ms 11904 KB Output is correct
17 Correct 11 ms 13056 KB Output is correct
18 Correct 12 ms 14080 KB Output is correct
19 Correct 85 ms 106616 KB Output is correct

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 10 ms 8192 KB Output is correct
8 Correct 10 ms 12032 KB Output is correct
9 Correct 12 ms 12416 KB Output is correct
10 Correct 11 ms 12544 KB Output is correct
11 Correct 13 ms 13568 KB Output is correct
12 Correct 11 ms 12544 KB Output is correct
13 Correct 79 ms 106616 KB Output is correct
14 Correct 9 ms 11392 KB Output is correct
15 Correct 10 ms 12160 KB Output is correct
16 Correct 9 ms 11904 KB Output is correct
17 Correct 11 ms 13056 KB Output is correct
18 Correct 12 ms 14080 KB Output is correct
19 Correct 85 ms 106616 KB Output is correct
20 Runtime error 57 ms 34424 KB Execution killed with signal 11 (could be triggered by violating memory limits)
21 Halted 0 ms 0 KB -