Submission #1088140

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1088140	2024-09-14T03:28:34 Z	vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	58 ms	3928 KB

triusis

#include <bits/stdc++.h>
using namespace std;
 
int main() {
	int n, m; cin >> n >> m;
	vector<int> arr(n);
	for (int i = 0; i < n; i++) {
		int v; cin >> v;
		arr[i] = v - m * (i + 1);
	}
	reverse(arr.begin(), arr.end());
	vector<int> res(n + 1, INT_MAX);
	res[0] = INT_MIN;
	for (int i = 0; i < n; i++) {
		if (arr[i] > 0) continue;
		int l = upper_bound(res.begin(), res.end(), arr[i]) - res.begin();
		res[l] = arr[i];
	}
	cout << n - (lower_bound(res.begin(), res.end(), INT_MAX) - res.begin() - 1) << endl;
}

Subtask #1
14.0 / 14.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	344 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	476 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	448 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	448 KB	Output is correct
33	Correct	2 ms	348 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	476 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	448 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	448 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	344 KB	Output is correct
34	Correct	2 ms	348 KB	Output is correct
35	Correct	2 ms	344 KB	Output is correct
36	Correct	2 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	2 ms	348 KB	Output is correct
39	Correct	2 ms	496 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	2 ms	348 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct

Subtask #4
37.0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	2 ms	344 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	2 ms	348 KB	Output is correct
6	Correct	2 ms	496 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	476 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	448 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	448 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	344 KB	Output is correct
44	Correct	26 ms	2392 KB	Output is correct
45	Correct	51 ms	3924 KB	Output is correct
46	Correct	53 ms	3892 KB	Output is correct
47	Correct	56 ms	3928 KB	Output is correct
48	Correct	40 ms	2900 KB	Output is correct
49	Correct	39 ms	3000 KB	Output is correct
50	Correct	57 ms	3884 KB	Output is correct
51	Correct	58 ms	3916 KB	Output is correct
52	Correct	34 ms	2868 KB	Output is correct
53	Correct	39 ms	3240 KB	Output is correct
54	Correct	39 ms	2900 KB	Output is correct
55	Correct	37 ms	2896 KB	Output is correct

Submission #1088140

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