oj.uz

답안 #100237

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100237 2019-03-10T02:06:44 Z FutymyClone Sličice (COCI19_slicice) C++14
90 / 90
 64 ms 1416 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 505;

int dp[N][N], n, m, p, a[N], b[N];

int main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n >> m >> p;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 0; i <= m; i++) cin >> b[i];

    memset(dp, -0x3f, sizeof(dp)); dp[0][0] = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= p; j++) {
            if (dp[i][j] > -1e9) {
                int lim = min(p - j, m - a[i + 1]);
                for (int k = 0; k <= lim; k++) dp[i + 1][j + k] = max(dp[i + 1][j + k], dp[i][j] + b[a[i + 1] + k]);
            }
        }
    }

    int ans = 0;
    for (int i = 0; i <= p; i++) ans = max(ans, dp[n][i]);
    cout << ans;
    return 0;
}

Subtask #1
90.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1280 KB Output is correct
2 Correct 4 ms 1408 KB Output is correct
3 Correct 64 ms 1416 KB Output is correct
4 Correct 62 ms 1408 KB Output is correct
5 Correct 44 ms 1408 KB Output is correct
6 Correct 42 ms 1408 KB Output is correct
7 Correct 43 ms 1408 KB Output is correct
8 Correct 45 ms 1280 KB Output is correct
9 Correct 51 ms 1280 KB Output is correct
10 Correct 50 ms 1280 KB Output is correct