Submission #1086229

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1086229	2024-09-09T18:21:38 Z	Newtonabc	Global Warming (CEOI18_glo)	C++14	62 / 100	72 ms	5648 KB

#include<bits/stdc++.h>
#define mp make_pair
using namespace std;
const int N=2e5+10;
int t[N];
vector<int> fv,bv;
stack<pair<int,pair<int,int> > > st;
int main(){
	int n,m;
	cin>>n >>m;
	for(int i=1;i<=n;i++) cin>>t[i];
	if(n==1){
		cout<<1;
		return 0;
	}
	bv.push_back(t[n]);
	for(int i=n-1;i>=1;i--){
		int ind;
		if(t[i]<bv.back()){
			bv.push_back(t[i]);
			st.push(mp(1,mp(0,0)));
			continue;
		}
		ind=lower_bound(bv.begin(),bv.end(),t[i],greater<int>())-bv.begin();
		st.push(mp(0,mp(ind,bv[ind])));
		bv[ind]=t[i];
	}
	int ans=bv.size();
	if(st.top().first==1) bv.pop_back();
	else bv[st.top().second.first]=st.top().second.second;
	st.pop();
	for(int i=1;i<=n-1;i++){
		int ind;
		if(fv.empty()) fv.push_back(t[i]);
		else{
			if(t[i]>fv.back()) fv.push_back(t[i]);
			else{
				ind=lower_bound(fv.begin(),fv.end(),t[i])-fv.begin();
				fv[ind]=t[i];
			}
		}
		ind=lower_bound(bv.begin(),bv.end(),fv.back()-m,greater<int>())-bv.begin();
		ans=max(ans,(int)fv.size()+ind);
		if(st.empty()) break;
		if(st.top().first==1) bv.pop_back();
		else bv[st.top().second.first]=st.top().second.second;
		st.pop();
		
	}
	cout<<ans;
}

Subtask #1
5.0 / 5.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	600 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	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	600 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
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	452 KB	Output is correct

Subtask #3
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	600 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	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	452 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Incorrect	1 ms	344 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	70 ms	5428 KB	Output is correct
2	Correct	68 ms	5556 KB	Output is correct
3	Correct	72 ms	5460 KB	Output is correct
4	Correct	70 ms	5456 KB	Output is correct
5	Correct	39 ms	5068 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	1628 KB	Output is correct
2	Correct	17 ms	1612 KB	Output is correct
3	Correct	18 ms	1628 KB	Output is correct
4	Correct	11 ms	1584 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	9 ms	1584 KB	Output is correct
7	Correct	16 ms	1624 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	35 ms	2908 KB	Output is correct
2	Correct	47 ms	2844 KB	Output is correct
3	Correct	68 ms	5556 KB	Output is correct
4	Correct	52 ms	5072 KB	Output is correct
5	Correct	20 ms	2776 KB	Output is correct
6	Correct	38 ms	5648 KB	Output is correct
7	Correct	66 ms	5580 KB	Output is correct
8	Correct	35 ms	2868 KB	Output is correct

Subtask #7
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	600 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	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	452 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Incorrect	1 ms	344 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Submission #1086229

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 13.0

Subtask #4 10.0 / 10.0

Subtask #5 20.0 / 20.0

Subtask #6 17.0 / 17.0

Subtask #7 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 13.0

Subtask #4
10.0 / 10.0

Subtask #5
20.0 / 20.0

Subtask #6
17.0 / 17.0

Subtask #7
0 / 25.0