oj.uz

Submission #91308

# Submission time Handle Problem Language Result Execution time Memory
91308 2018-12-27T04:53:55 Z Just_Solve_The_Problem K blocks (IZhO14_blocks) C++11
0 / 100
 182 ms 4804 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = (int)1e5 + 7;
const int inf = (int)1e9 + 7;

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

struct sparse {
	int table[19][N];
	int numlog[N];
	void build() {
		for (int i = 2; i < N; i++) {
			numlog[i] = numlog[i / 2] + 1;
		}
		for (int i = 0; i <= 17; i++) {
			for (int j = 1; j <= n; j++) {
				if (!i) {
					table[i][j] = a[j];
				} else {
					table[i][j] = max(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);
				}
			}
		}
	}
	int getmax(int l, int r) {
		int lg = numlog[r - l + 1];
		return max(table[lg][l], table[lg][r - (1 << lg) + 1]);
	}
};
sparse table;

void div(int id, int l, int r, int optl, int optr) {
	if (l > r) return ;
	int mid = (l + r) >> 1;
	int &res = dp[id][mid];
	res = inf;
	int opt = optl;
	for (int i = optl; i <= min(mid, optr); i++) {
		int cost = table.getmax(i, mid);
		if (dp[id ^ 1][i - 1] + cost < res) {
			res = dp[id ^ 1][i - 1] + cost;
			opt = i;
		}
	}
	div(id, l, mid - 1, optl, opt);
	div(id, mid + 1, r, opt, optr);
}

main() {
	scanf("%d %d", &n, &k);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	table.build();
	for (int i = 1; i <= n; i++) {
		dp[1][i] = max(dp[1][i - 1], a[i]);
	}
	for (int i = 2; i <= k; i++) {
		div(i & 1, 1, n, i, n);
	}
	cout << dp[k & 1][n];
}

Compilation message

blocks.cpp:53:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
blocks.cpp: In function 'int main()':
blocks.cpp:54:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~
blocks.cpp:56:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 888 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 2 ms 940 KB Output is correct
4 Correct 2 ms 968 KB Output is correct
5 Correct 14 ms 1004 KB Output is correct
6 Correct 2 ms 1004 KB Output is correct
7 Correct 2 ms 1004 KB Output is correct
8 Correct 2 ms 1044 KB Output is correct
9 Correct 2 ms 1044 KB Output is correct
10 Correct 2 ms 1044 KB Output is correct
11 Incorrect 2 ms 1044 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1044 KB Output is correct
2 Correct 2 ms 1044 KB Output is correct
3 Correct 2 ms 1044 KB Output is correct
4 Correct 2 ms 1044 KB Output is correct
5 Correct 2 ms 1044 KB Output is correct
6 Correct 2 ms 1044 KB Output is correct
7 Correct 2 ms 1052 KB Output is correct
8 Correct 2 ms 1076 KB Output is correct
9 Correct 2 ms 1076 KB Output is correct
10 Correct 2 ms 1076 KB Output is correct
11 Incorrect 2 ms 1076 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1892 KB Output is correct
2 Correct 10 ms 4448 KB Output is correct
3 Correct 23 ms 4704 KB Output is correct
4 Incorrect 182 ms 4804 KB Output isn't correct
5 Halted 0 ms 0 KB -