Submission #594058

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
594058	2022-07-12T03:06:17 Z	penguinhacker	Global Warming (CEOI18_glo)	C++17	100 / 100	359 ms	18892 KB

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int mxN=2e5;
int n, x, a[mxN], ans;
vector<int> d, changes[mxN];

struct st {
	int st[1<<19];
	void upd(int i, int x, int u=1, int l=0, int r=d.size()-1) {
		if (l==r) {
			st[u]=x;
			return;
		}
		int mid=(l+r)/2;
		i<=mid?upd(i, x, 2*u, l, mid):upd(i, x, 2*u+1, mid+1, r);
		st[u]=max(st[2*u], st[2*u+1]);
	}
	int qry(int ql, int qr, int u=1, int l=0, int r=d.size()-1) {
		if (l>qr||r<ql) return 0;
		if (ql<=l&&r<=qr) return st[u];
		int mid=(l+r)/2;
		return max(qry(ql, qr, 2*u, l, mid), qry(ql, qr, 2*u+1, mid+1, r));
	}
} lhs, rhs;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> x;
	for (int i=0; i<n; ++i)
		cin >> a[i];
	d=vector<int>(a, a+n);
	sort(d.begin(), d.end());
	d.resize(unique(d.begin(), d.end())-d.begin());
	for (int i=0; i<n; ++i) {
		a[i]=lower_bound(d.begin(), d.end(), a[i])-d.begin();
		int dp=lhs.qry(0, a[i]-1)+1;
		ans=max(ans, dp);
		lhs.upd(a[i], dp);
		changes[a[i]].push_back(dp);
	}
	for (int i=n-1; ~i; --i) {
		changes[a[i]].pop_back();
		lhs.upd(a[i], changes[a[i]].size()?changes[a[i]].back():0);
		int dp=rhs.qry(a[i]+1, d.size()-1)+1;
		rhs.upd(a[i], dp);
		int pos=lower_bound(d.begin(), d.end(), d[a[i]]+x)-d.begin();
		//if (i==4)
		//	cout << dp << " " << d[a[i]]+x << " " << d[pos] << endl;
		//cout << lhs.qry(0, pos-1) << " " << dp << endl;
		ans=max(ans, lhs.qry(0, pos-1)+dp);
	}
	cout << ans;
	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	356 ms	18780 KB	Output is correct
2	Correct	313 ms	18848 KB	Output is correct
3	Correct	359 ms	18792 KB	Output is correct
4	Correct	319 ms	18892 KB	Output is correct
5	Correct	125 ms	13240 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	76 ms	8488 KB	Output is correct
2	Correct	78 ms	8484 KB	Output is correct
3	Correct	64 ms	8396 KB	Output is correct
4	Correct	32 ms	7120 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	36 ms	6976 KB	Output is correct
7	Correct	55 ms	8480 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	110 ms	11852 KB	Output is correct
2	Correct	117 ms	11972 KB	Output is correct
3	Correct	267 ms	18840 KB	Output is correct
4	Correct	112 ms	13272 KB	Output is correct
5	Correct	70 ms	11480 KB	Output is correct
6	Correct	126 ms	17768 KB	Output is correct
7	Correct	134 ms	18408 KB	Output is correct
8	Correct	86 ms	11948 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	4948 KB	Output is correct
2	Correct	3 ms	5032 KB	Output is correct
3	Correct	3 ms	4964 KB	Output is correct
4	Correct	3 ms	5032 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	2 ms	4948 KB	Output is correct
7	Correct	3 ms	4948 KB	Output is correct
8	Correct	3 ms	5032 KB	Output is correct
9	Correct	3 ms	5028 KB	Output is correct
10	Correct	3 ms	4980 KB	Output is correct
11	Correct	3 ms	5032 KB	Output is correct
12	Correct	2 ms	4948 KB	Output is correct
13	Correct	2 ms	4948 KB	Output is correct
14	Correct	3 ms	5032 KB	Output is correct
15	Correct	3 ms	4948 KB	Output is correct
16	Correct	3 ms	4948 KB	Output is correct
17	Correct	4 ms	4948 KB	Output is correct
18	Correct	4 ms	4948 KB	Output is correct
19	Correct	4 ms	5076 KB	Output is correct
20	Correct	4 ms	5076 KB	Output is correct
21	Correct	3 ms	5076 KB	Output is correct
22	Correct	3 ms	5040 KB	Output is correct
23	Correct	3 ms	5032 KB	Output is correct
24	Correct	3 ms	5076 KB	Output is correct
25	Correct	3 ms	5076 KB	Output is correct
26	Correct	4 ms	5076 KB	Output is correct
27	Correct	356 ms	18780 KB	Output is correct
28	Correct	313 ms	18848 KB	Output is correct
29	Correct	359 ms	18792 KB	Output is correct
30	Correct	319 ms	18892 KB	Output is correct
31	Correct	125 ms	13240 KB	Output is correct
32	Correct	76 ms	8488 KB	Output is correct
33	Correct	78 ms	8484 KB	Output is correct
34	Correct	64 ms	8396 KB	Output is correct
35	Correct	32 ms	7120 KB	Output is correct
36	Correct	3 ms	4948 KB	Output is correct
37	Correct	36 ms	6976 KB	Output is correct
38	Correct	55 ms	8480 KB	Output is correct
39	Correct	110 ms	11852 KB	Output is correct
40	Correct	117 ms	11972 KB	Output is correct
41	Correct	267 ms	18840 KB	Output is correct
42	Correct	112 ms	13272 KB	Output is correct
43	Correct	70 ms	11480 KB	Output is correct
44	Correct	126 ms	17768 KB	Output is correct
45	Correct	134 ms	18408 KB	Output is correct
46	Correct	86 ms	11948 KB	Output is correct
47	Correct	149 ms	11856 KB	Output is correct
48	Correct	174 ms	11888 KB	Output is correct
49	Correct	305 ms	18840 KB	Output is correct
50	Correct	132 ms	13216 KB	Output is correct
51	Correct	142 ms	12236 KB	Output is correct
52	Correct	168 ms	18172 KB	Output is correct
53	Correct	125 ms	18124 KB	Output is correct
54	Correct	144 ms	18804 KB	Output is correct
55	Correct	236 ms	18840 KB	Output is correct

Submission #594058

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