oj.uz

답안 #337997

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337997 2020-12-22T08:54:21 Z Dilshod_Imomov K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 1 ms 368 KB 
# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define int long long
# define fi first
# define se second

using namespace std;

const int N = 1e7 + 7;
const int mod = 1e9 + 7;

int a[N], dp[N][2];

int32_t main() {
    speed;
    int n, k;
    cin >> n >> k;
    for ( int i = 1; i <= n; i++ ) {
        cin >> a[i];
        dp[i][0] = dp[i][1] = 1e9;
    }
    dp[0][0] = dp[0][1] = 0;
    for ( int j = 1; j <= min( 2ll, k ); j++ ) {
        for ( int i = 1; i <= n; i++ ) {
            int mx = a[i];
            for ( int x = i - 1; x >= 0; x-- ) {
                if ( x == 0 ) {
                    if ( j != 1 ) {
                        continue;
                    }
                }
                dp[i][1] = min( dp[i][1], dp[x][0] + mx );
                // cout << i << ' ' << x << ' ' << dp[x][0] + mx << endl;
                mx = max( mx, a[x] );
            }
            // cout << i << ' ' << j << ' ' << dp[i][1] << endl;
        }
        for ( int i = 1; i <= n; i++ ) {
            dp[i][0] = dp[i][1];
            dp[i][1] = 1e9;
        }
    }
    cout << dp[n][0];
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Incorrect 1 ms 364 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 368 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Incorrect 1 ms 364 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Incorrect 1 ms 364 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Incorrect 1 ms 364 KB Output isn't correct
10 Halted 0 ms 0 KB -