oj.uz

답안 #879866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879866 2023-11-28T08:51:22 Z 12345678 K개의 묶음 (IZhO14_blocks) C++17
53 / 100
 1000 ms 41488 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<=1?1e9:dp[ly][l-1]);
        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]);
            dp[i][j]=s.query(1, n, 1, 1, j);
            st.push(j);
            //cout<<i<<' '<<j<<' '<<dp[i][j]<<'\n';
        }
    }
    cout<<dp[k][n];
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 2392 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 0 ms 2396 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4696 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 4564 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 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 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 2392 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 0 ms 2396 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4696 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 4564 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 2 ms 8540 KB Output is correct
35 Correct 1 ms 8540 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 8540 KB Output is correct
38 Correct 1 ms 10588 KB Output is correct
39 Correct 3 ms 20824 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 388 KB Output is correct
43 Correct 0 ms 2396 KB Output is correct
44 Correct 1 ms 2396 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 0 ms 2396 KB Output is correct
48 Correct 1 ms 4444 KB Output is correct
49 Correct 1 ms 4444 KB Output is correct
50 Correct 1 ms 4696 KB Output is correct
51 Correct 2 ms 12768 KB Output is correct
52 Correct 2 ms 12636 KB Output is correct
53 Correct 9 ms 41488 KB Output is correct
54 Correct 6 ms 41304 KB Output is correct
55 Correct 4 ms 22876 KB Output is correct
56 Correct 6 ms 41308 KB Output is correct
57 Correct 6 ms 41304 KB Output is correct

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 2392 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 0 ms 2396 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4696 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 4564 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 2 ms 8540 KB Output is correct
35 Correct 1 ms 8540 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 8540 KB Output is correct
38 Correct 1 ms 10588 KB Output is correct
39 Correct 3 ms 20824 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 388 KB Output is correct
43 Correct 0 ms 2396 KB Output is correct
44 Correct 1 ms 2396 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 0 ms 2396 KB Output is correct
48 Correct 1 ms 4444 KB Output is correct
49 Correct 1 ms 4444 KB Output is correct
50 Correct 1 ms 4696 KB Output is correct
51 Correct 2 ms 12768 KB Output is correct
52 Correct 2 ms 12636 KB Output is correct
53 Correct 9 ms 41488 KB Output is correct
54 Correct 6 ms 41304 KB Output is correct
55 Correct 4 ms 22876 KB Output is correct
56 Correct 6 ms 41308 KB Output is correct
57 Correct 6 ms 41304 KB Output is correct
58 Correct 96 ms 13100 KB Output is correct
59 Correct 3 ms 1112 KB Output is correct
60 Correct 124 ms 5468 KB Output is correct
61 Execution timed out 1036 ms 23980 KB Time limit exceeded
62 Halted 0 ms 0 KB -