답안 #1013484

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1013484	2024-07-03T15:02:11 Z	Thunnus	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	59 ms	5320 KB

triusis

#include <algorithm>
#include <iostream>
#include <vector>

using std::cout;
using std::endl;
using std::vector;

int longest_nondec_subseq(const vector<int> &seq) {
	vector<int> min_endings;
	for (int i : seq) {
		/*
		 * note that we use upper_bound instead of
		 * lower_bound bc it just has to be nondecreasing
		 */
		int pos = std::upper_bound(min_endings.begin(), min_endings.end(), i) -
		          min_endings.begin();
		// standard LIS protocol
		if (pos == min_endings.size()) {
			min_endings.push_back(i);
		} else {
			min_endings[pos] = i;
		}
	}
	return min_endings.size();
}

int main() {
	int pole_num;
	int jump_height;
	std::cin >> pole_num >> jump_height;
	vector<int> poles(pole_num);
	for (int p = 0; p < pole_num; p++) { std::cin >> poles[p]; }

	vector<int> poss_unchanged;
	for (int i = 1; i <= pole_num; i++) {
		// only add if it has any hope of being unchanged
		if (i * jump_height >= poles[i - 1]) {
			poss_unchanged.push_back(i * jump_height - poles[i - 1]);
		}
	}
	cout << pole_num - longest_nondec_subseq(poss_unchanged) << endl;
}

Compilation message

triusis.cpp: In function 'int longest_nondec_subseq(const std::vector<int>&)':
triusis.cpp:19:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |   if (pos == min_endings.size()) {
      |       ~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

#	결과	메모리	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	384 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	440 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	432 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct

Subtask #2
21.0 / 21.0

#	결과	실행 시간	메모리	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	384 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	440 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	432 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	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 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	360 KB	Output is correct
22	Correct	1 ms	356 KB	Output is correct
23	Correct	1 ms	456 KB	Output is correct
24	Correct	2 ms	360 KB	Output is correct
25	Correct	1 ms	360 KB	Output is correct
26	Correct	1 ms	356 KB	Output is correct
27	Correct	1 ms	444 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	444 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	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	360 KB	Output is correct
6	Correct	1 ms	356 KB	Output is correct
7	Correct	1 ms	456 KB	Output is correct
8	Correct	2 ms	360 KB	Output is correct
9	Correct	1 ms	360 KB	Output is correct
10	Correct	1 ms	356 KB	Output is correct
11	Correct	1 ms	444 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	444 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	348 KB	Output is correct
17	Correct	1 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	384 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	440 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	432 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	2 ms	352 KB	Output is correct
35	Correct	2 ms	344 KB	Output is correct
36	Correct	1 ms	352 KB	Output is correct
37	Correct	2 ms	352 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	352 KB	Output is correct
40	Correct	1 ms	352 KB	Output is correct
41	Correct	1 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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	352 KB	Output is correct
2	Correct	2 ms	344 KB	Output is correct
3	Correct	1 ms	352 KB	Output is correct
4	Correct	2 ms	352 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	352 KB	Output is correct
7	Correct	1 ms	352 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	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	360 KB	Output is correct
16	Correct	1 ms	356 KB	Output is correct
17	Correct	1 ms	456 KB	Output is correct
18	Correct	2 ms	360 KB	Output is correct
19	Correct	1 ms	360 KB	Output is correct
20	Correct	1 ms	356 KB	Output is correct
21	Correct	1 ms	444 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	444 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	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	384 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	440 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	432 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	348 KB	Output is correct
44	Correct	26 ms	3888 KB	Output is correct
45	Correct	45 ms	2900 KB	Output is correct
46	Correct	59 ms	3532 KB	Output is correct
47	Correct	51 ms	3536 KB	Output is correct
48	Correct	31 ms	4292 KB	Output is correct
49	Correct	34 ms	4524 KB	Output is correct
50	Correct	49 ms	4548 KB	Output is correct
51	Correct	50 ms	5320 KB	Output is correct
52	Correct	38 ms	3628 KB	Output is correct
53	Correct	32 ms	2228 KB	Output is correct
54	Correct	41 ms	4560 KB	Output is correct
55	Correct	47 ms	4592 KB	Output is correct

답안 #1013484

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