Submission #687012

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
687012	2023-01-26T04:57:57 Z	GudStonks	K blocks (IZhO14_blocks)	C++17	32 / 100	1000 ms	336 KB

blocks

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ft first
#define sd second
const ll MOD = 1e9+7;
ll n, k, arr[100005];
ll rec(ll b = 1, ll i = 1, ll res = 0, ll mx = 0){
	if(i == n && b == k)
		return res + max(mx, arr[i]);
	else if(i == n || b > k)
		return 2e18;
	return min(rec(b + 1, i + 1, res + max(mx, arr[i]), 0), rec(b, i + 1, res, max(mx, arr[i])));
}
void fun(){
	cin>>n>>k;
	for(int i = 1; i <= n; i++)cin>>arr[i];
	cout<<rec();
}

int  main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int ttt = 1;
	//cin>>ttt;
	while(ttt--)fun();
}

Subtask #1
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	455 ms	312 KB	Output is correct
14	Correct	422 ms	308 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	451 ms	312 KB	Output is correct

Subtask #2
18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	328 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	4 ms	212 KB	Output is correct
15	Correct	4 ms	292 KB	Output is correct
16	Correct	6 ms	336 KB	Output is correct
17	Correct	4 ms	212 KB	Output is correct
18	Correct	3 ms	212 KB	Output is correct
19	Correct	3 ms	212 KB	Output is correct
20	Correct	3 ms	336 KB	Output is correct

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	455 ms	312 KB	Output is correct
14	Correct	422 ms	308 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	451 ms	312 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	328 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	4 ms	212 KB	Output is correct
33	Correct	4 ms	292 KB	Output is correct
34	Correct	6 ms	336 KB	Output is correct
35	Correct	4 ms	212 KB	Output is correct
36	Correct	3 ms	212 KB	Output is correct
37	Correct	3 ms	212 KB	Output is correct
38	Correct	3 ms	336 KB	Output is correct
39	Execution timed out	1090 ms	212 KB	Time limit exceeded
40	Halted	0 ms	0 KB	-

Subtask #4
0 / 47.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	455 ms	312 KB	Output is correct
14	Correct	422 ms	308 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	451 ms	312 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	328 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	4 ms	212 KB	Output is correct
33	Correct	4 ms	292 KB	Output is correct
34	Correct	6 ms	336 KB	Output is correct
35	Correct	4 ms	212 KB	Output is correct
36	Correct	3 ms	212 KB	Output is correct
37	Correct	3 ms	212 KB	Output is correct
38	Correct	3 ms	336 KB	Output is correct
39	Execution timed out	1090 ms	212 KB	Time limit exceeded
40	Halted	0 ms	0 KB	-

Submission #687012

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 18.0 / 18.0

Subtask #3 0 / 21.0

Subtask #4 0 / 47.0

Subtask #1
14.0 / 14.0

Subtask #2
18.0 / 18.0

Subtask #3
0 / 21.0

Subtask #4
0 / 47.0