Submission #161657

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
161657	2019-11-03T13:02:32 Z	amoo_safar	Global Warming (CEOI18_glo)	C++14	100 / 100	91 ms	10132 KB

#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;

const ld PI = 3.14159265359;

ll MOD = (ll) 1e9 + 7;
const ll MAXN = (ll) 2e5 + 10;
const ll INF = (ll) (LONG_LONG_MAX - 3ll) / 2ll;
//const ll P = 104107;


ll dp1[MAXN], a[MAXN];
ll mn[MAXN];

void upd1(ll i){
	ll l = 1, r = MAXN;
	ll mid;
	while(l + 1 < r){
		mid = (l + r) >> 1;
		if(mn[mid - 1] < a[i]) l = mid;
		else r = mid;
	}
	dp1[i] = l;
	mn[l] = min(a[i], mn[l]);
}

ll dp2[MAXN], mx[MAXN];
void upd2(ll i){
	ll l = 1, r = MAXN;
	ll mid;
	while(l + 1 < r){
		mid = (l + r) >> 1;
		if(mx[mid - 1] > a[i]) l = mid;
		else r = mid;
	}
	dp2[i] = l;
	mx[l] = max(a[i], mx[l]);
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	memset(mn, 31, sizeof mn);
	fill(mx, mx + MAXN, -INF);
	ll n, x;
	cin >> n >> x;
	for(int i = 1; i <= n; i++) cin >> a[i];
	for(int i = 1; i <= n; i++) upd1(i);
	
	ll ans = *max_element(dp1 + 1, dp1 + n + 1);
	
	for(int i = n; i > 1; i--){
		upd2(i);
		ll l = 0, r = MAXN;
		ll mid;
		while(l + 1 < r){
			mid = (l + r) >> 1;
			if(mx[mid] > a[i - 1] - x) l = mid;
			else r = mid;
		}
		
		ans = max(ans, dp1[i - 1] + l);
	}
	cout << ans;
	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	88 ms	10132 KB	Output is correct
2	Correct	89 ms	10112 KB	Output is correct
3	Correct	91 ms	10104 KB	Output is correct
4	Correct	88 ms	10104 KB	Output is correct
5	Correct	67 ms	9340 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	5112 KB	Output is correct
2	Correct	26 ms	5112 KB	Output is correct
3	Correct	25 ms	5112 KB	Output is correct
4	Correct	21 ms	4984 KB	Output is correct
5	Correct	5 ms	3452 KB	Output is correct
6	Correct	31 ms	4984 KB	Output is correct
7	Correct	23 ms	5112 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	42 ms	6776 KB	Output is correct
2	Correct	42 ms	6780 KB	Output is correct
3	Correct	78 ms	10104 KB	Output is correct
4	Correct	67 ms	9400 KB	Output is correct
5	Correct	46 ms	6668 KB	Output is correct
6	Correct	63 ms	9208 KB	Output is correct
7	Correct	69 ms	9848 KB	Output is correct
8	Correct	38 ms	6748 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	3448 KB	Output is correct
2	Correct	5 ms	3448 KB	Output is correct
3	Correct	5 ms	3448 KB	Output is correct
4	Correct	5 ms	3448 KB	Output is correct
5	Correct	5 ms	3448 KB	Output is correct
6	Correct	5 ms	3448 KB	Output is correct
7	Correct	5 ms	3452 KB	Output is correct
8	Correct	5 ms	3448 KB	Output is correct
9	Correct	5 ms	3448 KB	Output is correct
10	Correct	5 ms	3448 KB	Output is correct
11	Correct	5 ms	3448 KB	Output is correct
12	Correct	5 ms	3448 KB	Output is correct
13	Correct	5 ms	3448 KB	Output is correct
14	Correct	5 ms	3448 KB	Output is correct
15	Correct	5 ms	3448 KB	Output is correct
16	Correct	5 ms	3448 KB	Output is correct
17	Correct	5 ms	3420 KB	Output is correct
18	Correct	5 ms	3448 KB	Output is correct
19	Correct	5 ms	3580 KB	Output is correct
20	Correct	5 ms	3576 KB	Output is correct
21	Correct	5 ms	3448 KB	Output is correct
22	Correct	5 ms	3448 KB	Output is correct
23	Correct	5 ms	3576 KB	Output is correct
24	Correct	5 ms	3448 KB	Output is correct
25	Correct	5 ms	3448 KB	Output is correct
26	Correct	6 ms	3448 KB	Output is correct
27	Correct	88 ms	10132 KB	Output is correct
28	Correct	89 ms	10112 KB	Output is correct
29	Correct	91 ms	10104 KB	Output is correct
30	Correct	88 ms	10104 KB	Output is correct
31	Correct	67 ms	9340 KB	Output is correct
32	Correct	24 ms	5112 KB	Output is correct
33	Correct	26 ms	5112 KB	Output is correct
34	Correct	25 ms	5112 KB	Output is correct
35	Correct	21 ms	4984 KB	Output is correct
36	Correct	5 ms	3452 KB	Output is correct
37	Correct	31 ms	4984 KB	Output is correct
38	Correct	23 ms	5112 KB	Output is correct
39	Correct	42 ms	6776 KB	Output is correct
40	Correct	42 ms	6780 KB	Output is correct
41	Correct	78 ms	10104 KB	Output is correct
42	Correct	67 ms	9400 KB	Output is correct
43	Correct	46 ms	6668 KB	Output is correct
44	Correct	63 ms	9208 KB	Output is correct
45	Correct	69 ms	9848 KB	Output is correct
46	Correct	38 ms	6748 KB	Output is correct
47	Correct	46 ms	6744 KB	Output is correct
48	Correct	47 ms	6904 KB	Output is correct
49	Correct	89 ms	10128 KB	Output is correct
50	Correct	68 ms	9328 KB	Output is correct
51	Correct	55 ms	7804 KB	Output is correct
52	Correct	69 ms	9408 KB	Output is correct
53	Correct	66 ms	9476 KB	Output is correct
54	Correct	70 ms	10104 KB	Output is correct
55	Correct	76 ms	10104 KB	Output is correct

Submission #161657

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