Submission #940022

# Submission time Handle Problem Language Result Execution time Memory
940022 2024-03-07T04:05:16 Z vjudge1 Global Warming (CEOI18_glo) C++17
10 / 100
89 ms 8252 KB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define ll long long
#define int long long
const int N=1e5+5;
void solve(){
	int n,x;cin>>n>>x;
	vector<int> a(n),pref(n+1),suf(n+1);
	for(int i=0;i<n;i++)
		cin>>a[i];
	vector<int> lis(n,1e10),lds(n,1e10);
	int ans=0;
	for(int i=0;i<n;i++){
		int A=lower_bound(all(lis),a[i]+x)-lis.begin();
		int B=lower_bound(all(lds),a[i]+x)-lds.begin();
		if(lds[max(A,B)]>a[i]+x)
			lds[max(A,B)]=a[i]+x;
		suf[i]=max(A,B)+1;
		int it=lower_bound(all(lis),a[i])-lis.begin();
		if(lis[it]>a[i])
			lis[it]=a[i];
		pref[i]=it+1;
		
		ans=max(ans,max(suf[i],pref[i]));
	}
	/*for(int i=0;i<n;i++)
		cout<<pref[i]<<' ';
	cout<<endl;
	for(int i=0;i<n;i++)
		cout<<suf[i]<<' ';
	cout<<endl;*/
	
	cout<<ans<<endl;
}
main(){
    int T=1;
    //cin>>T;
    while(T--){
        solve();
    }
}
/*
12 2
2 3 3 8 1 5 6 7 8 3 5 4
2 1
2 7
3 4
4 7
7 6
5 6
6 8
6 9
7 10
10 11
10 12
*/

Compilation message

glo.cpp:40:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   40 | main(){
      | ^~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 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 432 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 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 432 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 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 432 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 83 ms 8192 KB Output is correct
2 Correct 86 ms 8016 KB Output is correct
3 Correct 89 ms 8192 KB Output is correct
4 Correct 87 ms 8196 KB Output is correct
5 Correct 56 ms 8252 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 20 ms 2392 KB Output is correct
2 Correct 21 ms 2652 KB Output is correct
3 Correct 21 ms 2652 KB Output is correct
4 Correct 15 ms 2652 KB Output is correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 4180 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 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 432 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -