Submission #969316

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
969316	2024-04-25T00:43:53 Z	vjudge1	Global Warming (CEOI18_glo)	C++17	100 / 100	90 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	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	0 ms	348 KB	Output is correct
5	Correct	0 ms	360 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	440 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 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	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	0 ms	348 KB	Output is correct
5	Correct	0 ms	360 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	440 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 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	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	0 ms	348 KB	Output is correct
5	Correct	0 ms	360 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	440 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 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	452 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	348 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	352 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	86 ms	5456 KB	Output is correct
2	Correct	86 ms	5280 KB	Output is correct
3	Correct	86 ms	5296 KB	Output is correct
4	Correct	88 ms	5460 KB	Output is correct
5	Correct	62 ms	4584 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	1628 KB	Output is correct
2	Correct	25 ms	1628 KB	Output is correct
3	Correct	21 ms	1608 KB	Output is correct
4	Correct	16 ms	1504 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	15 ms	1368 KB	Output is correct
7	Correct	19 ms	1612 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	40 ms	2908 KB	Output is correct
2	Correct	40 ms	2900 KB	Output is correct
3	Correct	82 ms	5324 KB	Output is correct
4	Correct	61 ms	4688 KB	Output is correct
5	Correct	31 ms	2396 KB	Output is correct
6	Correct	60 ms	4436 KB	Output is correct
7	Correct	77 ms	5208 KB	Output is correct
8	Correct	37 ms	2900 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	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	0 ms	348 KB	Output is correct
5	Correct	0 ms	360 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	440 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 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	452 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	348 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	352 KB	Output is correct
27	Correct	86 ms	5456 KB	Output is correct
28	Correct	86 ms	5280 KB	Output is correct
29	Correct	86 ms	5296 KB	Output is correct
30	Correct	88 ms	5460 KB	Output is correct
31	Correct	62 ms	4584 KB	Output is correct
32	Correct	21 ms	1628 KB	Output is correct
33	Correct	25 ms	1628 KB	Output is correct
34	Correct	21 ms	1608 KB	Output is correct
35	Correct	16 ms	1504 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	15 ms	1368 KB	Output is correct
38	Correct	19 ms	1612 KB	Output is correct
39	Correct	40 ms	2908 KB	Output is correct
40	Correct	40 ms	2900 KB	Output is correct
41	Correct	82 ms	5324 KB	Output is correct
42	Correct	61 ms	4688 KB	Output is correct
43	Correct	31 ms	2396 KB	Output is correct
44	Correct	60 ms	4436 KB	Output is correct
45	Correct	77 ms	5208 KB	Output is correct
46	Correct	37 ms	2900 KB	Output is correct
47	Correct	43 ms	2896 KB	Output is correct
48	Correct	46 ms	2832 KB	Output is correct
49	Correct	90 ms	5320 KB	Output is correct
50	Correct	61 ms	4692 KB	Output is correct
51	Correct	48 ms	3408 KB	Output is correct
52	Correct	65 ms	4772 KB	Output is correct
53	Correct	59 ms	4692 KB	Output is correct
54	Correct	76 ms	5460 KB	Output is correct
55	Correct	78 ms	5284 KB	Output is correct

Submission #969316

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