oj.uz

답안 #829100

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829100 2023-08-18T04:27:44 Z vjudge1 K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define fi first
#define se second

int n, m, x;
int a[1001], dp[1001][1001];

int main() {
	fastio;
	cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
	for (int i = 0; i <= n; i++) {
    	for (int j = 0; j <= m; j++) {
			dp[i][j] = 1e9;
		}
	}
    dp[0][0] = 0;
    for (int i = 1; i <= n; i++) {
       for (int j = 1; j <= min(i, m); j++) {
            x = a[i];
            for (int k = i - 1; k >= 0; k--) {
            	x = max(a[k], x);
                dp[i][j] = min(dp[i][j], dp[k][j - 1]+x);
            }
        }
    }
    cout << dp[n][m] << endl;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -