oj.uz

Submission #918488

# Submission time Handle Problem Language Result Execution time Memory
918488 2024-01-29T23:15:57 Z n3rm1n K blocks (IZhO14_blocks) C++17
100 / 100
 342 ms 166972 KB 
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const long long MAXN = 1e5 + 10, MAXK = 105;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
long long n, k, a[MAXN];
void read()
{
    cin >> n >> k;
    for (long long i = 1; i <= n; ++ i)
        cin >> a[i];
}
long long dp[MAXN][MAXK];
long long maxused[MAXN][MAXK];
void solve()
{
    long long inf = 1e17;
    for (int i = 1; i <= n; ++ i)
        for (int j = 0; j <= k; ++ j)
        {
            dp[i][j] = inf;
            maxused[i][j] = inf;
        }
    dp[0][0] = 0;
    maxused[0][0] = 0;
    for (long long j = 1; j <= k; ++ j)
    {
        stack < pair <long long, long long > > t;
        ///t.push(make_pair(0, 0));
        for (long long i = j; i <= n; ++ i)
        {
            ///cout << "***" << endl;
            dp[i][j] = inf;
            dp[i][j] = dp[i-1][j-1] + a[i];

            maxused[i][j] = a[i];
            long long init = dp[i][j];
            if(init >= inf)
            {
                maxused[i][j] = inf;

            }
           /// cout << "init " << init << " from " << dp[i-1][j-1] << endl;
            while(!t.empty())
            {
                long long sz = t.top().first;
                long long dpp = t.top().second;

                if(maxused[sz][j] <= a[i])
                {
                    if(dpp + a[i] - maxused[sz][j] < dp[i][j])
                    {
                        dp[i][j] = dpp + a[i] - maxused[sz][j];
                        maxused[i][j] = a[i];
                       /// cout <<"updated to " <<  dpp + a[i] - maxused[sz][j] << " from " << sz << endl;
                    }
                    t.pop();
                }
                else break;
            }
            if(t.size() == 0 || t.top().second > dp[i][j])
            {
               /// cout << "if (1) " << endl;
                t.push(make_pair(i, dp[i][j]));
            }
            else
            {
               /// cout << "if (2) " << endl;
                dp[i][j] = t.top().second;
                maxused[i][j] = maxused[t.top().first][j];
            }
           /// cout << i << " " << j << " --> " << dp[i][j] << endl;
           /// cout << "maxused " << maxused[i][j] << endl;
           /// cout << "init was " << init << endl;
        }
    }
    cout << dp[n][k] << endl;
}
int main()
{
    speed();

    read();
    solve();
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2400 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2512 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2508 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2648 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2512 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2648 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 4440 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 1 ms 2396 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 1 ms 2396 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 1 ms 2396 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 1 ms 4444 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 1 ms 4444 KB Output is correct
54 Correct 1 ms 4444 KB Output is correct
55 Correct 1 ms 4444 KB Output is correct
56 Correct 1 ms 4444 KB Output is correct
57 Correct 1 ms 4444 KB Output is correct
58 Correct 7 ms 19036 KB Output is correct
59 Correct 16 ms 77144 KB Output is correct
60 Correct 19 ms 77144 KB Output is correct
61 Correct 57 ms 76948 KB Output is correct
62 Correct 257 ms 166200 KB Output is correct
63 Correct 61 ms 166296 KB Output is correct
64 Correct 144 ms 166408 KB Output is correct
65 Correct 1 ms 4444 KB Output is correct
66 Correct 1 ms 4444 KB Output is correct
67 Correct 1 ms 4444 KB Output is correct
68 Correct 1 ms 4444 KB Output is correct
69 Correct 1 ms 6612 KB Output is correct
70 Correct 2 ms 6748 KB Output is correct
71 Correct 14 ms 19256 KB Output is correct
72 Correct 4 ms 19036 KB Output is correct
73 Correct 6 ms 19032 KB Output is correct
74 Correct 16 ms 77328 KB Output is correct
75 Correct 17 ms 77148 KB Output is correct
76 Correct 53 ms 77392 KB Output is correct
77 Correct 257 ms 166292 KB Output is correct
78 Correct 58 ms 166228 KB Output is correct
79 Correct 139 ms 166352 KB Output is correct
80 Correct 52 ms 166224 KB Output is correct
81 Correct 69 ms 166508 KB Output is correct
82 Correct 248 ms 166300 KB Output is correct
83 Correct 1 ms 6748 KB Output is correct
84 Correct 1 ms 6748 KB Output is correct
85 Correct 18 ms 19316 KB Output is correct
86 Correct 4 ms 19288 KB Output is correct
87 Correct 7 ms 19288 KB Output is correct
88 Correct 15 ms 77148 KB Output is correct
89 Correct 19 ms 77408 KB Output is correct
90 Correct 71 ms 77448 KB Output is correct
91 Correct 342 ms 166972 KB Output is correct
92 Correct 57 ms 166736 KB Output is correct
93 Correct 187 ms 166824 KB Output is correct
94 Correct 4 ms 19036 KB Output is correct
95 Correct 17 ms 19260 KB Output is correct
96 Correct 2 ms 7112 KB Output is correct
97 Correct 1 ms 6748 KB Output is correct
98 Correct 1 ms 2396 KB Output is correct
99 Correct 1 ms 2396 KB Output is correct