| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1046687 |
2024-08-06T20:25:51 Z |
_rain_ |
Holding (COCI20_holding) |
C++14 |
|
28 ms |
76932 KB |
#include<bits/stdc++.h>
using i64 = long long;
using namespace std;
const int maxn = 100;
const int maxk = 10000;
int n,L,R,k;
i64 a[maxn+2] , f1[maxn+2][maxk+2] , dp1[maxn+2][maxn+2][maxk+2] , dp2[maxn+2][maxn+2][maxk+2] , f2[maxn+2][maxk+2];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
#define name "main"
// freopen(name".inp","r",stdin);
// freopen(name".out","w+",stdout);
cin >> n >> L >> R >> k;
for (int i = 1; i <= n; ++i) cin >> a[i];
i64 total = 0;
for (int i = L; i <= R; ++i) total += a[i];
//... BUILD FOR THE LEFT
i64 mx = 0;
for (int i = 1; i < L; ++i)
{
for (int j = L; j <= R; ++j)
{
for (int used = 0; used <= k; ++used)
{
dp1[i][j][used] = min({dp1[i - 1][j][used] , dp1[i][j - 1][used]});
if (used - abs(i - j) >= 0)
{
dp1[i][j][used] = min(dp1[i][j][used] , dp1[i - 1][j - 1][used - abs(i - j)] + a[i] - a[j]);
}
f1[j][used] = min({f1[j - 1][used] , dp1[i][j][used] , f1[j][used]});
f1[j][used] = min(f1[j][used] , f1[j][used - 1]);
}
}
}
//... BUILD FOR THE RIGHT
for (int i = n; i > R; --i)
{
for (int j = R; j >= L; --j)
{
for (int used = 0; used <= k; ++used)
{
dp2[i][j][used] = min(dp2[i+1][j][used] , dp2[i][j+1][used]);
if (used - abs(i - j) >= 0)
{
dp2[i][j][used] = min(dp2[i][j][used] , dp2[i+1][j+1][used - abs(i - j)] + a[j] - a[i]);
}
f2[j][used] = min({f2[j + 1][used] , dp2[i][j][used] , f2[j][used] , f2[j][used - 1]});
}
}
}
i64 answer = total;
for (int i = L ; i <= R; ++i) for (int used = 0; used <= k; ++used)
{
if (i + 1 <= R)
answer = min(answer , total + f1[i][used] + f2[i + 1][k - used]);
answer = min(answer , total + f2[i][used]);
answer = min(answer , total + f1[i][used]);
}
cout << answer;
}
Compilation message
holding.cpp: In function 'int main()':
holding.cpp:23:7: warning: unused variable 'mx' [-Wunused-variable]
23 | i64 mx = 0;
| ^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
4700 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4696 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
2 ms |
7260 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
4700 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4696 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
2 ms |
7260 KB |
Output is correct |
| 8 |
Correct |
5 ms |
43100 KB |
Output is correct |
| 9 |
Correct |
5 ms |
47452 KB |
Output is correct |
| 10 |
Correct |
5 ms |
51288 KB |
Output is correct |
| 11 |
Correct |
5 ms |
49244 KB |
Output is correct |
| 12 |
Correct |
4 ms |
31836 KB |
Output is correct |
| 13 |
Correct |
28 ms |
76932 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
4700 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4696 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
2 ms |
7260 KB |
Output is correct |
| 8 |
Correct |
5 ms |
43100 KB |
Output is correct |
| 9 |
Correct |
5 ms |
47452 KB |
Output is correct |
| 10 |
Correct |
5 ms |
51288 KB |
Output is correct |
| 11 |
Correct |
5 ms |
49244 KB |
Output is correct |
| 12 |
Correct |
4 ms |
31836 KB |
Output is correct |
| 13 |
Correct |
28 ms |
76932 KB |
Output is correct |
| 14 |
Incorrect |
1 ms |
4956 KB |
Output isn't correct |
| 15 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
4700 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4696 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
2 ms |
7260 KB |
Output is correct |
| 8 |
Correct |
5 ms |
43100 KB |
Output is correct |
| 9 |
Correct |
5 ms |
47452 KB |
Output is correct |
| 10 |
Correct |
5 ms |
51288 KB |
Output is correct |
| 11 |
Correct |
5 ms |
49244 KB |
Output is correct |
| 12 |
Correct |
4 ms |
31836 KB |
Output is correct |
| 13 |
Correct |
28 ms |
76932 KB |
Output is correct |
| 14 |
Incorrect |
1 ms |
4956 KB |
Output isn't correct |
| 15 |
Halted |
0 ms |
0 KB |
- |
