oj.uz

Submission #224946

# Submission time Handle Problem Language Result Execution time Memory
224946 2020-04-19T06:46:25 Z VEGAnn Sličice (COCI19_slicice) C++14
90 / 90
 59 ms 1408 KB 
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
using namespace std;
const int N = 510;
int n, m, k, b[N], p[N], f[N][N];

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

    cin >> n >> m >> k;

    for (int i = 0; i < n; i++)
        cin >> p[i];

    for (int i = 0; i <= m; i++)
        cin >> b[i];

    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= k; j++)
            f[i][j] = -1;

    f[0][0] = 0;

    for (int i = 0; i < n; i++)
    for (int j = 0; j <= k; j++){
        if (f[i][j] < 0) continue;

        for (int z = 0; z + j <= k && z + p[i] <= m; z++)
            f[i + 1][j + z] = max(f[i + 1][j + z], f[i][j] + b[p[i] + z]);
    }

    cout << f[n][k];

    return 0;
}

Subtask #1
90.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1280 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 59 ms 1280 KB Output is correct
4 Correct 56 ms 1384 KB Output is correct
5 Correct 56 ms 1400 KB Output is correct
6 Correct 57 ms 1408 KB Output is correct
7 Correct 54 ms 1280 KB Output is correct
8 Correct 58 ms 1280 KB Output is correct
9 Correct 54 ms 1328 KB Output is correct
10 Correct 58 ms 1280 KB Output is correct