oj.uz

Submission #100316

# Submission time Handle Problem Language Result Execution time Memory
100316 2019-03-10T11:19:44 Z tpoppo Sličice (COCI19_slicice) C++14
90 / 90
 89 ms 1400 KB 
#include <bits/stdc++.h>

using namespace std;


const int MAXN = 505;

int n,m,k;

int b[MAXN];
int v[MAXN];




int dp[MAXN][MAXN];


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

    //freopen("in.txt","r",stdin);



    cin >> n >> m >> k;
    for(int i=0;i<n;i++) cin >> v[i];

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

    for(int i=0;i<n;i++){
        for(int t=0;t<=k;t++){
            //cout<<dp[i][t]<<" ";
            for(int j=0;j + v[i] <= m && j <= t;j++){

                dp[i+1][t-j] = max(dp[i+1][t - j], dp[i][t] + b[v[i] + j] );
            }

        }//cout<<endl;
    }

    int rs = 0;
    for(int i=0;i<=m;i++) rs = max(rs,dp[n][i]);
    // cout<<i<<": "<<dp[n][i]<<'\n';


    cout<<rs<<'\n';



    return 0;
}

Subtask #1
90.0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1280 KB Output is correct
2 Correct 3 ms 1280 KB Output is correct
3 Correct 67 ms 1400 KB Output is correct
4 Correct 76 ms 1400 KB Output is correct
5 Correct 67 ms 1400 KB Output is correct
6 Correct 89 ms 1144 KB Output is correct
7 Correct 77 ms 1400 KB Output is correct
8 Correct 85 ms 1340 KB Output is correct
9 Correct 65 ms 1272 KB Output is correct
10 Correct 71 ms 1400 KB Output is correct