Submission #385799

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
385799	2021-04-05T01:03:26 Z	SansPapyrus683	Global Warming (CEOI18_glo)	C++17	100 / 100	130 ms	3308 KB

#include <bits/stdc++.h>

using namespace std;

int n, x, v[200005], dp[200005];

int main()
{
	cin >> n >> x;
	for (int i = 0; i < n; i++)
		cin >> v[i];
	vector<int> lis(n, INT_MAX);
	int k = 0;
	// longest increasing subsequence ending at i
	for(int i = 0; i < n; i++)
	{
		int j = lower_bound(lis.begin(), lis.end(), v[i])-lis.begin();
		lis[j] = v[i];
		dp[i] = j+1;
		k = max(k, dp[i]);
	}
	lis.assign(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 j = lower_bound(lis.begin(), lis.end(), -v[i]+x)-lis.begin();
		int jj = lower_bound(lis.begin(), lis.end(), -v[i])-lis.begin();
		lis[jj] = -v[i];
		k = max(k, dp[i]+j);
	}
	cout << k << endl;
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 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	384 KB	Output is correct
7	Correct	1 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	2 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	384 KB	Output is correct
7	Correct	1 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	364 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	2 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	384 KB	Output is correct
7	Correct	1 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	364 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	2 ms	364 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	128 ms	3180 KB	Output is correct
2	Correct	130 ms	3180 KB	Output is correct
3	Correct	126 ms	3180 KB	Output is correct
4	Correct	125 ms	3180 KB	Output is correct
5	Correct	89 ms	3308 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	30 ms	1388 KB	Output is correct
2	Correct	30 ms	1388 KB	Output is correct
3	Correct	31 ms	1388 KB	Output is correct
4	Correct	26 ms	1260 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	23 ms	1132 KB	Output is correct
7	Correct	35 ms	1388 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	62 ms	2028 KB	Output is correct
2	Correct	63 ms	2028 KB	Output is correct
3	Correct	121 ms	3180 KB	Output is correct
4	Correct	96 ms	3160 KB	Output is correct
5	Correct	46 ms	2028 KB	Output is correct
6	Correct	84 ms	3180 KB	Output is correct
7	Correct	110 ms	3052 KB	Output is correct
8	Correct	55 ms	2028 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 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	384 KB	Output is correct
7	Correct	1 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	364 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	2 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	128 ms	3180 KB	Output is correct
28	Correct	130 ms	3180 KB	Output is correct
29	Correct	126 ms	3180 KB	Output is correct
30	Correct	125 ms	3180 KB	Output is correct
31	Correct	89 ms	3308 KB	Output is correct
32	Correct	30 ms	1388 KB	Output is correct
33	Correct	30 ms	1388 KB	Output is correct
34	Correct	31 ms	1388 KB	Output is correct
35	Correct	26 ms	1260 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	23 ms	1132 KB	Output is correct
38	Correct	35 ms	1388 KB	Output is correct
39	Correct	62 ms	2028 KB	Output is correct
40	Correct	63 ms	2028 KB	Output is correct
41	Correct	121 ms	3180 KB	Output is correct
42	Correct	96 ms	3160 KB	Output is correct
43	Correct	46 ms	2028 KB	Output is correct
44	Correct	84 ms	3180 KB	Output is correct
45	Correct	110 ms	3052 KB	Output is correct
46	Correct	55 ms	2028 KB	Output is correct
47	Correct	61 ms	1984 KB	Output is correct
48	Correct	64 ms	2028 KB	Output is correct
49	Correct	124 ms	3232 KB	Output is correct
50	Correct	91 ms	3180 KB	Output is correct
51	Correct	71 ms	2540 KB	Output is correct
52	Correct	97 ms	3240 KB	Output is correct
53	Correct	92 ms	3180 KB	Output is correct
54	Correct	109 ms	3180 KB	Output is correct
55	Correct	114 ms	3180 KB	Output is correct

Submission #385799

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