답안 #470490

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
470490	2021-09-04T05:32:47 Z	lethinh05	K개의 묶음 (IZhO14_blocks)	C++11	100 / 100	196 ms	40084 KB

blocks

#include <bits/stdc++.h>

#define oo 1000000007
#define ll long long
#define ii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define mp make_pair
#define vi vector<int>
#define vii vector<ii>
#define sz(a) (int)(a.size())
#define pb push_back
#define fto(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define fdto(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define sci(x) scanf("%d", &x)
#define scii(x, y) scanf("%d %d", &x, &y)
#define bug(x) "["#x" = "<<(x)<<"] "
#define maxN 100005

using namespace std;

int n, k, a[maxN], f[105][maxN];

int main() {
    #ifndef EVAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    scii(n, k);
    fto(i, 1, n) sci(a[i]);

    fto(i, 1, n) f[1][i] = max(f[1][i-1], a[i]);
    fto(i, 2, k) {
        f[i][0] = oo;
        stack<ii> S;

        fto(j, i, n) {
            int mn = f[i-1][j-1];

            while (!S.empty() && a[S.top().ss] <= a[j]) {
                mn = min(mn, S.top().ff);
                S.pop();
            }

            f[i][j] = min(f[i][S.empty() ? 0 : S.top().ss], mn + a[j]);
            S.push(mp(mn, j));
        }
    }

    printf("%d\n", f[k][n]);
    return 0;
}

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:17:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | #define scii(x, y) scanf("%d %d", &x, &y)
      |                    ~~~~~^~~~~~~~~~~~~~~~~
blocks.cpp:31:5: note: in expansion of macro 'scii'
   31 |     scii(n, k);
      |     ^~~~
blocks.cpp:16:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 | #define sci(x) scanf("%d", &x)
      |                ~~~~~^~~~~~~~~~
blocks.cpp:32:18: note: in expansion of macro 'sci'
   32 |     fto(i, 1, n) sci(a[i]);
      |                  ^~~

Subtask #1
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 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	1 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	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	0 ms	332 KB	Output is correct
30	Correct	0 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	0 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	0 ms	332 KB	Output is correct
36	Correct	0 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	1 ms	460 KB	Output is correct
40	Correct	1 ms	204 KB	Output is correct
41	Correct	0 ms	204 KB	Output is correct
42	Correct	1 ms	204 KB	Output is correct
43	Correct	1 ms	204 KB	Output is correct
44	Correct	0 ms	204 KB	Output is correct
45	Correct	0 ms	204 KB	Output is correct
46	Correct	0 ms	204 KB	Output is correct
47	Correct	0 ms	204 KB	Output is correct
48	Correct	0 ms	204 KB	Output is correct
49	Correct	0 ms	332 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Correct	1 ms	332 KB	Output is correct
52	Correct	1 ms	332 KB	Output is correct
53	Correct	1 ms	716 KB	Output is correct
54	Correct	1 ms	716 KB	Output is correct
55	Correct	1 ms	588 KB	Output is correct
56	Correct	2 ms	716 KB	Output is correct
57	Correct	1 ms	716 KB	Output is correct
58	Correct	6 ms	1356 KB	Output is correct
59	Correct	6 ms	588 KB	Output is correct
60	Correct	10 ms	1732 KB	Output is correct
61	Correct	55 ms	13956 KB	Output is correct
62	Correct	166 ms	39724 KB	Output is correct
63	Correct	21 ms	1812 KB	Output is correct
64	Correct	88 ms	18316 KB	Output is correct
65	Correct	1 ms	380 KB	Output is correct
66	Correct	1 ms	460 KB	Output is correct
67	Correct	1 ms	460 KB	Output is correct
68	Correct	1 ms	460 KB	Output is correct
69	Correct	1 ms	204 KB	Output is correct
70	Correct	1 ms	332 KB	Output is correct
71	Correct	20 ms	4684 KB	Output is correct
72	Correct	2 ms	332 KB	Output is correct
73	Correct	7 ms	1356 KB	Output is correct
74	Correct	6 ms	588 KB	Output is correct
75	Correct	11 ms	1612 KB	Output is correct
76	Correct	82 ms	14044 KB	Output is correct
77	Correct	193 ms	39760 KB	Output is correct
78	Correct	17 ms	1852 KB	Output is correct
79	Correct	96 ms	18324 KB	Output is correct
80	Correct	13 ms	1000 KB	Output is correct
81	Correct	30 ms	4476 KB	Output is correct
82	Correct	196 ms	39700 KB	Output is correct
83	Correct	1 ms	204 KB	Output is correct
84	Correct	1 ms	332 KB	Output is correct
85	Correct	17 ms	4768 KB	Output is correct
86	Correct	2 ms	460 KB	Output is correct
87	Correct	6 ms	1484 KB	Output is correct
88	Correct	6 ms	664 KB	Output is correct
89	Correct	13 ms	1752 KB	Output is correct
90	Correct	71 ms	14160 KB	Output is correct
91	Correct	171 ms	40084 KB	Output is correct
92	Correct	16 ms	2160 KB	Output is correct
93	Correct	93 ms	18472 KB	Output is correct
94	Correct	2 ms	332 KB	Output is correct
95	Correct	16 ms	4680 KB	Output is correct
96	Correct	1 ms	332 KB	Output is correct
97	Correct	1 ms	204 KB	Output is correct
98	Correct	1 ms	332 KB	Output is correct
99	Correct	1 ms	204 KB	Output is correct

답안 #470490

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