답안 #646293

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
646293	2022-09-29T11:59:09 Z	ymm	K개의 묶음 (IZhO14_blocks)	C++17	53 / 100	1000 ms	9836 KB

blocks

#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 100'032;
const int K = 110;
const ll inf = 1e15;
ll dp[K][N];
ll a[N];
int n;

__attribute__((optimize("O3,unroll-loops"),target("avx2")))
ll get_min(int k, int l, int r)
{
	ll ans = inf;
	Loop (i,l,r)
		ans = min(ans, dp[k][i]);
	return ans;
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	int k;
	cin >> n >> k;
	Loop (i,0,n)
		cin >> a[i];
	dp[1][0] = a[0];
	Loop (i,2,k+1)
		dp[i][0] = inf;
	vector<int> vec;
	vec.push_back(0);
	Loop (i,1,n) {
		while (vec.size() && a[vec.back()] < a[i])
			vec.pop_back();
		dp[1][i] = max(a[i], dp[1][i-1]);
		Loop (j,2,k+1) {
			dp[j][i] = get_min(j-1, vec.size()?
			                        vec.back():
			                        0, i) + a[i];
			if (vec.size())
				dp[j][i] = min(dp[j][i], dp[j][vec.back()]);
		}
		vec.push_back(i);
	}	
	cout << dp[k][n-1] << '\n';
}

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	328 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	328 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	328 KB	Output is correct
31	Correct	0 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	328 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	0 ms	340 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	1 ms	596 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	1 ms	340 KB	Output is correct
42	Correct	0 ms	328 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	0 ms	332 KB	Output is correct
45	Correct	0 ms	324 KB	Output is correct
46	Correct	0 ms	340 KB	Output is correct
47	Correct	0 ms	336 KB	Output is correct
48	Correct	1 ms	328 KB	Output is correct
49	Correct	1 ms	340 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Correct	1 ms	460 KB	Output is correct
52	Correct	1 ms	468 KB	Output is correct
53	Correct	1 ms	980 KB	Output is correct
54	Correct	1 ms	980 KB	Output is correct
55	Correct	1 ms	596 KB	Output is correct
56	Correct	1 ms	980 KB	Output is correct
57	Correct	1 ms	980 KB	Output is correct
58	Correct	142 ms	2480 KB	Output is correct
59	Correct	5 ms	1236 KB	Output is correct
60	Correct	716 ms	3344 KB	Output is correct
61	Execution timed out	1082 ms	9836 KB	Time limit exceeded
62	Halted	0 ms	0 KB	-

답안 #646293

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