oj.uz

Submission #309962

# Submission time Handle Problem Language Result Execution time Memory
309962 2020-10-05T04:58:07 Z xyzyzl Global Warming (CEOI18_glo) C++14
100 / 100
 213 ms 7160 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;

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

int main()
{
	cin >> n >> x;
	for (int i = 0; i < n; i++)
		cin >> v[i];
	vector<ll> lis(n);
	fill(lis.begin(), lis.end(), INT_MAX);
	ll 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]);
	}
	fill(lis.begin(), lis.end(), INT_MAX);
	// longest decreasing subsequence ending at i = 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); // minus one because i would be included twice
	}
	cout << k << endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 7032 KB Output is correct
2 Correct 213 ms 6904 KB Output is correct
3 Correct 211 ms 7032 KB Output is correct
4 Correct 210 ms 7160 KB Output is correct
5 Correct 144 ms 6264 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 2040 KB Output is correct
2 Correct 54 ms 2168 KB Output is correct
3 Correct 51 ms 2044 KB Output is correct
4 Correct 37 ms 2040 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 35 ms 1788 KB Output is correct
7 Correct 50 ms 2040 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 3712 KB Output is correct
2 Correct 106 ms 3704 KB Output is correct
3 Correct 203 ms 6872 KB Output is correct
4 Correct 145 ms 6136 KB Output is correct
5 Correct 76 ms 3192 KB Output is correct
6 Correct 138 ms 6008 KB Output is correct
7 Correct 186 ms 6640 KB Output is correct
8 Correct 101 ms 3848 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 211 ms 7032 KB Output is correct
28 Correct 213 ms 6904 KB Output is correct
29 Correct 211 ms 7032 KB Output is correct
30 Correct 210 ms 7160 KB Output is correct
31 Correct 144 ms 6264 KB Output is correct
32 Correct 51 ms 2040 KB Output is correct
33 Correct 54 ms 2168 KB Output is correct
34 Correct 51 ms 2044 KB Output is correct
35 Correct 37 ms 2040 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 35 ms 1788 KB Output is correct
38 Correct 50 ms 2040 KB Output is correct
39 Correct 102 ms 3712 KB Output is correct
40 Correct 106 ms 3704 KB Output is correct
41 Correct 203 ms 6872 KB Output is correct
42 Correct 145 ms 6136 KB Output is correct
43 Correct 76 ms 3192 KB Output is correct
44 Correct 138 ms 6008 KB Output is correct
45 Correct 186 ms 6640 KB Output is correct
46 Correct 101 ms 3848 KB Output is correct
47 Correct 104 ms 3700 KB Output is correct
48 Correct 103 ms 3580 KB Output is correct
49 Correct 210 ms 6904 KB Output is correct
50 Correct 150 ms 6264 KB Output is correct
51 Correct 109 ms 4728 KB Output is correct
52 Correct 150 ms 6392 KB Output is correct
53 Correct 150 ms 6264 KB Output is correct
54 Correct 207 ms 7032 KB Output is correct
55 Correct 202 ms 7032 KB Output is correct