oj.uz

답안 #172674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172674 2020-01-02T10:45:13 Z Swan K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 334 ms 43060 KB 
#include <bits/stdc++.h>
using namespace std;

int dp[105][100005];
int a[100005];
int n,k;

int main(){
    scanf("%d %d",&n,&k);
    int maxv = 0;
    memset(dp,0x3f,sizeof(dp));
    for (int i=1; i<=n; i++) {
        scanf("%d",&a[i]);
        maxv = max(maxv,a[i]);
        dp[1][i] = maxv;
    }
    for (int i=2; i<=k; i++) {
        stack<int> s1,s2;
        for (int j=1; j<=n; j++) {
            int my_dp = dp[i-1][j-1];
            while (!s1.empty() && a[s1.top()] < a[j]) {
                //if(k==2 && j == 1)cout << my_dp << ' ' << s1.top() << endl;
                my_dp = min(my_dp,s2.top());
                s1.pop();
                s2.pop();
            }
            if(s1.size() && j>=i)dp[i][j] = dp[i][s1.top()];
            s1.push(j);
            s2.push(min(dp[i-1][j],my_dp));
            if(j >= i) {
                dp[i][j] = min(dp[i][j],my_dp + a[j]);
            }
        }
    }
    cout << dp[k][n];
}
/*
10 7
1 5 5 9 10 14 15 16 8 3
*/

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&k);
     ~~~~~^~~~~~~~~~~~~~~
blocks.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a[i]);
         ~~~~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 41464 KB Output is correct
2 Correct 37 ms 41464 KB Output is correct
3 Correct 37 ms 41336 KB Output is correct
4 Correct 37 ms 41436 KB Output is correct
5 Correct 37 ms 41480 KB Output is correct
6 Correct 37 ms 41464 KB Output is correct
7 Correct 37 ms 41468 KB Output is correct
8 Correct 38 ms 41436 KB Output is correct
9 Correct 38 ms 41464 KB Output is correct
10 Correct 37 ms 41464 KB Output is correct
11 Correct 43 ms 41464 KB Output is correct
12 Correct 37 ms 41464 KB Output is correct
13 Correct 37 ms 41464 KB Output is correct
14 Correct 37 ms 41472 KB Output is correct
15 Correct 37 ms 41464 KB Output is correct
16 Correct 37 ms 41464 KB Output is correct
17 Correct 38 ms 41468 KB Output is correct
18 Correct 37 ms 41464 KB Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 41336 KB Output is correct
2 Correct 37 ms 41464 KB Output is correct
3 Correct 37 ms 41464 KB Output is correct
4 Correct 41 ms 41464 KB Output is correct
5 Correct 37 ms 41464 KB Output is correct
6 Correct 37 ms 41464 KB Output is correct
7 Correct 37 ms 41464 KB Output is correct
8 Correct 37 ms 41464 KB Output is correct
9 Correct 37 ms 41436 KB Output is correct
10 Correct 37 ms 41368 KB Output is correct
11 Correct 37 ms 41452 KB Output is correct
12 Correct 37 ms 41436 KB Output is correct
13 Correct 37 ms 41464 KB Output is correct
14 Correct 37 ms 41464 KB Output is correct
15 Correct 37 ms 41464 KB Output is correct
16 Correct 37 ms 41464 KB Output is correct
17 Correct 36 ms 41464 KB Output is correct
18 Correct 37 ms 41464 KB Output is correct
19 Correct 33 ms 41456 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 41492 KB Output is correct
2 Correct 42 ms 41848 KB Output is correct
3 Correct 48 ms 41980 KB Output is correct
4 Correct 117 ms 41976 KB Output is correct
5 Correct 274 ms 42528 KB Output is correct
6 Correct 54 ms 42476 KB Output is correct
7 Correct 150 ms 42536 KB Output is correct
8 Correct 37 ms 41464 KB Output is correct
9 Correct 37 ms 41464 KB Output is correct
10 Correct 37 ms 41464 KB Output is correct
11 Correct 37 ms 41448 KB Output is correct
12 Correct 37 ms 41464 KB Output is correct
13 Correct 37 ms 41464 KB Output is correct
14 Correct 66 ms 41464 KB Output is correct
15 Correct 39 ms 41496 KB Output is correct
16 Correct 46 ms 41564 KB Output is correct
17 Correct 44 ms 41848 KB Output is correct
18 Correct 51 ms 41848 KB Output is correct
19 Correct 137 ms 41932 KB Output is correct
20 Correct 332 ms 42524 KB Output is correct
21 Correct 58 ms 42488 KB Output is correct
22 Correct 176 ms 42540 KB Output is correct
23 Correct 51 ms 42420 KB Output is correct
24 Correct 77 ms 42544 KB Output is correct
25 Correct 334 ms 42528 KB Output is correct
26 Correct 37 ms 41364 KB Output is correct
27 Correct 39 ms 41420 KB Output is correct
28 Correct 61 ms 41592 KB Output is correct
29 Correct 38 ms 41592 KB Output is correct
30 Correct 44 ms 41636 KB Output is correct
31 Correct 44 ms 41848 KB Output is correct
32 Correct 49 ms 42096 KB Output is correct
33 Correct 123 ms 42100 KB Output is correct
34 Correct 299 ms 43060 KB Output is correct
35 Correct 66 ms 42888 KB Output is correct
36 Correct 163 ms 42900 KB Output is correct
37 Correct 45 ms 41464 KB Output is correct
38 Correct 62 ms 41520 KB Output is correct
39 Correct 39 ms 41452 KB Output is correct
40 Correct 39 ms 41468 KB Output is correct
41 Correct 38 ms 41436 KB Output is correct
42 Correct 37 ms 41464 KB Output is correct