oj.uz

Submission #682019

# Submission time Handle Problem Language Result Execution time Memory
682019 2023-01-15T09:05:58 Z acm K blocks (IZhO14_blocks) C++14
0 / 100
 3 ms 4256 KB 
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
 
#include<bits/stdc++.h>
 
#define ld long double
#define sz(v) (int)v.size()
#define ll long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define nl "\n"
 
using namespace std;
using pii = pair<int, int>;
 
const int N = (int)1e6 + 7; // make sure this is right
const int M = (int)1e6 + 7;
const int inf = (int)4e9 + 7;
const ll INF = (ll)3e18 + 7; 
const ll MOD = (ll)998244353; // make sure this is right
 
bool bit(int x, int i) {
	return x >> i & 1;
}
 
int sum(int x, int y) {
	x += y;
	if(x >= MOD) x -= MOD;
	return x;
}
 
pii dir[] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
 
int n, k, a[N];
int lo[N], mx[20][N];
ll dp[101][101];
 
int get(int l, int r) {
	int x = lo[r - l + 1];
	return max(mx[x][l], mx[x][r - (1 << x) + 1]);
}
 
void solve() {
	cin >> n >> k;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
		mx[i][0] = a[i];
		dp[i][0] = INF;
	}
	for(int i = 1; i <= k; ++i) dp[0][i] = INF;
	for(int i = 1; i < 20; ++i) {
		for(int j = 1; j <= n - (1 << i) + 1; ++j) {
			mx[i][j] = max(mx[i - 1][j], mx[i - 1][j + (1 << (i - 1))]);
		}
	}
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= k; ++j) {
			dp[i][j] = INF;
			for(int l = i; l >= 1; --l) {
				dp[i][j] = min(dp[i][j], dp[l - 1][j - 1] + get(l, i));
			}
		}
	}	
	
	cout << dp[n][k];
}
 
signed main() {	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	for(int i = 2; i <= 1e6; ++i) lo[i] = lo[i / 2] + 1;
	int test = 1;
	//cin >> test;
	for(int i = 1; i <= test; ++i) {
	 	//cout << "Case #" << i << ": ";
		solve();
	}
	return 0;
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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