oj.uz

답안 #38984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38984 2018-01-09T02:51:36 Z RockyB K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 1000 ms 89296 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)1e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, k;
int a[N];
ll dp[111][N];

int now;

int get(int l, int r) {
	int res = a[l];
	for (int i = l + 1; i <= r; i++) {
		res = max(res, a[i]);
	}
	return res;
}
void solve(int l = 1, int r = n, int opl = 1, int opr = n) {
	int mid = l + r >> 1;
	ll res = linf;
	int good = mid;
	for (int i = opl; i <= mid; i++) {
		ll cur = dp[now - 1][i - 1] + get(i, mid);	
		if (cur <= res) {
			res = cur;
			good = i;
		}
	}
	dp[now][mid] = res;
	if (l < mid) solve(l, mid - 1, opl, good);
	if (mid < r) solve(mid + 1, r, good, opr);
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	memset(dp, 0x3f3f, sizeof(dp));
	dp[0][0] = 0;
	for (int o = 1; o <= k; o++) {
		now = o;
		solve();			
	}
	cout << dp[k][n];
	ioi
}

Compilation message

blocks.cpp: In function 'void solve(int, int, int, int)':
blocks.cpp:48:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = l + r >> 1;
              ^

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 89296 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 89296 KB Execution timed out
2 Halted 0 ms 0 KB -