oj.uz

Submission #99927

# Submission time Handle Problem Language Result Execution time Memory
99927 2019-03-08T19:29:18 Z MohamedAhmed0 K blocks (IZhO14_blocks) C++14
14 / 100
 6 ms 688 KB 
#include <bits/stdc++.h>

using namespace std;

int dp[105][105][7] ;
int arr[105] ;
int n , k ;

int solve(int idx , int idx2 , int cnt)
{
    if(cnt > k)
        return 1e9 ;
    if(idx == n)
    {
        if(cnt != k)
            return 1e9 ;
        return arr[idx2] ;
    }
    int &ret = dp[idx][idx2][cnt] ;
    if(ret != -1)
        return ret ;
    if(idx == 0)
    {
        ret = solve(idx+1 , 0 , 1) ;
        return ret ;
    }
    ret = solve(idx+1 , idx , cnt+1) + arr[idx2] ;
    if(arr[idx] > arr[idx2])
        idx2 = idx ;
    ret = min(ret , solve(idx+1 , idx2 , cnt));
    return ret ;
}

int main()
{
    memset(dp , -1 , sizeof(dp));
    scanf("%d %d" , &n , &k) ;
    for(int i = 0 ; i < n ; ++i)
        cin>>arr[i] ;
    return cout<<solve(0 , 0 , 0)<<"\n" , 0 ;
}

Compilation message

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

Subtask #1
14.0 / 14.0

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

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 688 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct
12 Correct 2 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Incorrect 2 ms 640 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 560 KB Output isn't correct
2 Halted 0 ms 0 KB -