oj.uz

Submission #713785

# Submission time Handle Problem Language Result Execution time Memory
713785 2023-03-23T03:55:53 Z Hydrolyzed Global Warming (CEOI18_glo) C++14
100 / 100
 51 ms 5320 KB 
/*
 * AUTHOR	: Hydrolyzed~
 * SCHOOL	: RYW
 * TASK		: Global Warming 
 * ALGO		: Dynamic Programming
 * DATE		: 23 Mar 2023
 * */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#ifndef _DEBUG
// @==== Libary ====@ //

// @================@ //
#endif

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update> ;

// @=== Debugger ===@ //
#ifdef _DEBUG
#include "debug.hpp"
#else
#define dbg(...) 0
#endif
// @================@ //

using ll = long long;

const int MxN = 200020;
int lis[MxN], lds[MxN], lds_size[MxN], lis_size[MxN], a[MxN];

inline void solution(){
	int n, x;
	cin >> n >> x;
	for(int i=1; i<=n; ++i){
		cin >> a[i];
	}
	int sz = 0;
	for(int i=n; i>=1; --i){
		int idx = lower_bound(lds, lds + sz, -a[i]) - lds;
		if(idx == sz){
			sz++;
		}
		lds[idx] = -a[i];
		lds_size[i] = idx + 1;
	}
	sz = 0;
	int res = 0;
	for(int i=1; i<=n; ++i){
		int idx = lower_bound(lis, lis + sz, a[i] + x) - lis;
		res = max(res, lds_size[i] + idx);
		idx = lower_bound(lis, lis + sz, a[i]) - lis;
		if(idx == sz){
			sz++;
		}
		lis[idx] = a[i];
		lis_size[i] = sz;
	}
	cout << max(res, lis_size[n]);
	return ;
}

signed main(){
	cin.tie(nullptr)->ios::sync_with_stdio(false);	
	int q = 1;
//	cin >> q;
	while(q--){
		solution();
		cout << "\n";
	}
	return 0;
}
// https://github.com/MasterIceZ/archive/tree/main/cpp-template

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 2632 KB Output is correct
2 Correct 48 ms 2568 KB Output is correct
3 Correct 49 ms 2568 KB Output is correct
4 Correct 49 ms 2600 KB Output is correct
5 Correct 26 ms 3344 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 852 KB Output is correct
2 Correct 11 ms 940 KB Output is correct
3 Correct 12 ms 852 KB Output is correct
4 Correct 7 ms 1108 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 1340 KB Output is correct
7 Correct 10 ms 1364 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1460 KB Output is correct
2 Correct 21 ms 2428 KB Output is correct
3 Correct 43 ms 4484 KB Output is correct
4 Correct 27 ms 4604 KB Output is correct
5 Correct 15 ms 2400 KB Output is correct
6 Correct 24 ms 4468 KB Output is correct
7 Correct 27 ms 5092 KB Output is correct
8 Correct 18 ms 2372 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 51 ms 2632 KB Output is correct
28 Correct 48 ms 2568 KB Output is correct
29 Correct 49 ms 2568 KB Output is correct
30 Correct 49 ms 2600 KB Output is correct
31 Correct 26 ms 3344 KB Output is correct
32 Correct 11 ms 852 KB Output is correct
33 Correct 11 ms 940 KB Output is correct
34 Correct 12 ms 852 KB Output is correct
35 Correct 7 ms 1108 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 7 ms 1340 KB Output is correct
38 Correct 10 ms 1364 KB Output is correct
39 Correct 20 ms 1460 KB Output is correct
40 Correct 21 ms 2428 KB Output is correct
41 Correct 43 ms 4484 KB Output is correct
42 Correct 27 ms 4604 KB Output is correct
43 Correct 15 ms 2400 KB Output is correct
44 Correct 24 ms 4468 KB Output is correct
45 Correct 27 ms 5092 KB Output is correct
46 Correct 18 ms 2372 KB Output is correct
47 Correct 24 ms 2380 KB Output is correct
48 Correct 28 ms 2464 KB Output is correct
49 Correct 50 ms 4492 KB Output is correct
50 Correct 27 ms 4540 KB Output is correct
51 Correct 24 ms 3636 KB Output is correct
52 Correct 28 ms 4684 KB Output is correct
53 Correct 28 ms 4628 KB Output is correct
54 Correct 29 ms 5320 KB Output is correct
55 Correct 40 ms 4528 KB Output is correct