답안 #854399

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
854399	2023-09-27T09:45:03 Z	karrigan	K개의 묶음 (IZhO14_blocks)	C++14	100 / 100	203 ms	88452 KB

blocks

#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
const int maxn=1e5+9;
int a[maxn],lep[maxn];
long long f[maxn][109];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("MAXK.INP","r",stdin);
    //freopen("MAXK.OUT","w",stdout);
    int n,k;
    cin>>n>>k;
    a[0]=1e9+1;
    for1(i,1,n)cin>>a[i];
    stack<int>run;
    run.push(0);
    for1(i,1,n){
    while (!run.empty()&&a[run.top()]<a[i])run.pop();
    lep[i]=run.top();
    run.push(i);
    }
    int mx=0;
    for1(i,1,n){
    mx=max(mx,a[i]);
    f[i][1]=mx;
    }
    for1(j,2,k){
    stack<int>id;
    stack<long long>best;
    stack<long long>hjhj;
    for1(i,j,n){
    long long nw=f[i-1][j-1];
    while (!id.empty()&&id.top()>lep[i]){
    best.pop();
    nw=min(nw,hjhj.top());
    hjhj.pop();
    id.pop();
    }
    id.push(i);
    hjhj.push(nw);
    if (best.empty())best.push(nw+a[i]);
    else best.push(min(best.top(),nw+a[i]));
    f[i][j]=best.top();
    }
    }
    cout<<f[n][k];

}

Subtask #1
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	348 KB	Output is correct
5	Correct	0 ms	464 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	348 KB	Output is correct
9	Correct	0 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	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct

Subtask #2
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 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	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	460 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	468 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	348 KB	Output is correct
5	Correct	0 ms	464 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	348 KB	Output is correct
9	Correct	0 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	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 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	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	460 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	468 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	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	600 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	468 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	1 ms	344 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	468 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	1 ms	344 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	1 ms	348 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct

Subtask #4
47.0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	348 KB	Output is correct
5	Correct	0 ms	464 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	348 KB	Output is correct
9	Correct	0 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	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 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	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	460 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	468 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	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	600 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	468 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	1 ms	344 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	468 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	1 ms	344 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	1 ms	348 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	5 ms	10844 KB	Output is correct
59	Correct	11 ms	40208 KB	Output is correct
60	Correct	11 ms	40280 KB	Output is correct
61	Correct	49 ms	40284 KB	Output is correct
62	Correct	151 ms	87236 KB	Output is correct
63	Correct	21 ms	87256 KB	Output is correct
64	Correct	73 ms	87132 KB	Output is correct
65	Correct	1 ms	344 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	0 ms	348 KB	Output is correct
69	Correct	1 ms	2652 KB	Output is correct
70	Correct	1 ms	2652 KB	Output is correct
71	Correct	20 ms	10844 KB	Output is correct
72	Correct	2 ms	10844 KB	Output is correct
73	Correct	7 ms	10840 KB	Output is correct
74	Correct	8 ms	40284 KB	Output is correct
75	Correct	12 ms	40280 KB	Output is correct
76	Correct	69 ms	40284 KB	Output is correct
77	Correct	194 ms	87124 KB	Output is correct
78	Correct	28 ms	87184 KB	Output is correct
79	Correct	96 ms	87228 KB	Output is correct
80	Correct	18 ms	87376 KB	Output is correct
81	Correct	32 ms	87120 KB	Output is correct
82	Correct	203 ms	87240 KB	Output is correct
83	Correct	1 ms	2652 KB	Output is correct
84	Correct	1 ms	2652 KB	Output is correct
85	Correct	15 ms	11100 KB	Output is correct
86	Correct	2 ms	11100 KB	Output is correct
87	Correct	6 ms	11100 KB	Output is correct
88	Correct	8 ms	40296 KB	Output is correct
89	Correct	13 ms	40740 KB	Output is correct
90	Correct	57 ms	41004 KB	Output is correct
91	Correct	180 ms	88452 KB	Output is correct
92	Correct	21 ms	88192 KB	Output is correct
93	Correct	86 ms	88316 KB	Output is correct
94	Correct	2 ms	10840 KB	Output is correct
95	Correct	13 ms	11052 KB	Output is correct
96	Correct	1 ms	2904 KB	Output is correct
97	Correct	1 ms	2652 KB	Output is correct
98	Correct	0 ms	468 KB	Output is correct
99	Correct	0 ms	348 KB	Output is correct

답안 #854399

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