oj.uz

Submission #1092172

# Submission time Handle Problem Language Result Execution time Memory
1092172 2024-09-23T12:48:19 Z vu28082007 Holding (COCI20_holding) C++14
110 / 110
 174 ms 208212 KB 
#include <bits/stdc++.h>
using namespace std;
int n, l, r, k, a[107];
int main() 
{
    cin >> n >> l >> r >> k;
    for (int i = 1; i <= n; i++)
    {
      cin >> a[i];
    }
    int m = (r-l+1);
    int res=1e9;
    vector<vector<vector<int>>> dp(n+1, vector<vector<int>>(m+1, vector<int>(k+1, 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-(j+l-1)) >= 0)
          {
            dp[i][j][p]=min(dp[i][j][p], dp[i-1][j-1][p-abs(i-(j+l-1))] + a[i]);
          }
          if(j==m)
          {
            res=min(res, dp[i][m][p]);
          }
        }
      }
    }
    cout << res;
    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 4700 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 4700 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 43 ms 55356 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 4700 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 43 ms 55356 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 48 ms 55376 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 4700 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 43 ms 55356 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 48 ms 55376 KB Output is correct
20 Correct 4 ms 2392 KB Output is correct
21 Correct 1 ms 1628 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 4 ms 4700 KB Output is correct
24 Correct 8 ms 8796 KB Output is correct
25 Correct 174 ms 208212 KB Output is correct