Submission #943617

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
943617	2024-03-11T16:47:05 Z	Minbaev	Global Warming (CEOI18_glo)	C++17	100 / 100	52 ms	7320 KB

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pii pair<int,int>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define int long long
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int N = 1e6 + 5	;
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;

int n,m,k;

void solve(){
	
	cin >> n >> m;
	
	vector<int>a(n + 1);
	
	for(int i = 0;i<n;i++){
		cin >> a[i];
	}
	
	vector<int>dp(n + 1),v(n + 1,-inf);
	
	for(int i = n - 1;i>=0;i--){
		int it = upper_bound(all(v),a[i]) - v.begin() - 1;
		v[it] = a[i];
		if(i > 0){
			dp[i - 1] = v.end() - upper_bound(all(v), a[i - 1] - m);
		}
	}
	
	int ans = v.end() - upper_bound(all(v), -inf + 1);
	
	for(int i = 0;i<n;i++){
		v[i] = inf;
	}
	
	for(int i = 0;i<n - 1;i++){
		int it = lower_bound(all(v), a[i]) - v.begin();
		v[it] = a[i];
		umax(ans, dp[i] + it + 1);
	}
	
	cout<< ans <<"\n";
	
}

signed main()
{
	
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();

}

Subtask #1
5.0 / 5.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	52 ms	7072 KB	Output is correct
2	Correct	50 ms	6992 KB	Output is correct
3	Correct	50 ms	6876 KB	Output is correct
4	Correct	49 ms	7008 KB	Output is correct
5	Correct	35 ms	6232 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	2084 KB	Output is correct
2	Correct	12 ms	1884 KB	Output is correct
3	Correct	12 ms	2132 KB	Output is correct
4	Correct	9 ms	1884 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	9 ms	1924 KB	Output is correct
7	Correct	9 ms	1884 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	3676 KB	Output is correct
2	Correct	24 ms	3672 KB	Output is correct
3	Correct	44 ms	7004 KB	Output is correct
4	Correct	35 ms	6224 KB	Output is correct
5	Correct	19 ms	3164 KB	Output is correct
6	Correct	31 ms	5980 KB	Output is correct
7	Correct	33 ms	6736 KB	Output is correct
8	Correct	18 ms	3672 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	456 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	456 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	456 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	52 ms	7072 KB	Output is correct
28	Correct	50 ms	6992 KB	Output is correct
29	Correct	50 ms	6876 KB	Output is correct
30	Correct	49 ms	7008 KB	Output is correct
31	Correct	35 ms	6232 KB	Output is correct
32	Correct	12 ms	2084 KB	Output is correct
33	Correct	12 ms	1884 KB	Output is correct
34	Correct	12 ms	2132 KB	Output is correct
35	Correct	9 ms	1884 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	9 ms	1924 KB	Output is correct
38	Correct	9 ms	1884 KB	Output is correct
39	Correct	21 ms	3676 KB	Output is correct
40	Correct	24 ms	3672 KB	Output is correct
41	Correct	44 ms	7004 KB	Output is correct
42	Correct	35 ms	6224 KB	Output is correct
43	Correct	19 ms	3164 KB	Output is correct
44	Correct	31 ms	5980 KB	Output is correct
45	Correct	33 ms	6736 KB	Output is correct
46	Correct	18 ms	3672 KB	Output is correct
47	Correct	25 ms	3920 KB	Output is correct
48	Correct	24 ms	3676 KB	Output is correct
49	Correct	49 ms	6996 KB	Output is correct
50	Correct	34 ms	6120 KB	Output is correct
51	Correct	30 ms	4700 KB	Output is correct
52	Correct	37 ms	6236 KB	Output is correct
53	Correct	32 ms	6360 KB	Output is correct
54	Correct	33 ms	7004 KB	Output is correct
55	Correct	40 ms	7320 KB	Output is correct

Submission #943617

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