Submission #565118

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
565118	2022-05-20T10:03:41 Z	acatmeowmeow	Rabbit Carrot (LMIO19_triusis)	C++11	100 / 100	369 ms	24172 KB

triusis

#include <bits/stdc++.h>

using namespace std;

#define int long long 

void update(vector<int>&tree, int v, int tl, int tr, int k, int x) {
	if (tl == tr) tree[v] = max(tree[v], x);
	else {
		int tm = (tl + tr)/2;
		if (k <= tm) update(tree, v*2, tl, tm, k, x);
		else update(tree, v*2 + 1, tm + 1, tr, k, x);
		tree[v] = max(tree[v*2], tree[v*2 + 1]);
	}
}

int query(vector<int>&tree, int v, int tl, int tr, int l, int r) {
	if (l > r) return -1e18;
	else if(tl == l && tr == r) return tree[v];
	else {
		int tm = (tl + tr)/2;
		return max(query(tree, v*2, tl, tm, l, min(tm, r)), query(tree, v*2 + 1, tm + 1, tr, max(tm + 1, l), r));
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m;
	cin >> n >> m;
	vector<int> diff(n + 5);
	map<int, int> mp = {{0, 1}};
	for (int i = 1; i <= n; i++) {
		int h;
		cin >> h;
		diff[i] = h - m*i;
		mp[diff[i]]++;
	}
	int cnt = 0;
	for (auto&v : mp) v.second = cnt++;
	vector<int> dp(n + 5, -1e18), tree(4 * n + 5, -1e18);
	diff[0] = mp[diff[0]];
	dp[0] = 0;
	update(tree, 1, 0, n, diff[0], dp[0]);
	for (int i = 1; i <= n; i++) {
		diff[i] = mp[diff[i]];
		dp[i] = 1 + query(tree, 1, 0, n, diff[i], n);
		update(tree, 1, 0, n, diff[i], dp[i]);
	}
	cout << n - *max_element(dp.begin(), dp.begin() + n + 1) << '\n';
	return 0;
}

Subtask #1
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 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	1 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	212 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 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	1 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	212 KB	Output is correct
10	Correct	1 ms	320 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	316 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	3 ms	724 KB	Output is correct
21	Correct	3 ms	852 KB	Output is correct
22	Correct	4 ms	724 KB	Output is correct
23	Correct	5 ms	852 KB	Output is correct
24	Correct	3 ms	852 KB	Output is correct
25	Correct	3 ms	852 KB	Output is correct
26	Correct	3 ms	852 KB	Output is correct
27	Correct	2 ms	468 KB	Output is correct
28	Correct	2 ms	596 KB	Output is correct
29	Correct	5 ms	852 KB	Output is correct
30	Correct	3 ms	852 KB	Output is correct
31	Correct	3 ms	716 KB	Output is correct
32	Correct	4 ms	844 KB	Output is correct
33	Correct	4 ms	852 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	3 ms	724 KB	Output is correct
5	Correct	3 ms	852 KB	Output is correct
6	Correct	4 ms	724 KB	Output is correct
7	Correct	5 ms	852 KB	Output is correct
8	Correct	3 ms	852 KB	Output is correct
9	Correct	3 ms	852 KB	Output is correct
10	Correct	3 ms	852 KB	Output is correct
11	Correct	2 ms	468 KB	Output is correct
12	Correct	2 ms	596 KB	Output is correct
13	Correct	5 ms	852 KB	Output is correct
14	Correct	3 ms	852 KB	Output is correct
15	Correct	3 ms	716 KB	Output is correct
16	Correct	4 ms	844 KB	Output is correct
17	Correct	4 ms	852 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 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	320 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	316 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	5 ms	852 KB	Output is correct
35	Correct	5 ms	852 KB	Output is correct
36	Correct	4 ms	840 KB	Output is correct
37	Correct	4 ms	872 KB	Output is correct
38	Correct	3 ms	532 KB	Output is correct
39	Correct	2 ms	528 KB	Output is correct
40	Correct	3 ms	720 KB	Output is correct
41	Correct	2 ms	588 KB	Output is correct
42	Correct	4 ms	852 KB	Output is correct
43	Correct	3 ms	852 KB	Output is correct

Subtask #4
37.0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	852 KB	Output is correct
2	Correct	5 ms	852 KB	Output is correct
3	Correct	4 ms	840 KB	Output is correct
4	Correct	4 ms	872 KB	Output is correct
5	Correct	3 ms	532 KB	Output is correct
6	Correct	2 ms	528 KB	Output is correct
7	Correct	3 ms	720 KB	Output is correct
8	Correct	2 ms	588 KB	Output is correct
9	Correct	4 ms	852 KB	Output is correct
10	Correct	3 ms	852 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	316 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	3 ms	724 KB	Output is correct
15	Correct	3 ms	852 KB	Output is correct
16	Correct	4 ms	724 KB	Output is correct
17	Correct	5 ms	852 KB	Output is correct
18	Correct	3 ms	852 KB	Output is correct
19	Correct	3 ms	852 KB	Output is correct
20	Correct	3 ms	852 KB	Output is correct
21	Correct	2 ms	468 KB	Output is correct
22	Correct	2 ms	596 KB	Output is correct
23	Correct	5 ms	852 KB	Output is correct
24	Correct	3 ms	852 KB	Output is correct
25	Correct	3 ms	716 KB	Output is correct
26	Correct	4 ms	844 KB	Output is correct
27	Correct	4 ms	852 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	320 KB	Output is correct
38	Correct	1 ms	212 KB	Output is correct
39	Correct	1 ms	212 KB	Output is correct
40	Correct	1 ms	212 KB	Output is correct
41	Correct	1 ms	316 KB	Output is correct
42	Correct	1 ms	212 KB	Output is correct
43	Correct	1 ms	212 KB	Output is correct
44	Correct	135 ms	22604 KB	Output is correct
45	Correct	344 ms	24168 KB	Output is correct
46	Correct	369 ms	24172 KB	Output is correct
47	Correct	327 ms	24160 KB	Output is correct
48	Correct	124 ms	22864 KB	Output is correct
49	Correct	122 ms	23332 KB	Output is correct
50	Correct	70 ms	11592 KB	Output is correct
51	Correct	75 ms	11640 KB	Output is correct
52	Correct	116 ms	16856 KB	Output is correct
53	Correct	95 ms	10968 KB	Output is correct
54	Correct	133 ms	23188 KB	Output is correct
55	Correct	132 ms	23092 KB	Output is correct

Submission #565118

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 21.0 / 21.0

Subtask #3 28.0 / 28.0

Subtask #4 37.0 / 37.0

Subtask #1
14.0 / 14.0

Subtask #2
21.0 / 21.0

Subtask #3
28.0 / 28.0

Subtask #4
37.0 / 37.0