oj.uz

답안 #39031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39031 2018-01-09T05:56:25 Z RockyB K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 243 ms 43036 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 get_int() {
	char x = getchar();
	while (!isdigit(x)) x = getchar();
	int res = 0;
	while (isdigit(x)) res = res * 10 + x - '0', x = getchar();
	return res;
}

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

/*int get_min(int o, int l, int r) {
	int res = dp[o][l];
	for (int i = l + 1; i <= r; i++) {
		res = min(res, dp[o][i]);
	}
	return res;
}*/

int t[N << 1];
void build(int o) {
	for (int i = 0; i <= n; i++) {
		t[i + n] = dp[o][i];
	}
	for (int i = n - 1; i >= 0; i--) {
		t[i] = min(t[i << 1], t[i << 1 | 1]);
	}
}
int get_min(int l, int r) {
	int res = inf;
	for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1) {
		if (l & 1) res = min(res, t[l++]);
		if (r & 1) res = min(res, t[--r]);
	}
	return res;
}

int sz;
int c[N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	n = get_int(), k = get_int();
	for (int i = 1; i <= n; i++) 
		a[i] = get_int();
	memset(dp, 0x3f3f, sizeof(dp));
	dp[0][0] = 0;
	a[0] = inf;
	for (int o = 1; o <= k; o++) {
		multiset <int> st;
		sz = 1;
		c[sz] = 0;
		build(o - 1);
		for (int i = 1; i <= n; i++) {
			while (sz && a[i] >= a[c[sz]]) {
				st.erase(dp[o - 1][max(o - 1, c[sz - 1])] + a[c[sz]]);
				//st.erase(st.find(get_min(c[sz - 1], c[sz] - 1) + a[c[sz]]));
				--sz;
			}
			c[++sz] = i;
			st.insert(dp[o - 1][max(o - 1, c[sz - 1])] + a[c[sz]]);
			//st.insert(get_min(c[sz - 1], c[sz] - 1) + a[c[sz]]);
			dp[o][i] = *st.begin();
		}
	}
	cout << dp[k][n];
	ioi
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 43036 KB Output is correct
2 Correct 19 ms 43036 KB Output is correct
3 Correct 29 ms 43036 KB Output is correct
4 Incorrect 243 ms 43036 KB Output isn't correct
5 Halted 0 ms 0 KB -