Submission #1078333

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1078333	2024-08-27T15:26:01 Z	hahahaha	Global Warming (CEOI18_glo)	C++17	100 / 100	75 ms	5460 KB

#include <bits/stdc++.h>
using namespace std;

int temps[200005];
int pref_longest[200005];

int main() {
	int n;
	int x;
	cin >> n >> x;
	for (int i = 0; i < n; i++) { cin >> temps[i]; }

	vector<int> dp(n, INT_MAX);
	int longest = 0;
	// longest increasing subsequence ending at i
	for (int i = 0; i < n; i++) {
		int j = lower_bound(dp.begin(), dp.end(), temps[i]) - dp.begin();
		dp[j] = temps[i];
		pref_longest[i] = j + 1;
		longest = max(longest, pref_longest[i]);
	}

	dp = vector<int>(n, INT_MAX);
	// longest decreasing subsequence ending at i of reverse
	// = longest increasing subsequence starting at i
	for (int i = n - 1; i >= 0; i--) {
		int pos = lower_bound(dp.begin(), dp.end(), -temps[i] + x) - dp.begin();
		longest = max(longest, pref_longest[i] + pos);

		int insert_pos =
		    lower_bound(dp.begin(), dp.end(), -temps[i]) - dp.begin();
		dp[insert_pos] = -temps[i];
	}
	cout << longest << endl;
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 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	344 KB	Output is correct
7	Correct	1 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	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 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	344 KB	Output is correct
7	Correct	1 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	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	440 KB	Output is correct
15	Correct	1 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

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 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	344 KB	Output is correct
7	Correct	1 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	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	440 KB	Output is correct
15	Correct	1 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	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 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	1 ms	448 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	73 ms	5456 KB	Output is correct
2	Correct	72 ms	5456 KB	Output is correct
3	Correct	72 ms	5456 KB	Output is correct
4	Correct	73 ms	5460 KB	Output is correct
5	Correct	51 ms	4692 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	1624 KB	Output is correct
2	Correct	18 ms	1624 KB	Output is correct
3	Correct	18 ms	1624 KB	Output is correct
4	Correct	13 ms	1424 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	13 ms	1404 KB	Output is correct
7	Correct	17 ms	1560 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	2900 KB	Output is correct
2	Correct	36 ms	2780 KB	Output is correct
3	Correct	73 ms	5460 KB	Output is correct
4	Correct	49 ms	4688 KB	Output is correct
5	Correct	25 ms	2648 KB	Output is correct
6	Correct	47 ms	4444 KB	Output is correct
7	Correct	64 ms	5120 KB	Output is correct
8	Correct	32 ms	2900 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 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	344 KB	Output is correct
7	Correct	1 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	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	440 KB	Output is correct
15	Correct	1 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	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 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	1 ms	448 KB	Output is correct
27	Correct	73 ms	5456 KB	Output is correct
28	Correct	72 ms	5456 KB	Output is correct
29	Correct	72 ms	5456 KB	Output is correct
30	Correct	73 ms	5460 KB	Output is correct
31	Correct	51 ms	4692 KB	Output is correct
32	Correct	18 ms	1624 KB	Output is correct
33	Correct	18 ms	1624 KB	Output is correct
34	Correct	18 ms	1624 KB	Output is correct
35	Correct	13 ms	1424 KB	Output is correct
36	Correct	1 ms	604 KB	Output is correct
37	Correct	13 ms	1404 KB	Output is correct
38	Correct	17 ms	1560 KB	Output is correct
39	Correct	37 ms	2900 KB	Output is correct
40	Correct	36 ms	2780 KB	Output is correct
41	Correct	73 ms	5460 KB	Output is correct
42	Correct	49 ms	4688 KB	Output is correct
43	Correct	25 ms	2648 KB	Output is correct
44	Correct	47 ms	4444 KB	Output is correct
45	Correct	64 ms	5120 KB	Output is correct
46	Correct	32 ms	2900 KB	Output is correct
47	Correct	42 ms	2752 KB	Output is correct
48	Correct	36 ms	2896 KB	Output is correct
49	Correct	75 ms	5456 KB	Output is correct
50	Correct	53 ms	4692 KB	Output is correct
51	Correct	43 ms	3420 KB	Output is correct
52	Correct	55 ms	4688 KB	Output is correct
53	Correct	48 ms	4692 KB	Output is correct
54	Correct	65 ms	5416 KB	Output is correct
55	Correct	73 ms	5460 KB	Output is correct

Submission #1078333

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 13.0 / 13.0

Subtask #4 10.0 / 10.0

Subtask #5 20.0 / 20.0

Subtask #6 17.0 / 17.0

Subtask #7 25.0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
13.0 / 13.0

Subtask #4
10.0 / 10.0

Subtask #5
20.0 / 20.0

Subtask #6
17.0 / 17.0

Subtask #7
25.0 / 25.0