답안 #342706

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
342706	2021-01-02T16:29:32 Z	maskoff	K개의 묶음 (IZhO14_blocks)	C++17	53 / 100	1000 ms	5504 KB

blocks

#include <bits/stdc++.h>
 
#define file ""
 
#define all(x) x.begin(), x.end()
 
#define sc second
#define fr first
 
#define pb push_back
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
 
const ll inf = 1e18 + 5;
const ll mod = 1e9 + 7;
 
const int N = 1e5 + 5;
 
int dx[] = {+1, 0, -1, 0};
int dy[] = {0, +1, 0, -1};
 
struct line {
	int tag;
	ll ans;
	int mx;
	ll dp;
}	t[N * 4];
 
int a[N], l[N], n, k;
ll dp[N]; 
 
void push(int u, int l, int r) {
 	if (l == r || t[u].tag == -1) return;
 	
 	t[u + u].mx = max(t[u].tag, t[u + u].mx);
 	t[u + u + 1].mx = max(t[u].tag, t[u + u + 1].mx);
 
 	t[u + u].ans = t[u + u].mx + t[u + u].dp;
 	t[u + u + 1].ans = t[u + u + 1].mx + t[u + u + 1].dp;
 
 	t[u + u].tag = max(t[u + u].tag, t[u].tag);
 	t[u + u + 1].tag = max(t[u + u + 1].tag, t[u].tag);

 	t[u].tag = -1;
}
 
void update_mx(int u, int ul, int ur, int l, int r, int val) {
	push(u, ul, ur);
	if (l > ur || ul > r) return;
	if (l <= ul && ur <= r) {
	 	t[u].mx = max(t[u].mx, val);
	 	t[u].ans = t[u].mx + t[u].dp;
	 	t[u].tag = max(t[u].tag, val);
	 	return;
 	}
 	int um = ul + ur >> 1;
 	update_mx(u + u, ul, um, l, r, val);
 	update_mx(u + u + 1, um + 1, ur, l, r, val);
 	t[u].ans = min(t[u + u].ans, t[u + u + 1].ans); 
}
 
void build(int u, int l, int r) {
 	t[u].tag = -1, t[u].ans = 1e18, t[u].mx = 0;
 	if (l == r) {
 		t[u].dp = dp[l - 1]; 
 		t[u].ans = dp[l - 1];
 		return;
 	}
 	int m = l + r >> 1;
 	build(u + u, l, m);
 	build(u + u + 1, m + 1, r);
 	t[u].ans = min(t[u + u].ans, t[u + u + 1].ans);
 	t[u].dp = min(t[u + u].dp, t[u + u + 1].dp);   
}
 
ll get(int u, int ul, int ur, int l, int r) {
	push(u, ul, ur);
 	if (l > ur || ul > r) return 1e18 * 1ll;
 	if (l <= ul && ur <= r) return t[u].ans;
 	int um = ul + ur >> 1ll;
 	return min(get(u + u, ul, um, l, r), get(u + u + 1, um + 1, ur, l, r));
}
 
int main() {

	ios_base :: sync_with_stdio(false);               
	cin.tie(nullptr);
	srand(time(nullptr));
	cin >> n >> k;
	a[0] = 1e9;
	for (int i = 1; i <= n; i++) cin >> a[i];
	int mx = 0;
	for (int i = 1; i <= n; i++) mx = max(mx, a[i]), dp[i] = mx;
	stack<int> s;
	s.push(0);
	for (int i = 1; i <= n; i++) {
	 	while (a[s.top()] <= a[i]) s.pop();
	 	l[i] = s.top() + 1;
	 	s.push(i);
	}
	build(1, 1, n);
	for (int block = 2; block <= k; block++) {
	 	for (int i = block; i <= n; i++) {
	 	 	update_mx(1, 1, n, l[i], i, a[i]);
	 	 	dp[i] = get(1, 1, n, block, i);
	 	}
	 	build(1, 1, n);
	}
	cout << dp[n];
  return 0;
}

Compilation message

blocks.cpp: In function 'void update_mx(int, int, int, int, int, int)':
blocks.cpp:60:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   60 |   int um = ul + ur >> 1;
      |            ~~~^~~~
blocks.cpp: In function 'void build(int, int, int)':
blocks.cpp:73:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   73 |   int m = l + r >> 1;
      |           ~~^~~
blocks.cpp: In function 'll get(int, int, int, int, int)':
blocks.cpp:84:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   84 |   int um = ul + ur >> 1ll;
      |            ~~~^~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	2 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	3 ms	364 KB	Output is correct
40	Correct	1 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	1 ms	364 KB	Output is correct
45	Correct	1 ms	364 KB	Output is correct
46	Correct	2 ms	364 KB	Output is correct
47	Correct	1 ms	364 KB	Output is correct
48	Correct	1 ms	364 KB	Output is correct
49	Correct	1 ms	364 KB	Output is correct
50	Correct	1 ms	364 KB	Output is correct
51	Correct	1 ms	364 KB	Output is correct
52	Correct	1 ms	364 KB	Output is correct
53	Correct	2 ms	364 KB	Output is correct
54	Correct	2 ms	364 KB	Output is correct
55	Correct	2 ms	364 KB	Output is correct
56	Correct	4 ms	364 KB	Output is correct
57	Correct	4 ms	364 KB	Output is correct
58	Correct	162 ms	1516 KB	Output is correct
59	Correct	11 ms	5484 KB	Output is correct
60	Correct	220 ms	5484 KB	Output is correct
61	Execution timed out	1076 ms	5504 KB	Time limit exceeded
62	Halted	0 ms	0 KB	-

답안 #342706

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 18.0 / 18.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 47.0

Subtask #1
14.0 / 14.0

Subtask #2
18.0 / 18.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 47.0