oj.uz

Submission #5735

# Submission time Handle Problem Language Result Execution time Memory
5735 2014-05-15T02:30:41 Z kriii K blocks (IZhO14_blocks) C++
100 / 100
 176 ms 2668 KB 
#include <stdio.h>
#include <stack>
using namespace std;

int N,K,A[100001],prv[100001],nxt[100001];

int main()
{
	scanf ("%d %d",&N,&K);

	for (int i=1;i<=N;i++){
		scanf ("%d",&A[i]);
		prv[i] = 0x3fffffff;
	}

	for (int j=1;j<=K;j++){
		stack<pair<int, int> > S;
		for (int i=j;i<=N;i++){
			int last = prv[i-1];
			while (!S.empty() && S.top().second <= A[i]){
				if (last > S.top().first) last = S.top().first;
				S.pop();
			}
			if (S.empty() || S.top().first + S.top().second > last + A[i])
				S.push(make_pair(last,A[i]));
			nxt[i] = S.top().first + S.top().second;
		}
		for (int i=j;i<=N;i++) prv[i] = nxt[i];
	}

	printf ("%d\n",prv[N]);

	return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2408 KB Output is correct
2 Correct 8 ms 2408 KB Output is correct
3 Correct 8 ms 2408 KB Output is correct
4 Correct 44 ms 2408 KB Output is correct
5 Correct 140 ms 2408 KB Output is correct
6 Correct 20 ms 2408 KB Output is correct
7 Correct 72 ms 2408 KB Output is correct
8 Correct 0 ms 2408 KB Output is correct
9 Correct 0 ms 2408 KB Output is correct
10 Correct 0 ms 2408 KB Output is correct
11 Correct 0 ms 2408 KB Output is correct
12 Correct 0 ms 2408 KB Output is correct
13 Correct 0 ms 2408 KB Output is correct
14 Correct 12 ms 2408 KB Output is correct
15 Correct 0 ms 2408 KB Output is correct
16 Correct 4 ms 2408 KB Output is correct
17 Correct 8 ms 2408 KB Output is correct
18 Correct 4 ms 2408 KB Output is correct
19 Correct 44 ms 2408 KB Output is correct
20 Correct 124 ms 2408 KB Output is correct
21 Correct 20 ms 2408 KB Output is correct
22 Correct 64 ms 2408 KB Output is correct
23 Correct 12 ms 2408 KB Output is correct
24 Correct 24 ms 2408 KB Output is correct
25 Correct 132 ms 2408 KB Output is correct
26 Correct 0 ms 2408 KB Output is correct
27 Correct 0 ms 2408 KB Output is correct
28 Correct 12 ms 2408 KB Output is correct
29 Correct 0 ms 2408 KB Output is correct
30 Correct 0 ms 2408 KB Output is correct
31 Correct 8 ms 2408 KB Output is correct
32 Correct 12 ms 2536 KB Output is correct
33 Correct 60 ms 2536 KB Output is correct
34 Correct 176 ms 2668 KB Output is correct
35 Correct 20 ms 2664 KB Output is correct
36 Correct 80 ms 2668 KB Output is correct
37 Correct 0 ms 2408 KB Output is correct
38 Correct 12 ms 2408 KB Output is correct
39 Correct 0 ms 2408 KB Output is correct
40 Correct 0 ms 2408 KB Output is correct
41 Correct 0 ms 2408 KB Output is correct
42 Correct 0 ms 2408 KB Output is correct