# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1035509 | Jethro | Holding (COCI20_holding) | C++14 | 2 ms | 344 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.
//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];
}
vector<vector<vector<int>>> dp(n + 1, vector<vector<int>>((r - l + 1) + 1, vector<int>(k + 1, 1e9)));
int res = 1e9;
dp[0][l - 1][0] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= k; ++j) {
dp[i][l - 1][j] = 0;
}
}
for (int i = 1; i <= n; ++i) {
for (int j = l; j <= r; ++j) {
for (int p = 0; p <= k; ++p) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |