oj.uz

답안 #102688

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102688 2019-03-26T18:45:36 Z stefdasca K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 343 ms 40328 KB 
/*
        IZhO 14-Blocks(same as this 2008 Romanian problem - https://www.infoarena.ro/problema/ksecv)

    We can solve it using deques, where dp[i][j] = min sum if we split the first j numbers in i sequences

*/
#include<bits/stdc++.h>
using namespace std;
int n, k, dp[102][100002], v[100002];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    for(int i = 1; i <= n; ++i)
        cin >> v[i];
    int mx = 0;
    for(int i = 1; i <= n; ++i)
    {
        mx = max(mx, v[i]);
        dp[1][i] = mx;
    }
    for(int i = 2; i <= k; ++i)
    {
        deque<int>val;
        deque<int>pmax;
        deque<int>pmin;
        for(int j = i; j <= n; ++j)
        {
            int zmin = j-1;
            while(!val.empty() && v[j] >= v[val.back()])
            {
                if(dp[i-1][pmin.back()] < dp[i-1][zmin])
                    zmin = pmin.back();
                pmin.pop_back();
                val.pop_back();
                pmax.pop_back();
            }
            val.push_back(j);
            pmin.push_back(zmin);
            if(val.size() == 1)
                pmax.push_back(dp[i-1][zmin] + v[j]);
            else
            {
                if(pmax.back() < dp[i-1][zmin] + v[j])
                    pmax.push_back(pmax.back());
                else
                    pmax.push_back(dp[i-1][zmin] + v[j]);
            }
            dp[i][j] = pmax.back();
        }
    }
    cout << dp[k][n] << '\n';
    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 512 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 3 ms 896 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 3 ms 896 KB Output is correct
19 Correct 3 ms 896 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1408 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 12 ms 1792 KB Output is correct
4 Correct 76 ms 14048 KB Output is correct
5 Correct 227 ms 39892 KB Output is correct
6 Correct 17 ms 1920 KB Output is correct
7 Correct 112 ms 18424 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 ms 612 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 34 ms 4728 KB Output is correct
15 Correct 3 ms 512 KB Output is correct
16 Correct 11 ms 1408 KB Output is correct
17 Correct 6 ms 640 KB Output is correct
18 Correct 14 ms 1792 KB Output is correct
19 Correct 103 ms 14064 KB Output is correct
20 Correct 323 ms 40104 KB Output is correct
21 Correct 18 ms 1912 KB Output is correct
22 Correct 145 ms 18296 KB Output is correct
23 Correct 16 ms 1144 KB Output is correct
24 Correct 43 ms 4620 KB Output is correct
25 Correct 343 ms 39888 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 26 ms 4860 KB Output is correct
29 Correct 3 ms 512 KB Output is correct
30 Correct 9 ms 1536 KB Output is correct
31 Correct 6 ms 768 KB Output is correct
32 Correct 13 ms 1944 KB Output is correct
33 Correct 107 ms 14220 KB Output is correct
34 Correct 262 ms 40328 KB Output is correct
35 Correct 18 ms 2376 KB Output is correct
36 Correct 125 ms 18856 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 23 ms 4736 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 2 ms 384 KB Output is correct