답안 #889645

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
889645	2023-12-20T04:22:10 Z	dwuy	K개의 묶음 (IZhO14_blocks)	C++14	100 / 100	181 ms	3028 KB

blocks

/// dwuy: _,\,,,_\,__,\,,_
#include <bits/stdc++.h>

#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
#define file(a) freopen(a".inp","r",stdin); freopen(a".out", "w",stdout)
#define fi first
#define se second
#define endl "\n"
#define len(s) int32_t(s.length())
#define MASK(k)(1LL<<(k))
#define TASK ""

using namespace std;

typedef tuple<int, int, int> tpiii;
typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef long long ll;

const long long OO = 1e18;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int MX = 100005;

int n, k;
int a[MX];
int cur[MX];
int pre[MX];

void nhap(){
    cin >> n >> k;
    for(int i=1; i<=n; i++) cin >> a[i];
}

void solve(){
    for(int i=1, mx=0; i<=n; i++){
        mx = max(mx, a[i]);
        pre[i] = mx;
    }
    for(int j=2; j<=k; j++){
        stack<int> st, mn, mnf;
        a[j-1] = INF;
        st.push(j-1);
        mn.push(INF);
        mnf.push(INF);
        for(int i=j; i<=n; i++){
            int val = pre[i-1];
            while(a[st.top()] <= a[i]){
                st.pop();
                mn.pop();
                val = min(val, mnf.top());
                mnf.pop();
            }
            mn.push(min(mn.top(), val+a[i]));
            mnf.push(val);
            st.push(i);
            cur[i] = mn.top();
        }
        for(int i=j; i<=n; i++) pre[i] = cur[i];
    }
    cout << pre[n];
}

int32_t main(){
    fastIO;
    //file(TASK);

    nhap();
    solve();

    return 0;
}

/**

5 3
5 7 10 3 5

**/

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	344 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct
19	Correct	344 KB	Output is correct
20	Correct	348 KB	Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	596 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	344 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	344 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	360 KB	Output is correct
44	Correct	0 ms	344 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	344 KB	Output is correct
52	Correct	0 ms	344 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	1 ms	344 KB	Output is correct
55	Correct	0 ms	344 KB	Output is correct
56	Correct	0 ms	344 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	3 ms	348 KB	Output is correct
59	Correct	3 ms	572 KB	Output is correct
60	Correct	6 ms	860 KB	Output is correct
61	Correct	42 ms	860 KB	Output is correct
62	Correct	120 ms	1628 KB	Output is correct
63	Correct	9 ms	2140 KB	Output is correct
64	Correct	58 ms	2124 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	0 ms	468 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	1 ms	452 KB	Output is correct
69	Correct	1 ms	348 KB	Output is correct
70	Correct	1 ms	348 KB	Output is correct
71	Correct	18 ms	604 KB	Output is correct
72	Correct	1 ms	856 KB	Output is correct
73	Correct	5 ms	476 KB	Output is correct
74	Correct	3 ms	1116 KB	Output is correct
75	Correct	8 ms	1368 KB	Output is correct
76	Correct	62 ms	1116 KB	Output is correct
77	Correct	178 ms	2280 KB	Output is correct
78	Correct	10 ms	2140 KB	Output is correct
79	Correct	83 ms	2136 KB	Output is correct
80	Correct	7 ms	1684 KB	Output is correct
81	Correct	22 ms	2140 KB	Output is correct
82	Correct	181 ms	2296 KB	Output is correct
83	Correct	1 ms	348 KB	Output is correct
84	Correct	0 ms	464 KB	Output is correct
85	Correct	12 ms	604 KB	Output is correct
86	Correct	1 ms	468 KB	Output is correct
87	Correct	5 ms	604 KB	Output is correct
88	Correct	3 ms	1116 KB	Output is correct
89	Correct	7 ms	1488 KB	Output is correct
90	Correct	44 ms	1492 KB	Output is correct
91	Correct	136 ms	3028 KB	Output is correct
92	Correct	10 ms	2652 KB	Output is correct
93	Correct	75 ms	2728 KB	Output is correct
94	Correct	1 ms	600 KB	Output is correct
95	Correct	11 ms	604 KB	Output is correct
96	Correct	0 ms	348 KB	Output is correct
97	Correct	0 ms	348 KB	Output is correct
98	Correct	0 ms	348 KB	Output is correct
99	Correct	0 ms	348 KB	Output is correct

답안 #889645

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