oj.uz

답안 #1035519

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1035519 2024-07-26T11:42:27 Z Jethro Holding (COCI20_holding) C++14
110 / 110
 172 ms 208112 KB 
//Written by: Jethro_
//----------------------
#include <bits/stdc++.h>
using namespace std;

int n, l, r, k;

void solve() {
    cin >> n >> l >> r >> k;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }

    int m = (r - l + 1);

	vector<vector<vector<int>>> dp(n + 1, vector<vector<int>>(m + 1, vector<int>(k + 1, 1e9)));

    int res = 1e9;

    for (int i = 0; i <= n; ++i) {
        for (int j = 0; j <= k; ++j) {
            dp[i][0][j] = 0;
        }
    }
    for (int i = 1; i <= n; ++i) {  

        for (int j = 1; j <= m; ++j) {

            for (int p = 0; p <= k; ++p) {
                dp[i][j][p] = dp[i - 1][j][p];
                if (p - abs(i - (l + j - 1)) >= 0) {
                    dp[i][j][p] = min({dp[i][j][p], dp[i - 1][j - 1][p - abs(i - (l + j - 1))] + a[i]});
                }
                
                if (j == m) res = min(res, dp[i][m][p]);

            }
            

        }
    }


    cout << res;
}
int main() {

    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    solve();

}


//dp[i][j][k] = max(dp[i - 1][j][k], dp[i][j - 1][k], dp[i - 1][j - 1][k + abs(j - i)] - a[i] + a[j]);

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1708 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 51 ms 55420 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1708 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 51 ms 55420 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 47 ms 55476 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1708 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 51 ms 55420 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 47 ms 55476 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 1 ms 1628 KB Output is correct
22 Correct 0 ms 600 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 7 ms 8828 KB Output is correct
25 Correct 172 ms 208112 KB Output is correct