oj.uz

Submission #671408

# Submission time Handle Problem Language Result Execution time Memory
671408 2022-12-13T04:19:21 Z hct_2so1 K blocks (IZhO14_blocks) C++14
0 / 100
 0 ms 340 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
const ll INF = 1e18 + 7;
ll dp[N][3], n, k, a[N], st[4 * N];

int main()
{
    std::ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>k;
    for (int i = 1; i<=n; i++) cin>>a[i], dp[i][1] = max(dp[i - 1][1], a[i]);
    for (int i = 1; i<=4*n; i++) st[i] = INF;
    for (int j = 2; j<=k; j++)
    {
        stack<pair<int, ll>> s;
        int cur = j & 1;
        for (int i = j; i<=n; i++)
        {
            ll minF = dp[i - 1][1 - cur];
            while (s.size() && a[s.top().first] <= a[i]) minF = min(minF, s.top().second), s.pop();
            if (s.empty()) dp[i][cur] = minF + a[i];
            else dp[i][cur] = min(dp[s.top().first][1 - cur], minF + a[i]);
            s.push({i, minF});
        }
    }
    cout<<dp[n][k & 1];
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -