Submission #376092

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
376092	2021-03-10T23:21:33 Z	YJU	Global Warming (CEOI18_glo)	C++14	100 / 100	66 ms	6632 KB

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll N=2e5+5;
const ll MOD=1e9+7;
const ll INF=(1LL<<61);
const ld pi=acos(-1);
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

vector<ll> lis;
ll n,d,u[N],dp[N],ans;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>d;
	REP(i,n)cin>>u[i];
	for(int i=n-1;i>=0;i--){
		ll id=lwb(lis.begin(),lis.end(),-u[i])-lis.begin();
		if(id==SZ(lis))lis.pb(-u[i]);
		else lis[id]=-u[i];
		dp[i]=id+1;
	}
	ans=dp[0];
	lis.clear();
	REP(i,n){
        ll id=lwb(lis.begin(),lis.end(),u[i]+d)-lis.begin();
        ans=max(ans,dp[i]+id);
        id=lwb(lis.begin(),lis.end(),u[i])-lis.begin();
        if(id==SZ(lis))lis.pb(u[i]);
        else lis[id]=u[i];
	}
	cout<<ans<<"\n";
	return 0;
}
/*
7 1
5 0
5 0
7 0
3 0
4 0
4 3 0
2 1 0


*/

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	60 ms	5484 KB	Output is correct
2	Correct	66 ms	5416 KB	Output is correct
3	Correct	60 ms	5356 KB	Output is correct
4	Correct	59 ms	5356 KB	Output is correct
5	Correct	34 ms	5480 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	1644 KB	Output is correct
2	Correct	18 ms	1644 KB	Output is correct
3	Correct	17 ms	1644 KB	Output is correct
4	Correct	9 ms	1776 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	8 ms	1776 KB	Output is correct
7	Correct	12 ms	1644 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	2924 KB	Output is correct
2	Correct	26 ms	2924 KB	Output is correct
3	Correct	53 ms	5356 KB	Output is correct
4	Correct	35 ms	5608 KB	Output is correct
5	Correct	16 ms	3052 KB	Output is correct
6	Correct	30 ms	5484 KB	Output is correct
7	Correct	34 ms	6120 KB	Output is correct
8	Correct	22 ms	2944 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	60 ms	5484 KB	Output is correct
28	Correct	66 ms	5416 KB	Output is correct
29	Correct	60 ms	5356 KB	Output is correct
30	Correct	59 ms	5356 KB	Output is correct
31	Correct	34 ms	5480 KB	Output is correct
32	Correct	14 ms	1644 KB	Output is correct
33	Correct	18 ms	1644 KB	Output is correct
34	Correct	17 ms	1644 KB	Output is correct
35	Correct	9 ms	1776 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	8 ms	1776 KB	Output is correct
38	Correct	12 ms	1644 KB	Output is correct
39	Correct	26 ms	2924 KB	Output is correct
40	Correct	26 ms	2924 KB	Output is correct
41	Correct	53 ms	5356 KB	Output is correct
42	Correct	35 ms	5608 KB	Output is correct
43	Correct	16 ms	3052 KB	Output is correct
44	Correct	30 ms	5484 KB	Output is correct
45	Correct	34 ms	6120 KB	Output is correct
46	Correct	22 ms	2944 KB	Output is correct
47	Correct	33 ms	2924 KB	Output is correct
48	Correct	29 ms	2924 KB	Output is correct
49	Correct	60 ms	5484 KB	Output is correct
50	Correct	34 ms	5736 KB	Output is correct
51	Correct	30 ms	4456 KB	Output is correct
52	Correct	36 ms	5756 KB	Output is correct
53	Correct	31 ms	5612 KB	Output is correct
54	Correct	36 ms	6632 KB	Output is correct
55	Correct	56 ms	5612 KB	Output is correct

Submission #376092

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