oj.uz

Submission #825985

# Submission time Handle Problem Language Result Execution time Memory
825985 2023-08-15T09:42:29 Z Tsovak Global Warming (CEOI18_glo) C++17
100 / 100
 53 ms 10048 KB 
// -------------------- Includes -------------------- //
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <stdio.h>
#include <cstdlib>
#include <stdlib.h>
#include <array>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <math.h>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <tuple>
#include <utility>
#include <cassert>
#include <assert.h>
#include <climits>
#include <limits.h>
#include <ctime>
#include <time.h>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;
 
// -------------------- Typedefs -------------------- //
 
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
 
// -------------------- Defines -------------------- //
 
#define pr pair
#define mpr make_pair
#define ff first
#define ss second
 
#define mset multiset
#define mmap multimap
#define uset unordered_set
#define umap unordered_map
#define umset unordered_multiset
#define ummap unordered_multimap
#define pqueue priority_queue
 
#define sz(x) (int((x).size()))
#define len(x) (int((x).length()))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
 
#define pf push_front
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ft front
#define bk back
 
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
 
// -------------------- Constants -------------------- //
 
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18 + 5);
const ll MOD = ll(1e9 + 7);
const ll MOD2 = ll(998244353);
 
// -------------------- Functions -------------------- //
 
void fastio()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	return;
}
 
void precision(int x)
{
	cout.setf(ios::fixed | ios::showpoint);
	cout.precision(x);
	return;
}
 
ll gcd(ll a, ll b)
{
	while (b) {
		a %= b;
		swap(a, b);
	}
	return a;
}
 
ll lcm(ll a, ll b)
{
	return a / gcd(a, b) * b;
}
 
bool is_prime(ll a)
{
	if (a == 1) {
		return false;
	}
	for (ll i = 2; i * i <= a; i++) {
		if (a % i == 0) {
			return false;
		}
	}
	return true;
}
 
bool is_square(ll a)
{
	ll b = ll(sqrt(a));
	return (b * b == a);
}
 
bool is_cube(ll a)
{
	ll b = ll(cbrt(a));
	return (b * b * b == a);
}
 
int digit_sum(ll a)
{
	int sum = 0;
	while (a) {
		sum += int(a % 10);
		a /= 10;
	}
	return sum;
}
 
ll binpow(ll a, int b)
{
	ll ans = 1;
	while (b) {
		if ((b & 1) == 1) {
			ans *= a;
		}
		b >>= 1;
		a *= a;
	}
	return ans;
}
 
ll binpow_by_mod(ll a, ll b, ll mod)
{
	ll ans = 1;
	while (b) {
		if ((b & 1) == 1) {
			ans *= a;
			ans %= mod;
		}
		b >>= 1;
		a *= a;
		a %= mod;
	}
	return ans;
}
 
ll factorial(int a)
{
	ll ans = 1;
	for (int i = 2; i <= a; i++) {
		ans *= ll(i);
	}
	return ans;
}
 
ll factorial_by_mod(int a, ll mod)
{
	ll ans = 1;
	for (int i = 2; i <= a; i++) {
		ans *= ll(i);
		ans %= mod;
	}
	return ans;
}
 
// -------------------- Solution -------------------- //
 
const int N = 200005;
int a[N];
int n;
 
vector<int> vv;
vector<vector<int>> v;
deque<int> d;
 
int h[N];
 
void solve()
{
	int i, j;
 
	int x;
 
	cin >> n >> x;
 
	for (i = 1; i <= n; i++) {
		cin >> a[i];
 
		if (vv.empty() || vv.bk() < a[i]) {
			vv.pb(a[i]);
			v.pb({ a[i] });
			h[i] = sz(v) - 1;
		}
		else {
			j = lb(all(vv), a[i]) - vv.begin();
			vv[j] = a[i];
			v[j].pb(a[i]);
			h[i] = j;
		}
	}
 
	int ans = 1, c;
 
	for (i = n; i >= 2; i--) {
		v[h[i]].popb();
		if (v[h[i]].empty()) {
			v.popb();
			vv.popb();
		}
		else vv[h[i]] = v[h[i]].bk();
 
		if (d.empty() || d.ft() > a[i]) {
			d.pf(a[i]);
			c = sz(d);
		}
		else {
			j = ub(all(d), a[i]) - d.begin();
			d[j - 1] = a[i];
			c = sz(d) - (j - 1);
		}
 
		j = lb(all(vv), a[i] + x) - vv.begin();
 
		ans = max(ans, c + j);
	}
 
	cout << ans << "\n";
 
	return;
}
 
void precalc()
{
	return;
}
 
int main()
{
	fastio();
 
	precalc();
 
	int tests = 1, tc;
	//cin >> tests;
	for (tc = 1; tc <= tests; tc++) {
		solve();
	}
 
	//cout << db(clock()) / CLOCKS_PER_SEC << endl;
 
	return 0;
}
 
/*
	# # # #   # # # #   # # # #   #       #    #       #     #
	   #      #         #     #    #     #    # #      #   #
	   #      # # # #   #     #     #   #    #   #     # #
	   #            #   #     #      # #    # # # #    #   #
	   #      # # # #   # # # #       #    #       #   #     #
*/

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 5168 KB Output is correct
2 Correct 49 ms 5128 KB Output is correct
3 Correct 53 ms 5256 KB Output is correct
4 Correct 48 ms 5136 KB Output is correct
5 Correct 27 ms 9596 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1504 KB Output is correct
2 Correct 12 ms 1504 KB Output is correct
3 Correct 11 ms 1492 KB Output is correct
4 Correct 7 ms 2576 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 8 ms 2444 KB Output is correct
7 Correct 9 ms 1492 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2580 KB Output is correct
2 Correct 21 ms 2604 KB Output is correct
3 Correct 41 ms 5140 KB Output is correct
4 Correct 28 ms 9604 KB Output is correct
5 Correct 15 ms 4616 KB Output is correct
6 Correct 26 ms 9476 KB Output is correct
7 Correct 29 ms 9620 KB Output is correct
8 Correct 16 ms 2660 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 48 ms 5168 KB Output is correct
28 Correct 49 ms 5128 KB Output is correct
29 Correct 53 ms 5256 KB Output is correct
30 Correct 48 ms 5136 KB Output is correct
31 Correct 27 ms 9596 KB Output is correct
32 Correct 12 ms 1504 KB Output is correct
33 Correct 12 ms 1504 KB Output is correct
34 Correct 11 ms 1492 KB Output is correct
35 Correct 7 ms 2576 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 8 ms 2444 KB Output is correct
38 Correct 9 ms 1492 KB Output is correct
39 Correct 21 ms 2580 KB Output is correct
40 Correct 21 ms 2604 KB Output is correct
41 Correct 41 ms 5140 KB Output is correct
42 Correct 28 ms 9604 KB Output is correct
43 Correct 15 ms 4616 KB Output is correct
44 Correct 26 ms 9476 KB Output is correct
45 Correct 29 ms 9620 KB Output is correct
46 Correct 16 ms 2660 KB Output is correct
47 Correct 24 ms 2524 KB Output is correct
48 Correct 23 ms 2548 KB Output is correct
49 Correct 48 ms 5076 KB Output is correct
50 Correct 33 ms 9576 KB Output is correct
51 Correct 25 ms 8152 KB Output is correct
52 Correct 31 ms 8968 KB Output is correct
53 Correct 24 ms 9832 KB Output is correct
54 Correct 31 ms 10048 KB Output is correct
55 Correct 39 ms 4964 KB Output is correct