oj.uz

Submission #1046685

# Submission time Handle Problem Language Result Execution time Memory
1046685 2024-08-06T20:20:33 Z _rain_ Holding (COCI20_holding) C++14
55 / 110
 24 ms 75936 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];

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]);
				}
			}
		}
	cout << total + f1[R][k];
}

Compilation message

holding.cpp: In function 'int main()':
holding.cpp:23:7: warning: unused variable 'mx' [-Wunused-variable]
   23 |   i64 mx = 0;
      |       ^~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 4444 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 2 ms 8792 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 1 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 4444 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 2 ms 8792 KB Output is correct
8 Correct 6 ms 43096 KB Output is correct
9 Correct 4 ms 47452 KB Output is correct
10 Correct 4 ms 51292 KB Output is correct
11 Correct 5 ms 47096 KB Output is correct
12 Correct 3 ms 29788 KB Output is correct
13 Correct 24 ms 75936 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 4444 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 2 ms 8792 KB Output is correct
8 Correct 6 ms 43096 KB Output is correct
9 Correct 4 ms 47452 KB Output is correct
10 Correct 4 ms 51292 KB Output is correct
11 Correct 5 ms 47096 KB Output is correct
12 Correct 3 ms 29788 KB Output is correct
13 Correct 24 ms 75936 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 2 ms 13660 KB Output is correct
16 Incorrect 1 ms 9052 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 4444 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 2 ms 8792 KB Output is correct
8 Correct 6 ms 43096 KB Output is correct
9 Correct 4 ms 47452 KB Output is correct
10 Correct 4 ms 51292 KB Output is correct
11 Correct 5 ms 47096 KB Output is correct
12 Correct 3 ms 29788 KB Output is correct
13 Correct 24 ms 75936 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 2 ms 13660 KB Output is correct
16 Incorrect 1 ms 9052 KB Output isn't correct
17 Halted 0 ms 0 KB -