oj.uz

Submission #879864

# Submission time Handle Problem Language Result Execution time Memory
879864 2023-11-28T08:44:43 Z 12345678 K blocks (IZhO14_blocks) C++17
0 / 100
 1 ms 4560 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5, kx=105;
int n, k, v[nx], dp[kx][nx], x, mx;

struct segtree
{
    int d[4*nx], lz[4*nx];
    void pushlz(int l, int r, int i)
    {
        d[i]+=lz[i];
        if (l==r) return void(lz[i]=0);
        d[2*i]+=lz[i];
        d[2*i+1]+=lz[i];
        lz[i]=0;
    }
    void build(int l, int r, int i, int ly)
    {
        lz[i]=0;
        if (l==r) return void(d[i]=l<=ly?1e9:dp[ly][l-ly]);
        int md=(l+r)/2;
        build(l, md, 2*i, ly);
        build(md+1, r ,2*i+1, ly);
        d[i]=min(d[2*i], d[2*i+1]);
    }
    void update(int l, int r, int i, int ql, int qr, int vl)
    {
        pushlz(l, r, i);
        if (qr<l||r<ql) return;
        if (ql<=l&&r<=qr) return d[i]+=vl, pushlz(l, r, i), void();
        int md=(l+r)/2;
        update(l, md, 2*i, ql, qr, vl);
        update(md+1, r, 2*i+1, ql, qr, vl);
        d[i]=min(d[2*i], d[2*i+1]);
    }
    int query(int l, int r, int i, int ql, int qr)
    {
        pushlz(l, r, i);
        if (r<ql||qr<l) return INT_MAX;
        if (ql<=l&&r<=qr) return d[i];
        int md=(l+r)/2;
        return min(query(l, md, 2*i, ql, qr), query(md+1, r, 2*i+1, ql, qr));
    }
} s;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    v[0]=1e9;
    for (int i=1; i<=n; i++) cin>>v[i], mx=max(mx, v[i]), dp[1][i]=mx;
    for (int i=2; i<=k; i++)
    {
        stack<int> st;
        st.push(0);
        s.build(1, n, 1, i-1);
        for (int j=1; j<=n; j++)
        {
            while (st.size()>=2&&v[st.top()]<=v[j]) x=st.top(), st.pop(), s.update(1, n, 1, st.top()+1, x, -v[x]);
            s.update(1, n, 1, st.top()+1, j, v[j]);
            //cout<<"query ";
            //for (int i=1; i<=n; i++) cout<<s.query(1, n, 1, i, i)<<' ';
            //cout<<'\n';
            dp[i][j]=s.query(1, n, 1, 1, j);
            //cout<<i<<' '<<j<<' '<<dp[i][j]<<'\n';
            st.push(j);
        }
    }
    cout<<dp[k][n];
}

/*
5 2
1 2 3 4 5

5 1
1 2 3 4 5
*/

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 344 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Incorrect 1 ms 4560 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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