Submission #397042

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
397042	2021-05-01T08:43:24 Z	huukhang	Global Warming (CEOI18_glo)	C++11	100 / 100	64 ms	4596 KB

// - Only when necessary :d
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define fileopen(a, b) freopen(((string)a + ".inp").c_str(), "r", stdin); freopen(((string)b + ".out").c_str(), "w", stdout); 

#define ll long long
// #define int long long
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
typedef pair<int, int> pii;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const ll mod = 1e9 + 7;
const ll inf = 1e9 + 7;
const double eps = 1e-9;

int n, x;
int a[200005];
int dp[200005], pmx[200005];
int ans = -inf;

void solve() {
	cin >> n >> x;
	for (int i = 1; i <= n; ++i) cin >> a[i];

	dp[0] = -inf;
	for (int i = 1; i <= n; ++i) dp[i] = inf;

	for (int i = 1; i <= n; ++i) {
		int idx = lower_bound(dp + 1, dp + n + 1, a[i]) - dp;
		if (dp[idx - 1] < a[i]) dp[idx] = a[i];

		pmx[i] = idx;
	}

	dp[0] = -inf;
	for (int i = 1; i <= n; ++i) dp[i] = inf;

	for (int i = n; i >= 1; --i) {
		int idx = lower_bound(dp + 1, dp + n + 1, -a[i] + x) - dp;
		ans = max(ans, pmx[i] + idx - 1);

		idx = lower_bound(dp + 1, dp + n + 1, -a[i]) - dp;
		if (dp[idx - 1] < -a[i] + x) dp[idx] = -a[i];
	}

	cout << ans;
}

signed main() {
	#ifdef khangorz
		fileopen("input", "output");
	#endif
	#ifndef khangorz
//		fileopen("LAH", "LAH");
	#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	solve();
	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	63 ms	2556 KB	Output is correct
2	Correct	63 ms	2544 KB	Output is correct
3	Correct	62 ms	2644 KB	Output is correct
4	Correct	64 ms	2760 KB	Output is correct
5	Correct	47 ms	2592 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	808 KB	Output is correct
2	Correct	15 ms	1404 KB	Output is correct
3	Correct	15 ms	1388 KB	Output is correct
4	Correct	12 ms	1100 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	12 ms	1140 KB	Output is correct
7	Correct	13 ms	1376 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	1428 KB	Output is correct
2	Correct	30 ms	2376 KB	Output is correct
3	Correct	58 ms	4556 KB	Output is correct
4	Correct	58 ms	3804 KB	Output is correct
5	Correct	24 ms	2088 KB	Output is correct
6	Correct	41 ms	3736 KB	Output is correct
7	Correct	44 ms	4300 KB	Output is correct
8	Correct	24 ms	2380 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	320 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	63 ms	2556 KB	Output is correct
28	Correct	63 ms	2544 KB	Output is correct
29	Correct	62 ms	2644 KB	Output is correct
30	Correct	64 ms	2760 KB	Output is correct
31	Correct	47 ms	2592 KB	Output is correct
32	Correct	16 ms	808 KB	Output is correct
33	Correct	15 ms	1404 KB	Output is correct
34	Correct	15 ms	1388 KB	Output is correct
35	Correct	12 ms	1100 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	12 ms	1140 KB	Output is correct
38	Correct	13 ms	1376 KB	Output is correct
39	Correct	28 ms	1428 KB	Output is correct
40	Correct	30 ms	2376 KB	Output is correct
41	Correct	58 ms	4556 KB	Output is correct
42	Correct	58 ms	3804 KB	Output is correct
43	Correct	24 ms	2088 KB	Output is correct
44	Correct	41 ms	3736 KB	Output is correct
45	Correct	44 ms	4300 KB	Output is correct
46	Correct	24 ms	2380 KB	Output is correct
47	Correct	35 ms	2448 KB	Output is correct
48	Correct	30 ms	2380 KB	Output is correct
49	Correct	63 ms	4552 KB	Output is correct
50	Correct	48 ms	3752 KB	Output is correct
51	Correct	37 ms	2892 KB	Output is correct
52	Correct	49 ms	3916 KB	Output is correct
53	Correct	42 ms	3872 KB	Output is correct
54	Correct	49 ms	4516 KB	Output is correct
55	Correct	53 ms	4596 KB	Output is correct

Submission #397042

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