oj.uz

답안 #250413

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250413 2020-07-17T19:09:36 Z srvlt K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 147 ms 2676 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
template <typename T> using ord_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int n0 = 100003, k0 = 101;
int n, k, a[n0], dp[2][n0];

struct T {
	int x, y, mn;
	void merge(const T & t) {
		if (t.x <= x) x = t.x;
		mn = min(mn, x + y);
	}
};
stack <T> st;

int main() {
	ios_base::sync_with_stdio(false), cin.tie(NULL);
	#ifdef LOCAL
		freopen("input.txt", "r", stdin);
	#endif
	
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		dp[1][i] = max(dp[1][i - 1], a[i]);
	}
	T cur;
	for (int i = 2; i <= k; i++) {
		while (!st.empty()) st.pop();
		for (int j = i; j <= n; j++) {
			cur.x = dp[(i & 1) ^ 1][j - 1], cur.y = a[j];
			cur.mn = cur.x + cur.y;
			while (!st.empty() && st.top().y <= cur.y) {
				cur.merge(st.top());
				st.pop();
			}
			if (!st.empty()) {
				cur.mn = min(cur.mn, st.top().mn);
			}
			st.push(cur);
			dp[i & 1][j] = cur.mn;
		}
	}
	cout << dp[k & 1][n];
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 7 ms 1024 KB Output is correct
3 Correct 9 ms 1152 KB Output is correct
4 Correct 39 ms 1152 KB Output is correct
5 Correct 112 ms 2176 KB Output is correct
6 Correct 15 ms 2176 KB Output is correct
7 Correct 57 ms 2168 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 13 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 6 ms 1024 KB Output is correct
18 Correct 9 ms 1152 KB Output is correct
19 Correct 50 ms 1152 KB Output is correct
20 Correct 147 ms 2176 KB Output is correct
21 Correct 16 ms 2176 KB Output is correct
22 Correct 71 ms 2236 KB Output is correct
23 Correct 14 ms 1792 KB Output is correct
24 Correct 25 ms 2176 KB Output is correct
25 Correct 146 ms 2176 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 14 ms 640 KB Output is correct
29 Correct 2 ms 640 KB Output is correct
30 Correct 5 ms 640 KB Output is correct
31 Correct 7 ms 1024 KB Output is correct
32 Correct 12 ms 1408 KB Output is correct
33 Correct 48 ms 1408 KB Output is correct
34 Correct 144 ms 2676 KB Output is correct
35 Correct 17 ms 2616 KB Output is correct
36 Correct 73 ms 2672 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 10 ms 512 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 0 ms 384 KB Output is correct
42 Correct 0 ms 384 KB Output is correct