답안 #523672

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
523672	2022-02-08T03:51:01 Z	boykut	K개의 묶음 (IZhO14_blocks)	C++14	53 / 100	1000 ms	3644 KB

blocks

#include <bits/stdc++.h>

using namespace std;

class sparse_table {
public:
	sparse_table(vector<int>&a) : n(a.size()) {
		lg.resize(1 + n);
		lg[0] = lg[1] = 0;
		for (int i = 2; i <= n; i++)
			lg[i] = lg[i / 2] + 1;

		mx.assign(n, vector<int>(1 + lg[n]));
		for (int j = 0; j <= lg[n]; j++)
			for (int i = 0; i <= n - (1 << j); i++)
				if (j == 0) mx[i][j] = a[i];
				else mx[i][j] = max(mx[i][j-1], mx[i+(1<<(j-1))][j-1]);
	}
	int query(int l, int r) {
		int d = lg[r-l+1];
		return max(mx[l][d], mx[r-(1<<d)+1][d]);
	}
private:
	int n;
	vector<int> lg;
	vector<vector<int>> mx;
};


int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n, k;
	cin >> n >> k;
	vector<int> a(1 + n);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sparse_table st(a);
	vector<vector<long long>> dp(1 + n, vector<long long>(1 + k, 1e18));

	for (int i = 1; i <= n; i++) {
		dp[i][1] = st.query(1, i);
	}

	for (int j = 2; j <= k; j++) {
		for (int i = 1; i <= n; i++) {
			long long mn = 1e18;
			for (int i2 = 1; i2 < i; i2++) {
				mn = min(mn, dp[i2][j-1] + st.query(i2+1, i));
			}
			dp[i][j] = mn;
		}
	}

	cout << dp[n][k] << '\n';

	return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	304 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	316 KB	Output is correct
12	Correct	1 ms	312 KB	Output is correct
13	Correct	0 ms	308 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	316 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	292 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	0 ms	304 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	316 KB	Output is correct
30	Correct	1 ms	312 KB	Output is correct
31	Correct	0 ms	308 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	1 ms	316 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	0 ms	204 KB	Output is correct
39	Correct	1 ms	332 KB	Output is correct
40	Correct	1 ms	312 KB	Output is correct
41	Correct	0 ms	320 KB	Output is correct
42	Correct	0 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	0 ms	204 KB	Output is correct
45	Correct	1 ms	204 KB	Output is correct
46	Correct	0 ms	312 KB	Output is correct
47	Correct	0 ms	204 KB	Output is correct
48	Correct	1 ms	204 KB	Output is correct
49	Correct	0 ms	312 KB	Output is correct
50	Correct	0 ms	204 KB	Output is correct
51	Correct	1 ms	308 KB	Output is correct
52	Correct	1 ms	332 KB	Output is correct
53	Correct	2 ms	332 KB	Output is correct
54	Correct	2 ms	332 KB	Output is correct
55	Correct	1 ms	332 KB	Output is correct
56	Correct	2 ms	332 KB	Output is correct
57	Correct	2 ms	332 KB	Output is correct
58	Execution timed out	1071 ms	3644 KB	Time limit exceeded
59	Halted	0 ms	0 KB	-

답안 #523672

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 18.0 / 18.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 47.0

Subtask #1
14.0 / 14.0

Subtask #2
18.0 / 18.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 47.0