oj.uz

Submission #343681

# Submission time Handle Problem Language Result Execution time Memory
343681 2021-01-04T11:35:42 Z _ani K blocks (IZhO14_blocks) C++17
100 / 100
 656 ms 82788 KB 
#define BUGO(x) cerr << #x << " = " << (x) << '\n';
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
using namespace std;
using ll = long long;
const int N = 100'002;
const int K = 20;
const ll inf = 1'000'000'000'000'000'000LL;
ll dp[N][102], a[N];
struct el {
    ll x; int ind;
};
bool operator<(const el& a, const el& b) {
    return a.x < b.x;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 0; i <= n; i++)
        for (int curk = 1; curk <= k; curk++)
            dp[i][curk] = inf;

    for (int curk = 1; curk <= k; curk++) {
        stack<el> x;
        vector<int> mn;
        x.push({ inf, 0 });
        for (int i = 1; i <= n; i++) {
            while (!mn.empty() && dp[mn.back()][curk - 1] > dp[i - 1][curk - 1])
                mn.erase(prev(mn.end()));
            if (i > 1)
                mn.push_back(i - 1);
            while (x.top().x < a[i])x.pop();
            el prev = x.top();
            x.push({ a[i], i });
            if (i < curk) {
                continue;
            }
            if (curk == 1)
                dp[i][curk] = ((i - 1 != 0) ? max(dp[i - 1][1], a[i]) : a[i]);
            else if (prev.ind == 0) {
                if (i - 1 == 0)
                    dp[i][curk] = a[i];
                else {
                    int x = lower_bound(mn.begin(), mn.end(), 1) - mn.begin();
      //              cerr << x << '\n';
                    dp[i][curk] = a[i] + dp[mn[x]][curk - 1];
                }
            }
            else {
                int x = lower_bound(mn.begin(), mn.end(), prev.ind) - mn.begin();
    //            cerr << x << '\n';
                dp[i][curk] = min(dp[prev.ind][curk], dp[mn[x]][curk - 1] + a[i]);
            }
        }
    }

  /*  for (int i = 0; i <= n; i++)
    {
        for (int curk = 0; curk <= k; curk++)
            cerr << dp[i][curk] << ' ';
        cerr << '\n';
    }*/
    cout << dp[n][k] << '\n';
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 0 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 0 ms 364 KB Output is correct
45 Correct 0 ms 364 KB Output is correct
46 Correct 0 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 0 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 0 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 0 ms 364 KB Output is correct
45 Correct 0 ms 364 KB Output is correct
46 Correct 0 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 0 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 15 ms 8556 KB Output is correct
59 Correct 23 ms 36588 KB Output is correct
60 Correct 38 ms 36772 KB Output is correct
61 Correct 227 ms 36736 KB Output is correct
62 Correct 656 ms 82052 KB Output is correct
63 Correct 62 ms 82532 KB Output is correct
64 Correct 322 ms 82628 KB Output is correct
65 Correct 1 ms 492 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 492 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 1132 KB Output is correct
70 Correct 2 ms 1132 KB Output is correct
71 Correct 52 ms 8556 KB Output is correct
72 Correct 6 ms 8556 KB Output is correct
73 Correct 16 ms 8556 KB Output is correct
74 Correct 22 ms 36848 KB Output is correct
75 Correct 36 ms 36928 KB Output is correct
76 Correct 205 ms 36928 KB Output is correct
77 Correct 478 ms 82532 KB Output is correct
78 Correct 61 ms 82532 KB Output is correct
79 Correct 246 ms 82532 KB Output is correct
80 Correct 51 ms 82288 KB Output is correct
81 Correct 91 ms 82532 KB Output is correct
82 Correct 525 ms 82532 KB Output is correct
83 Correct 1 ms 1132 KB Output is correct
84 Correct 1 ms 1132 KB Output is correct
85 Correct 29 ms 8680 KB Output is correct
86 Correct 6 ms 8676 KB Output is correct
87 Correct 11 ms 8676 KB Output is correct
88 Correct 24 ms 36972 KB Output is correct
89 Correct 34 ms 37048 KB Output is correct
90 Correct 115 ms 37048 KB Output is correct
91 Correct 341 ms 82788 KB Output is correct
92 Correct 60 ms 82788 KB Output is correct
93 Correct 182 ms 82788 KB Output is correct
94 Correct 6 ms 8556 KB Output is correct
95 Correct 44 ms 8556 KB Output is correct
96 Correct 1 ms 1132 KB Output is correct
97 Correct 1 ms 1132 KB Output is correct
98 Correct 1 ms 364 KB Output is correct
99 Correct 1 ms 364 KB Output is correct