Submission #314580

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
314580	2020-10-20T11:21:27 Z	nafis_shifat	Global Warming (CEOI18_glo)	C++14	58 / 100	428 ms	9588 KB

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=2e5+5;
const int inf=1e9;
vector<int> v;
struct BIT1 {
	int bit[mxn] = {};
	void update(int p,int v) {
		for(;p<mxn;p+=p&-p) bit[p]=max(bit[p],v);
	}
    int query(int p,int r = 0) {
    	for(;p>0;p-=p&-p) r=max(r,bit[p]);
        return r;
    }
} inc,bt1;
struct BIT2 {
	int bit[mxn] = {};
	void update(int p,int v) {
		for(;p>0;p-=p&-p) bit[p]=max(bit[p],v);
	}
    int query(int p,int r = 0) {
    	for(;p<mxn;p+=p&-p) r=max(r,bit[p]);
        return r;
    }
} dc,bt2;

int get(int x) {
	return lower_bound(v.begin(),v.end(),x) - v.begin() + 1;
}

int main() {
	int n,x;
	cin>>n>>x;	

	int a[n+1];
	for(int i = 1; i <= n; i++) {
		cin>>a[i];
		v.push_back(a[i]);
		v.push_back(a[i] - x);
		v.push_back(a[i] + x);
	}

	sort(v.begin(),v.end());
	v.erase(unique(v.begin(),v.end()),v.end());
	int dp1[mxn],dp2[mxn];

	int ans = 0;
	for(int i = 1; i <= n; i++) {
		int p = get(a[i]);
		int x = inc.query(p - 1);
		dp1[i] = x + 1;
		ans = max(ans,dp1[i]);
		inc.update(p,dp1[i]); 
	}

	for(int i = n; i > 0 ; i--) {
		int p = get(a[i]);
		int x = dc.query(p + 1);
		dp2[i] = x + 1;
		dc.update(p,dp2[i]); 
	}


	for(int i = 1; i <= n; i++) {
		int ind = get(a[i]);
		int v = bt1.query(ind - 1);
		ans = max(ans, v + dp2[i]);
		bt1.update(get(a[i] - x), dp1[i]);

	}

	for(int i = n; i >= 1; i--) {
		int ind = get(a[i]);
		int v = bt2.query(ind + 1);
		ans = max(ans, v + dp1[i]);
		bt1.update(get(a[i] + x), dp2[i]);

	}

	cout<<ans<<endl;











}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	425 ms	9580 KB	Output is correct
2	Correct	428 ms	9436 KB	Output is correct
3	Correct	423 ms	9588 KB	Output is correct
4	Correct	425 ms	9584 KB	Output is correct
5	Correct	223 ms	7516 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	107 ms	4076 KB	Output is correct
2	Correct	107 ms	4072 KB	Output is correct
3	Correct	107 ms	3944 KB	Output is correct
4	Correct	60 ms	2796 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	59 ms	2540 KB	Output is correct
7	Correct	92 ms	3564 KB	Output is correct

Subtask #6
0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	219 ms	4964 KB	Output is correct
2	Correct	230 ms	4964 KB	Output is correct
3	Runtime error	231 ms	9180 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
4	Halted	0 ms	0 KB	-

Subtask #7
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	3 ms	512 KB	Output is correct
20	Correct	2 ms	512 KB	Output is correct
21	Correct	2 ms	512 KB	Output is correct
22	Correct	2 ms	512 KB	Output is correct
23	Correct	2 ms	512 KB	Output is correct
24	Correct	2 ms	512 KB	Output is correct
25	Correct	2 ms	512 KB	Output is correct
26	Correct	2 ms	512 KB	Output is correct
27	Correct	425 ms	9580 KB	Output is correct
28	Correct	428 ms	9436 KB	Output is correct
29	Correct	423 ms	9588 KB	Output is correct
30	Correct	425 ms	9584 KB	Output is correct
31	Correct	223 ms	7516 KB	Output is correct
32	Correct	107 ms	4076 KB	Output is correct
33	Correct	107 ms	4072 KB	Output is correct
34	Correct	107 ms	3944 KB	Output is correct
35	Correct	60 ms	2796 KB	Output is correct
36	Correct	1 ms	384 KB	Output is correct
37	Correct	59 ms	2540 KB	Output is correct
38	Correct	92 ms	3564 KB	Output is correct
39	Correct	219 ms	4964 KB	Output is correct
40	Correct	230 ms	4964 KB	Output is correct
41	Runtime error	231 ms	9180 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
42	Halted	0 ms	0 KB	-

Submission #314580

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 0 / 17.0

Subtask #7 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
0 / 17.0

Subtask #7
0 / 25.0