답안 #832888

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
832888	2023-08-21T16:17:53 Z	fanwen	K개의 묶음 (IZhO14_blocks)	C++17	100 / 100	135 ms	3540 KB

blocks

#include <bits/stdc++.h>

using namespace std;

#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }

template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

const int MAXN = 1e5 + 5;

int n, k, a[MAXN];

void you_make_it(void) {
    cin >> n >> k;
    FOR(i, 1, n) cin >> a[i];
    vector <long long> dp(n + 1, 1e18);
    FOR(i, 1, n) dp[i] = max((i == 1 ? a[i] : dp[i - 1]), 1LL * a[i]);
    FORE(j, 1, k) {
    	vector <long long> new_dp(dp);
    	stack <pair <int, long long>> st;
    	FOR(i, 1, n) {
    		long long _min = dp[i - 1];
    		// new_dp[i] = dp[i - 1] + a[i];
    		while(!st.empty() and a[st.top().first] <= a[i]) {
    			_min = min(_min, st.top().second);
    			st.pop();
    		}
    		if(!st.empty()) new_dp[i] = min(new_dp[st.top().first], _min + a[i]);
    		else new_dp[i] = _min + a[i];
    		st.push(make_pair(i, _min));
    	}
    	dp = new_dp;
    }
    cout << dp[n];
}

signed main() {

#ifdef LOCAL
    freopen("TASK.inp", "r", stdin);
    freopen("TASK.out", "w", stdout);
#endif
    auto start_time = chrono::steady_clock::now();

    cin.tie(0), cout.tie(0) -> sync_with_stdio(0);

    you_make_it();

    auto end_time = chrono::steady_clock::now();

    cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;

    return (0 ^ 0);
}

// Dream it. Wish it. Do it.

Subtask #1
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	0 ms	332 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	256 KB	Output is correct
7	Correct	0 ms	328 KB	Output is correct
8	Correct	0 ms	268 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 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	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #4
47.0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	0 ms	332 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	256 KB	Output is correct
7	Correct	0 ms	328 KB	Output is correct
8	Correct	0 ms	268 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 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	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 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	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	324 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	0 ms	324 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	324 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Correct	1 ms	212 KB	Output is correct
40	Correct	0 ms	212 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct
42	Correct	0 ms	328 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	1 ms	212 KB	Output is correct
46	Correct	1 ms	212 KB	Output is correct
47	Correct	0 ms	324 KB	Output is correct
48	Correct	1 ms	328 KB	Output is correct
49	Correct	0 ms	212 KB	Output is correct
50	Correct	0 ms	212 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	0 ms	212 KB	Output is correct
53	Correct	0 ms	340 KB	Output is correct
54	Correct	1 ms	212 KB	Output is correct
55	Correct	1 ms	212 KB	Output is correct
56	Correct	1 ms	328 KB	Output is correct
57	Correct	0 ms	324 KB	Output is correct
58	Correct	3 ms	596 KB	Output is correct
59	Correct	4 ms	1108 KB	Output is correct
60	Correct	6 ms	1492 KB	Output is correct
61	Correct	32 ms	1492 KB	Output is correct
62	Correct	93 ms	2900 KB	Output is correct
63	Correct	9 ms	2900 KB	Output is correct
64	Correct	45 ms	2900 KB	Output is correct
65	Correct	1 ms	212 KB	Output is correct
66	Correct	0 ms	212 KB	Output is correct
67	Correct	0 ms	212 KB	Output is correct
68	Correct	0 ms	212 KB	Output is correct
69	Correct	1 ms	340 KB	Output is correct
70	Correct	1 ms	340 KB	Output is correct
71	Correct	12 ms	596 KB	Output is correct
72	Correct	1 ms	596 KB	Output is correct
73	Correct	4 ms	468 KB	Output is correct
74	Correct	3 ms	1108 KB	Output is correct
75	Correct	7 ms	1496 KB	Output is correct
76	Correct	42 ms	1444 KB	Output is correct
77	Correct	123 ms	2876 KB	Output is correct
78	Correct	10 ms	2900 KB	Output is correct
79	Correct	65 ms	2968 KB	Output is correct
80	Correct	7 ms	2132 KB	Output is correct
81	Correct	19 ms	2900 KB	Output is correct
82	Correct	135 ms	2960 KB	Output is correct
83	Correct	1 ms	340 KB	Output is correct
84	Correct	1 ms	340 KB	Output is correct
85	Correct	11 ms	596 KB	Output is correct
86	Correct	1 ms	596 KB	Output is correct
87	Correct	4 ms	656 KB	Output is correct
88	Correct	3 ms	1108 KB	Output is correct
89	Correct	7 ms	1748 KB	Output is correct
90	Correct	37 ms	1752 KB	Output is correct
91	Correct	108 ms	3540 KB	Output is correct
92	Correct	10 ms	3512 KB	Output is correct
93	Correct	53 ms	3540 KB	Output is correct
94	Correct	1 ms	596 KB	Output is correct
95	Correct	8 ms	596 KB	Output is correct
96	Correct	1 ms	340 KB	Output is correct
97	Correct	1 ms	340 KB	Output is correct
98	Correct	0 ms	212 KB	Output is correct
99	Correct	0 ms	212 KB	Output is correct

답안 #832888

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 18.0 / 18.0

Subtask #3 21.0 / 21.0

Subtask #4 47.0 / 47.0

Subtask #1
14.0 / 14.0

Subtask #2
18.0 / 18.0

Subtask #3
21.0 / 21.0

Subtask #4
47.0 / 47.0