| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 100316 | tpoppo | Sličice (COCI19_slicice) | C++14 | 89 ms | 1400 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
