Submission #385803

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
385803	2021-04-05T01:09:05 Z	SansPapyrus683	Global Warming (CEOI18_glo)	C++17	100 / 100	129 ms	3564 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	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	2 ms	364 KB	Output is correct
20	Correct	2 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	2 ms	364 KB	Output is correct
23	Correct	2 ms	364 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	125 ms	3436 KB	Output is correct
2	Correct	125 ms	3436 KB	Output is correct
3	Correct	129 ms	3436 KB	Output is correct
4	Correct	125 ms	3476 KB	Output is correct
5	Correct	87 ms	3436 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	31 ms	1132 KB	Output is correct
2	Correct	32 ms	1132 KB	Output is correct
3	Correct	33 ms	1132 KB	Output is correct
4	Correct	23 ms	1132 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	22 ms	1132 KB	Output is correct
7	Correct	29 ms	1132 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	58 ms	1900 KB	Output is correct
2	Correct	58 ms	1900 KB	Output is correct
3	Correct	117 ms	3564 KB	Output is correct
4	Correct	87 ms	3440 KB	Output is correct
5	Correct	44 ms	1900 KB	Output is correct
6	Correct	84 ms	3436 KB	Output is correct
7	Correct	112 ms	3308 KB	Output is correct
8	Correct	55 ms	1900 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	2 ms	364 KB	Output is correct
20	Correct	2 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	2 ms	364 KB	Output is correct
23	Correct	2 ms	364 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	125 ms	3436 KB	Output is correct
28	Correct	125 ms	3436 KB	Output is correct
29	Correct	129 ms	3436 KB	Output is correct
30	Correct	125 ms	3476 KB	Output is correct
31	Correct	87 ms	3436 KB	Output is correct
32	Correct	31 ms	1132 KB	Output is correct
33	Correct	32 ms	1132 KB	Output is correct
34	Correct	33 ms	1132 KB	Output is correct
35	Correct	23 ms	1132 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	22 ms	1132 KB	Output is correct
38	Correct	29 ms	1132 KB	Output is correct
39	Correct	58 ms	1900 KB	Output is correct
40	Correct	58 ms	1900 KB	Output is correct
41	Correct	117 ms	3564 KB	Output is correct
42	Correct	87 ms	3440 KB	Output is correct
43	Correct	44 ms	1900 KB	Output is correct
44	Correct	84 ms	3436 KB	Output is correct
45	Correct	112 ms	3308 KB	Output is correct
46	Correct	55 ms	1900 KB	Output is correct
47	Correct	71 ms	1900 KB	Output is correct
48	Correct	62 ms	1964 KB	Output is correct
49	Correct	125 ms	3436 KB	Output is correct
50	Correct	87 ms	3436 KB	Output is correct
51	Correct	67 ms	2668 KB	Output is correct
52	Correct	94 ms	3436 KB	Output is correct
53	Correct	86 ms	3436 KB	Output is correct
54	Correct	109 ms	3492 KB	Output is correct
55	Correct	116 ms	3436 KB	Output is correct

Submission #385803

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