답안 #470486

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
470486 2021-09-04T05:21:25 Z lethinh05 K개의 묶음 (IZhO14_blocks) C++11
100 / 100
206 ms 40724 KB
#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]);
      |                  ^~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 276 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 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 1 ms 204 KB Output is correct
16 Correct 0 ms 300 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 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 0 ms 204 KB Output is correct
7 Correct 0 ms 300 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 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 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 276 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 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 1 ms 204 KB Output is correct
16 Correct 0 ms 300 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 300 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 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 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 1 ms 300 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 1 ms 332 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 0 ms 300 KB Output is correct
47 Correct 0 ms 304 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 204 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 1 ms 716 KB Output is correct
57 Correct 1 ms 716 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 276 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 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 1 ms 204 KB Output is correct
16 Correct 0 ms 300 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 300 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 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 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 1 ms 300 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 1 ms 332 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 0 ms 300 KB Output is correct
47 Correct 0 ms 304 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 204 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 1 ms 716 KB Output is correct
57 Correct 1 ms 716 KB Output is correct
58 Correct 5 ms 1452 KB Output is correct
59 Correct 6 ms 844 KB Output is correct
60 Correct 11 ms 1932 KB Output is correct
61 Correct 55 ms 14244 KB Output is correct
62 Correct 152 ms 40448 KB Output is correct
63 Correct 16 ms 2508 KB Output is correct
64 Correct 74 ms 18980 KB Output is correct
65 Correct 1 ms 332 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 552 KB Output is correct
69 Correct 1 ms 204 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 21 ms 4776 KB Output is correct
72 Correct 2 ms 460 KB Output is correct
73 Correct 7 ms 1444 KB Output is correct
74 Correct 6 ms 844 KB Output is correct
75 Correct 12 ms 2000 KB Output is correct
76 Correct 81 ms 14296 KB Output is correct
77 Correct 206 ms 40388 KB Output is correct
78 Correct 17 ms 2508 KB Output is correct
79 Correct 102 ms 18920 KB Output is correct
80 Correct 14 ms 1740 KB Output is correct
81 Correct 30 ms 5200 KB Output is correct
82 Correct 196 ms 40460 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 332 KB Output is correct
85 Correct 18 ms 4752 KB Output is correct
86 Correct 2 ms 460 KB Output is correct
87 Correct 7 ms 1476 KB Output is correct
88 Correct 6 ms 892 KB Output is correct
89 Correct 12 ms 2124 KB Output is correct
90 Correct 58 ms 14348 KB Output is correct
91 Correct 175 ms 40724 KB Output is correct
92 Correct 19 ms 2836 KB Output is correct
93 Correct 83 ms 19148 KB Output is correct
94 Correct 2 ms 460 KB Output is correct
95 Correct 16 ms 4776 KB Output is correct
96 Correct 1 ms 332 KB Output is correct
97 Correct 1 ms 204 KB Output is correct
98 Correct 0 ms 332 KB Output is correct
99 Correct 1 ms 204 KB Output is correct