oj.uz

Submission #411201

# Submission time Handle Problem Language Result Execution time Memory
411201 2021-05-24T16:28:54 Z MasterTaster K blocks (IZhO14_blocks) C++14
53 / 100
 1000 ms 118632 KB 
#include <bits/stdc++.h>

#define pb push_back
#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define MAXX 100000000010LL
#define MAXN 100010
#define MAXK 110

using namespace std;

ll seg[MAXK][4*MAXN], dp[MAXN][MAXK], a[MAXN];
int n, k, lv[MAXN];

ll query(int i, int node, int l, int r, int levo, int desno)
{
    if (levo>r || desno<l) return MAXX;
    if (levo<=l && desno>=r) return seg[i][node];

    int mid=l+(r-l)/2;
    return min(query(i, 2*node, l, mid, levo, desno),
               query(i, 2*node+1, mid+1, r, levo, desno));
}
void upd(int i, int node, int l, int r, int pos, ll val)
{
    if (pos>r || pos<l) return;
    if (l==r) { seg[i][node]=val; return; }

    int mid=l+(r-l)/2;
    if (pos<=mid) upd(i, 2*node, l, mid, pos, val);
    else upd(i, 2*node+1, mid+1, r, pos, val);

    seg[i][node]=min(seg[i][2*node], seg[i][2*node+1]);
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin>>n>>k;

    for (int i=1; i<=n; i++) cin>>a[i];

    stack<pii> st;
    st.push({1000010, 0});
    for (int i=1; i<=n; i++)
    {
        while (st.top().xx<a[i]) st.pop();
        lv[i]=st.top().yy;
        //cout<<lv[i]<<" ";

        st.push({a[i], i});
    }
    //cout<<endl;

    for (int i=0; i<=n; i++) for (int j=0; j<=k; j++) { dp[i][j]=MAXX; upd(j, 1, 0, n-1, max(0, i-1), MAXX); }

    dp[1][1]=a[1]; upd(1, 1, 0, n-1, 0, dp[1][1]);
    //cout<<query(1, 1, 0, n-1, 0, 0)<<endl;
    //cout<<query(0, 1, 0, n-1, 0, 0)<<endl;
    for (int i=2; i<=n; i++)
    {
        //cout<<i<<endl;
        for (int j=1; j<=min(k, i); j++)
        {
            if (j==1 && lv[i]==0) { dp[i][j]=a[i]; /*cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;*/ continue; }
            //cout<<"trazim "<<j-1<<" "<<lv[i]-1<<" "<<i-2<<endl;
            dp[i][j]=query(j-1, 1, 0, n-1, max(0, lv[i]-1), i-1)+a[i];
            //dp[i][j]=min(dp[i][j], query(j, 1, 0, n-1, lv[i], i-1)+a[i]);
            //cout<<dp[i][j]<<" ";
            dp[i][j]=min(dp[i][j], dp[lv[i]][j]);
            //cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
        }

        for (int j=1; j<=min(k, i); j++) { /*cout<<"apdejtujem "<<j<<" "<<i-1<<endl;*/ upd(j, 1, 0, n-1, i-1, dp[i][j]); }
    }

    cout<<dp[n][k];

}

/*
5 3
1 | 4 2 5 | 3
*/

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 460 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 1 ms 460 KB Output is correct
39 Correct 2 ms 844 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 588 KB Output is correct
52 Correct 1 ms 588 KB Output is correct
53 Correct 3 ms 1356 KB Output is correct
54 Correct 2 ms 1356 KB Output is correct
55 Correct 2 ms 844 KB Output is correct
56 Correct 2 ms 1356 KB Output is correct
57 Correct 3 ms 1356 KB Output is correct
58 Correct 104 ms 15840 KB Output is correct
59 Correct 51 ms 41048 KB Output is correct
60 Correct 179 ms 47424 KB Output is correct
61 Execution timed out 1091 ms 118632 KB Time limit exceeded
62 Halted 0 ms 0 KB -