oj.uz

Submission #397075

# Submission time Handle Problem Language Result Execution time Memory
397075 2021-05-01T09:44:14 Z huukhang Global Warming (CEOI18_glo) C++11
100 / 100
 76 ms 3156 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;
		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);
		if (pmx[i] + idx - 1 == 5) {
	//		cout << "i : " << i << "\n";
	//		cout << "pmx : " << pmx[i] << "\n";
	//		cout << "idx : " << idx << "\n\n";
		}

		idx = lower_bound(dp + 1, dp + n + 1, -a[i]) - dp;
		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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 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 332 KB Output is correct
11 Correct 1 ms 332 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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 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 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 320 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 332 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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 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 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 320 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 332 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 348 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 336 KB Output is correct
23 Correct 1 ms 328 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 64 ms 3108 KB Output is correct
2 Correct 67 ms 3020 KB Output is correct
3 Correct 64 ms 2964 KB Output is correct
4 Correct 76 ms 2980 KB Output is correct
5 Correct 51 ms 2952 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1304 KB Output is correct
2 Correct 15 ms 1340 KB Output is correct
3 Correct 15 ms 1356 KB Output is correct
4 Correct 13 ms 1156 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 13 ms 1200 KB Output is correct
7 Correct 13 ms 1216 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 1840 KB Output is correct
2 Correct 33 ms 1840 KB Output is correct
3 Correct 69 ms 3012 KB Output is correct
4 Correct 49 ms 3092 KB Output is correct
5 Correct 25 ms 1800 KB Output is correct
6 Correct 42 ms 2928 KB Output is correct
7 Correct 47 ms 2884 KB Output is correct
8 Correct 27 ms 1860 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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 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 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 320 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 332 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 348 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 336 KB Output is correct
23 Correct 1 ms 328 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 64 ms 3108 KB Output is correct
28 Correct 67 ms 3020 KB Output is correct
29 Correct 64 ms 2964 KB Output is correct
30 Correct 76 ms 2980 KB Output is correct
31 Correct 51 ms 2952 KB Output is correct
32 Correct 16 ms 1304 KB Output is correct
33 Correct 15 ms 1340 KB Output is correct
34 Correct 15 ms 1356 KB Output is correct
35 Correct 13 ms 1156 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 13 ms 1200 KB Output is correct
38 Correct 13 ms 1216 KB Output is correct
39 Correct 29 ms 1840 KB Output is correct
40 Correct 33 ms 1840 KB Output is correct
41 Correct 69 ms 3012 KB Output is correct
42 Correct 49 ms 3092 KB Output is correct
43 Correct 25 ms 1800 KB Output is correct
44 Correct 42 ms 2928 KB Output is correct
45 Correct 47 ms 2884 KB Output is correct
46 Correct 27 ms 1860 KB Output is correct
47 Correct 37 ms 1856 KB Output is correct
48 Correct 32 ms 1868 KB Output is correct
49 Correct 64 ms 3016 KB Output is correct
50 Correct 50 ms 2948 KB Output is correct
51 Correct 38 ms 2456 KB Output is correct
52 Correct 50 ms 2908 KB Output is correct
53 Correct 44 ms 3036 KB Output is correct
54 Correct 51 ms 3096 KB Output is correct
55 Correct 55 ms 3156 KB Output is correct