oj.uz

답안 #647626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647626 2022-10-03T10:26:53 Z cpLover22 K개의 묶음 (IZhO14_blocks) C++17
100 / 100
 317 ms 83824 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define fi first
#define se second 
using ll = long long;
const int N = 1e5 + 5;
int n, nk, a[N]; 
namespace sub1 {
	const int N = 1e2 + 5, oo = 1e9 + 123;
	int dp[N][N];
	void sol() {
		for (int i = 0; i <= n; ++i)
			for (int j = 0; j <= nk; ++j)
				dp[i][j] = oo;
		dp[0][0] = 0;
		for (int i = 1; i <= n; ++i)
			for (int k = 1; k <= nk; ++k) {
				for (int j = i, mx = 0; j >= 1; --j) 
					mx = max(mx, a[j]), dp[i][k] = min(dp[i][k], dp[j - 1][k - 1] + mx);
			}
		cout << dp[n][nk];	
	}
}
namespace sub2 {
	struct state {
		ll fi, tr, se;
		state() {}
		state(ll fi, ll tr, ll se) : fi(fi), tr(tr), se(se) {}
	};
	const ll oo = 1e15;
	ll dp[N][105];
	void sol() {
		for (int i = 0; i <= n; ++i)
			for (int j = 0; j <= nk; ++j)
				dp[i][j] = oo;
		dp[0][0] = 0;
		for (int k = 1; k <= nk; ++k) {
			stack<state> que;
			a[k - 1] = 1e9; que.emplace(k - 1, dp[k - 1][k - 1], oo);
			for (int i = k; i <= n; ++i) {
				ll cur = oo, cur2 = oo;
				while (a[i] >= a[que.top().fi]) {
					cur = min(cur, que.top().tr + a[i]);
					cur2 = min(cur2, que.top().tr);
					que.pop();
				}
				cur = min(cur, min(que.top().se, dp[que.top().fi][k - 1] + a[i]));
				cur2 = min(cur2, dp[i][k - 1]);
				dp[i][k] = cur; que.emplace(i, cur2, cur);
			}
		}
		cout << dp[n][nk];
	}
}
int main() {
	cin.tie(0)->sync_with_stdio(0); cout.tie(0);
	if (fopen("Kblocks.inp", "r"))
	   freopen("Kblocks.inp", "r", stdin),
	   freopen("Kblocks.out", "w", stdout);
	cin >> n >> nk;
	for (int i = 1; i <= n; ++i) cin >> a[i];
	if (n <= 1e2) sub1::sol();
	else sub2::sol();
	return 0;
}

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:59:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |     freopen("Kblocks.inp", "r", stdin),
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:60:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |     freopen("Kblocks.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 2 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 2 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 10 ms 8592 KB Output is correct
59 Correct 17 ms 36948 KB Output is correct
60 Correct 23 ms 37000 KB Output is correct
61 Correct 81 ms 37020 KB Output is correct
62 Correct 276 ms 82888 KB Output is correct
63 Correct 47 ms 82900 KB Output is correct
64 Correct 140 ms 82888 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 2 ms 376 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 1108 KB Output is correct
70 Correct 1 ms 1108 KB Output is correct
71 Correct 23 ms 8600 KB Output is correct
72 Correct 5 ms 8532 KB Output is correct
73 Correct 8 ms 8532 KB Output is correct
74 Correct 18 ms 36948 KB Output is correct
75 Correct 22 ms 36948 KB Output is correct
76 Correct 97 ms 36956 KB Output is correct
77 Correct 284 ms 82776 KB Output is correct
78 Correct 44 ms 82800 KB Output is correct
79 Correct 163 ms 82892 KB Output is correct
80 Correct 40 ms 82876 KB Output is correct
81 Correct 63 ms 82764 KB Output is correct
82 Correct 289 ms 82888 KB Output is correct
83 Correct 1 ms 1108 KB Output is correct
84 Correct 1 ms 1108 KB Output is correct
85 Correct 24 ms 8680 KB Output is correct
86 Correct 7 ms 8660 KB Output is correct
87 Correct 9 ms 8680 KB Output is correct
88 Correct 20 ms 37336 KB Output is correct
89 Correct 24 ms 37408 KB Output is correct
90 Correct 114 ms 37404 KB Output is correct
91 Correct 317 ms 83824 KB Output is correct
92 Correct 57 ms 83752 KB Output is correct
93 Correct 164 ms 83740 KB Output is correct
94 Correct 6 ms 8532 KB Output is correct
95 Correct 19 ms 8532 KB Output is correct
96 Correct 1 ms 1108 KB Output is correct
97 Correct 1 ms 1108 KB Output is correct
98 Correct 0 ms 340 KB Output is correct
99 Correct 1 ms 212 KB Output is correct