oj.uz

답안 #485354

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
485354 2021-11-07T09:00:04 Z silverfox K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 336 ms 81592 KB 
#include <bits/stdc++.h>
using namespace std;

const long long maxn = 1e5;
const long long maxk = 1e2;

long long a[maxn+1];
long long f[maxn+1][maxk+1];

const long long oo = 1e16;

int main()
{
    long long n,k; cin >> n >> k;
    for (long long i = 1; i <= n; i++) {cin >> a[i];}

    for (int i = 0; i <= n; i++)
    {
        for (int j = 0; j <= k; j++) {f[i][j] = +oo;}
    }

    /*for (long long i = 1; i <= k; i++)
    {
        if (i == 1) {f[1][i] = a[1];} else {f[1][i] = +oo;}
    }*/

    /*for (long long i = 0; i <= k; i++)
    {
        f[0][i] = +oo;
    }

    long long totalMax = -1;
    for (long long i = 1; i <= n; i++)
    {
        totalMax = max(totalMax, a[i]);
        for (long long j = 1; j <= k; j++)
        {
            f[i][j] = +oo;
            if (j > i) {continue;}

            if (j == 1)
            {
                f[i][j] = totalMax; continue;
            }

            long long curMax = a[i];
            for (long long x = i-1; x >= 1; x--)
            {
                f[i][j] = min(f[i][j], f[x][j-1] + curMax);
                curMax = max(curMax, a[x]);
            }
        }
    }
    cout << f[n][k];*/

    long long curMax = -1;
    for (long long i = 1; i <= n; i++)
    {
        curMax = max(curMax, a[i]);
        f[i][1] = curMax;
    }

    for (long long i = 2; i <= k; i++)
    {
        stack<long long> l, s2;
        for (long long j = 1; j <= n; j++)
        {
            long long cur = f[j-1][i-1];
            while(!l.empty() && l.top() < a[j])
            {
                cur = min(cur, s2.top());
                l.pop(); s2.pop();
            }
            if (l.empty() || cur + a[j] < l.top() + s2.top())
            {
                l.push(a[j]); s2.push(cur);
            }

            if (j >= i) {f[j][i] = l.top() + s2.top();}
        }
    }

    cout << f[n][k];
}

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 332 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 0 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 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 0 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 272 KB Output is correct
58 Correct 9 ms 8228 KB Output is correct
59 Correct 25 ms 36072 KB Output is correct
60 Correct 31 ms 36036 KB Output is correct
61 Correct 63 ms 36052 KB Output is correct
62 Correct 242 ms 80768 KB Output is correct
63 Correct 59 ms 80740 KB Output is correct
64 Correct 141 ms 80768 KB Output is correct
65 Correct 1 ms 304 KB Output is correct
66 Correct 1 ms 332 KB Output is correct
67 Correct 1 ms 332 KB Output is correct
68 Correct 1 ms 332 KB Output is correct
69 Correct 1 ms 1100 KB Output is correct
70 Correct 1 ms 1100 KB Output is correct
71 Correct 17 ms 8348 KB Output is correct
72 Correct 6 ms 8248 KB Output is correct
73 Correct 9 ms 8268 KB Output is correct
74 Correct 25 ms 36076 KB Output is correct
75 Correct 29 ms 35960 KB Output is correct
76 Correct 84 ms 35952 KB Output is correct
77 Correct 278 ms 80792 KB Output is correct
78 Correct 60 ms 80680 KB Output is correct
79 Correct 162 ms 80792 KB Output is correct
80 Correct 58 ms 80744 KB Output is correct
81 Correct 75 ms 80740 KB Output is correct
82 Correct 277 ms 80708 KB Output is correct
83 Correct 1 ms 1100 KB Output is correct
84 Correct 1 ms 1100 KB Output is correct
85 Correct 21 ms 8396 KB Output is correct
86 Correct 8 ms 8396 KB Output is correct
87 Correct 10 ms 8396 KB Output is correct
88 Correct 26 ms 36036 KB Output is correct
89 Correct 32 ms 36488 KB Output is correct
90 Correct 101 ms 36396 KB Output is correct
91 Correct 336 ms 81592 KB Output is correct
92 Correct 66 ms 81296 KB Output is correct
93 Correct 175 ms 81532 KB Output is correct
94 Correct 6 ms 8268 KB Output is correct
95 Correct 15 ms 8268 KB Output is correct
96 Correct 1 ms 1100 KB Output is correct
97 Correct 1 ms 1100 KB Output is correct
98 Correct 0 ms 204 KB Output is correct
99 Correct 1 ms 204 KB Output is correct