oj.uz

답안 #639621

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639621 2022-09-10T18:30:40 Z luanaamorim K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 15 ms 31660 KB 
#include <iostream>
#include <queue>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#include <set>
#include <stack>
#include <bitset>
#define MAX (int) 2e3
#define ll long long
#define INF (ll)1e9
#define dbug(x) cout << #x << ' ' << x << endl

using namespace std;

ll n, m, arr[MAX], maior[MAX][MAX], memo[MAX][MAX], l, r, resp;
pair<ll, ll> dp[MAX][101];

ll f(int i, int k)
{
	if (k < 0) return INF;
	if (i > n) return (k?INF:0);
	if (~memo[i][k]) return memo[i][k];
	ll resp = INF;
	for (int j = i; j <= n; j++)
		resp = min(resp, f(j+1, k-1) + maior[i][j]);

	return memo[i][k] = resp;
}

void dct(int i, int j, int l, int r, int k)
{
	if (i > j) return;
	int mid = (i+j)>>1;
	//calcular dp[mid] para um k, no range [i..j]
	dp[mid][k] = {INF, mid};
	for (int idx = max(mid, l); idx <= r; idx++)
		dp[mid][k] = min(dp[mid][k], {dp[idx+1][k-1].first + maior[mid][idx], idx});

	int optmid = dp[mid][k].second;
	// if (k==5) dbug(optmid);
	dct(mid+1, j, optmid, r, k);
	dct(i, mid-1, l, optmid, k); 
}

int main()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		cin >> arr[i];
		resp = max(resp, arr[i]);
	}

	for (int i = 1; i <= n; i++)
		for (int j = i; j <= n; j++)
			maior[i][j] = max(arr[j], maior[i][j-1]);
 

	for (int i = 0; i <= n+1; i++)
		for (int j = 0; j <= m; j++)
			dp[i][j] = {INF, -1};
 
	dp[n+1][0] = {0, 0};
 
	// for (int i = n; i >= 1; i--)
	// {
	// 	for (int k = 1; k <= m; k++)
	// 	{
	// 		for (int j = i; j <= n; j++)
	// 			dp[i][k] = min(dp[i][k], dp[j+1][k-1] + maior[i][j]);
	// 	}
	// }

	for (int i = 1; i <= m; i++)
	{
		dct(1, n, 0, n, i);
		// for (int j = 1; j <= n; j++)
		// 	cout << dp[j][i].first << ' ';
		// cout << endl;
	}

	memset(memo, -1, sizeof memo);
	cout << dp[1][m].first  << endl;


}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 31512 KB Output is correct
2 Correct 13 ms 31588 KB Output is correct
3 Correct 12 ms 31596 KB Output is correct
4 Correct 13 ms 31572 KB Output is correct
5 Correct 12 ms 31572 KB Output is correct
6 Correct 15 ms 31572 KB Output is correct
7 Correct 15 ms 31660 KB Output is correct
8 Incorrect 14 ms 31636 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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