oj.uz

답안 #319058

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
319058 2020-11-03T20:18:59 Z CodeTiger927 K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 357 ms 160732 KB 
using namespace std;

#include <iostream>
#include <fstream>
#include <stack>
#include <cstring>


#define MAXN 100005
#define MAXM 1000005

long long st[262144];

void update(int x,long long v,int l,int r,int p) {
	if(l > x || r < x) return;
	if(l == r) {
		st[p] = v;
		return;
	}
	int m = (l + r) / 2;
	update(x,v,l,m,2 * p + 1);
	update(x,v,m + 1,r,2 * p + 2);
	st[p] = max(st[2 * p + 1],st[2 * p + 2]);
	return;
}

void update(int x,long long v) {
	update(x,v,0,MAXN,0);
}

long long getMax(int a,int b,int l,int r,int p) {
	if(l > b || r < a) return -99999999999;
	if(l >= a && r <= b) return st[p];
	int m = (l + r) / 2;
	return max(getMax(a,b,l,m,2 * p + 1),getMax(a,b,m + 1,r,2 * p + 2));
}

long long getMax(int a,int b) {
	return getMax(a,b,0,MAXN,0);
}


int N,K;
long long arr[MAXN],dp[105][MAXN],maxN[105][MAXN],sum;

int main() {
	cin >> N >> K;
	for(int i = 0;i < N;++i) {
		cin >> arr[i];
		update(i,arr[i]);
		sum += arr[i];
		dp[0][i] = arr[i];
		if(i != 0) dp[0][i] = max(dp[0][i],dp[0][i - 1]);
		maxN[0][i] = dp[0][i];
	}

	for(int i = 1;i < K;++i) {
		stack<int> s;
		for(int j = i;j < N;++j) {
			dp[i][j] = dp[i - 1][j - 1] + arr[j];
			maxN[i][j] = arr[j];
			while(!s.empty() && arr[s.top()] <= arr[j]) {
				dp[i][j] = min(dp[i][j],dp[i][s.top()] - maxN[i][s.top()] + max(maxN[i][s.top()],arr[j]));
				s.pop();
			}
			if(!s.empty()) {
				dp[i][j] = min(dp[i][j],dp[i][s.top()]);
				maxN[i][j] = min(maxN[i][j],maxN[i][s.top()]);
			}
			s.push(j);
		}
	}

	cout << dp[K - 1][N - 1] << endl;

	return 0;

}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 620 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 492 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 1 ms 620 KB Output is correct
39 Correct 1 ms 1004 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 492 KB Output is correct
51 Correct 1 ms 748 KB Output is correct
52 Correct 1 ms 748 KB Output is correct
53 Correct 1 ms 1516 KB Output is correct
54 Correct 1 ms 1516 KB Output is correct
55 Correct 1 ms 1004 KB Output is correct
56 Correct 1 ms 1516 KB Output is correct
57 Correct 1 ms 1516 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 492 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 1 ms 620 KB Output is correct
39 Correct 1 ms 1004 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 492 KB Output is correct
51 Correct 1 ms 748 KB Output is correct
52 Correct 1 ms 748 KB Output is correct
53 Correct 1 ms 1516 KB Output is correct
54 Correct 1 ms 1516 KB Output is correct
55 Correct 1 ms 1004 KB Output is correct
56 Correct 1 ms 1516 KB Output is correct
57 Correct 1 ms 1516 KB Output is correct
58 Correct 12 ms 4972 KB Output is correct
59 Correct 25 ms 2668 KB Output is correct
60 Correct 31 ms 6884 KB Output is correct
61 Correct 110 ms 55524 KB Output is correct
62 Correct 291 ms 160484 KB Output is correct
63 Correct 64 ms 8548 KB Output is correct
64 Correct 157 ms 74468 KB Output is correct
65 Correct 1 ms 748 KB Output is correct
66 Correct 1 ms 1004 KB Output is correct
67 Correct 1 ms 1004 KB Output is correct
68 Correct 1 ms 1004 KB Output is correct
69 Correct 1 ms 492 KB Output is correct
70 Correct 1 ms 620 KB Output is correct
71 Correct 35 ms 17380 KB Output is correct
72 Correct 8 ms 1132 KB Output is correct
73 Correct 13 ms 4972 KB Output is correct
74 Correct 25 ms 2668 KB Output is correct
75 Correct 32 ms 6884 KB Output is correct
76 Correct 142 ms 55524 KB Output is correct
77 Correct 357 ms 160368 KB Output is correct
78 Correct 60 ms 8548 KB Output is correct
79 Correct 185 ms 74340 KB Output is correct
80 Correct 56 ms 5476 KB Output is correct
81 Correct 83 ms 19556 KB Output is correct
82 Correct 354 ms 160628 KB Output is correct
83 Correct 1 ms 492 KB Output is correct
84 Correct 1 ms 620 KB Output is correct
85 Correct 31 ms 17384 KB Output is correct
86 Correct 6 ms 1132 KB Output is correct
87 Correct 12 ms 4972 KB Output is correct
88 Correct 25 ms 2660 KB Output is correct
89 Correct 32 ms 6884 KB Output is correct
90 Correct 112 ms 55524 KB Output is correct
91 Correct 310 ms 160732 KB Output is correct
92 Correct 62 ms 8672 KB Output is correct
93 Correct 170 ms 74424 KB Output is correct
94 Correct 6 ms 1004 KB Output is correct
95 Correct 29 ms 17380 KB Output is correct
96 Correct 1 ms 620 KB Output is correct
97 Correct 1 ms 492 KB Output is correct
98 Correct 1 ms 492 KB Output is correct
99 Correct 1 ms 364 KB Output is correct