oj.uz

Submission #212065

# Submission time Handle Problem Language Result Execution time Memory
212065 2020-03-22T08:14:05 Z NONAME Holding (COCI20_holding) C++17
55 / 110
 71 ms 100472 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 = oo;

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

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

    for (int i = 1; i <= n; i++)
        for (int j = 0; j <= n; j++)
            for (int kl = 0; kl <= k; kl++)
                f[i][j][kl] = 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 <= n; j++)
            for (int ost = 0; ost <= k; ost++){
                if (f[i][j][ost] == oo) continue;
                
                ans = min(ans, f[i][j][ost]);
                
                for (int nw = i - 1; nw > 0; nw--)
                    for (int n2 = j + 1; n2 <= n; n2++)
                        if (ost - (n2 - nw) >= 0)
                            f[nw][n2][ost - (n2 - nw)] = min(f[nw][n2][ost - (n2 - nw)], f[i][j][ost] + a[nw] - a[n2]);
            }
    
    cout << ans;
    
    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 5 ms 1152 KB Output is correct
6 Correct 5 ms 1152 KB Output is correct
7 Correct 8 ms 6528 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 5 ms 1152 KB Output is correct
6 Correct 5 ms 1152 KB Output is correct
7 Correct 8 ms 6528 KB Output is correct
8 Correct 13 ms 11264 KB Output is correct
9 Correct 12 ms 11520 KB Output is correct
10 Correct 15 ms 11648 KB Output is correct
11 Correct 17 ms 12672 KB Output is correct
12 Correct 12 ms 11648 KB Output is correct
13 Correct 71 ms 100472 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 5 ms 1152 KB Output is correct
6 Correct 5 ms 1152 KB Output is correct
7 Correct 8 ms 6528 KB Output is correct
8 Correct 13 ms 11264 KB Output is correct
9 Correct 12 ms 11520 KB Output is correct
10 Correct 15 ms 11648 KB Output is correct
11 Correct 17 ms 12672 KB Output is correct
12 Correct 12 ms 11648 KB Output is correct
13 Correct 71 ms 100472 KB Output is correct
14 Runtime error 12 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 5 ms 1152 KB Output is correct
5 Correct 5 ms 1152 KB Output is correct
6 Correct 5 ms 1152 KB Output is correct
7 Correct 8 ms 6528 KB Output is correct
8 Correct 13 ms 11264 KB Output is correct
9 Correct 12 ms 11520 KB Output is correct
10 Correct 15 ms 11648 KB Output is correct
11 Correct 17 ms 12672 KB Output is correct
12 Correct 12 ms 11648 KB Output is correct
13 Correct 71 ms 100472 KB Output is correct
14 Runtime error 12 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -