Submission #831279

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
831279	2023-08-20T03:44:53 Z	XPhuocNe	K blocks (IZhO14_blocks)	C++14	0 / 100	1 ms	360 KB

blocks

#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long ll;
const int N = 2e4 + 7, K = 1e2 + 7;
const ll oo = 1e16 + 7;
int n, k;
ll dp[N][K], a[N];
void Read()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
}
void Solve()
{
	for (int g = 1; g <= k; g++)
    	for (int i = 1; i <= n; i++) dp[i][g] = oo;
    	
    for (int i = 1; i <= n; i++) dp[i][1] = max(dp[i - 1][1], a[i]);
    
    for (int g = 2; g <= k; g++)
    {
        stack<pair<int, ll> > st;
        for (int i = g; i <= n; i++)
        {
            ll minF = dp[i - 1][g - 1];
            while (!st.empty())
                if (a[st.top().X] <= a[i])
                {
                	minF = min(minF, st.top().Y);
                    st.pop();
                } else break;
            if (st.empty()) dp[i][g] = minF + a[i];
            else dp[i][g] = min(dp[st.top().X][g - 1], minF) + a[i];
            st.push({i, minF});
        }
    }
/*    for (int g = 1; g <= k; g++)
    {
        for (int i = 1; i <= n; i++) cout << dp[i][g] << " ";
        cout << "\n";
    }*/
    cout << dp[n][k];
}
int main()
{
//    freopen("TEST.INP", "r", stdin);
//    freopen("TEST.OUT", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    Read();
    Solve();
    return 0;
}

Subtask #1

0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	328 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	360 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Incorrect	1 ms	304 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #2

0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	328 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	324 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Incorrect	0 ms	340 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	328 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	360 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Incorrect	1 ms	304 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #4

0 / 47.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	328 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	360 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Incorrect	1 ms	304 KB	Output isn't correct
14	Halted	0 ms	0 KB	-