oj.uz

Submission #337590

# Submission time Handle Problem Language Result Execution time Memory
337590 2020-12-21T07:23:19 Z Azimjon Global Warming (CEOI18_glo) C++17
100 / 100
 62 ms 8556 KB 
// Muallif: Azimjon Mehmonali o'g'li

//=========================================================

//#pragma optimization_level 3
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")

//=========================================================
#ifdef DEBUG
#define xtp xtp1
#else
#define xtp(x)
#endif
//=========================================================

#include <bits/stdc++.h>

using namespace std;

#define int long long

typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;

#define F first
#define S second
#define pb push_back
#define endl "\n"

#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
#define SORT(a) sort(ALL(a))
#define rSORT(a) sort(rALL(a))
#define REV(a) reverse(ALL(a))
#define sqr(x) ((x) * (x))

#define TEZ                  \
	ios::sync_with_stdio(0); \
	cin.tie(0);

const long double PI = 3.1415926535897;
const int mod = 1000000007LL;
const int INF = 1e18;

const int N = 2e5 + 10;

signed main() {
	TEZ;

	int n, x;
	cin >> n >> x;

	vi a(n, 0);

	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	vi l(n + 1, INF), d(n + 1, -INF);
	l[0] = -INF;
	int o = 0;

	for (int i = 0; i < n; i++) {
		int x = lower_bound(l.begin(), l.begin() + o + 1, a[i]) - l.begin();
		d[i] = x;
		l[x] = a[i];
		if (o < x) {
			o = x;
		}
		// xtp(l);
	}

	l.assign(n, INF);
	l[0] = -INF;
	o = 0;
	vi p(n + 1, -INF);
	for (int i = n - 1; i >= 0; i--) {
		int q
			= lower_bound(l.begin(), l.begin() + o + 1, -a[i] + x) - l.begin();
		int w = lower_bound(l.begin(), l.begin() + o + 1, -a[i]) - l.begin();

		l[w] = -a[i];
		p[i] = q;

		if (o < q) {
			o = q;
		}
		// xtp(l);
	}

	int jv = -INF;
	for (int i = 0; i < n; i++) {
		jv = max(jv, p[i] + d[i] - 1);
	}

	cout << jv << endl;

	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 364 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 0 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 364 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 0 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 364 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 512 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 364 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 6764 KB Output is correct
2 Correct 59 ms 6636 KB Output is correct
3 Correct 62 ms 6636 KB Output is correct
4 Correct 61 ms 6540 KB Output is correct
5 Correct 34 ms 6636 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1900 KB Output is correct
2 Correct 14 ms 1900 KB Output is correct
3 Correct 15 ms 1964 KB Output is correct
4 Correct 8 ms 1900 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 8 ms 2284 KB Output is correct
7 Correct 12 ms 2412 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 3436 KB Output is correct
2 Correct 26 ms 4460 KB Output is correct
3 Correct 53 ms 8556 KB Output is correct
4 Correct 35 ms 7788 KB Output is correct
5 Correct 16 ms 4076 KB Output is correct
6 Correct 28 ms 7532 KB Output is correct
7 Correct 35 ms 8172 KB Output is correct
8 Correct 22 ms 4460 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 364 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 512 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 364 KB Output is correct
27 Correct 61 ms 6764 KB Output is correct
28 Correct 59 ms 6636 KB Output is correct
29 Correct 62 ms 6636 KB Output is correct
30 Correct 61 ms 6540 KB Output is correct
31 Correct 34 ms 6636 KB Output is correct
32 Correct 14 ms 1900 KB Output is correct
33 Correct 14 ms 1900 KB Output is correct
34 Correct 15 ms 1964 KB Output is correct
35 Correct 8 ms 1900 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 8 ms 2284 KB Output is correct
38 Correct 12 ms 2412 KB Output is correct
39 Correct 25 ms 3436 KB Output is correct
40 Correct 26 ms 4460 KB Output is correct
41 Correct 53 ms 8556 KB Output is correct
42 Correct 35 ms 7788 KB Output is correct
43 Correct 16 ms 4076 KB Output is correct
44 Correct 28 ms 7532 KB Output is correct
45 Correct 35 ms 8172 KB Output is correct
46 Correct 22 ms 4460 KB Output is correct
47 Correct 29 ms 4460 KB Output is correct
48 Correct 29 ms 4460 KB Output is correct
49 Correct 60 ms 8556 KB Output is correct
50 Correct 35 ms 7916 KB Output is correct
51 Correct 28 ms 5868 KB Output is correct
52 Correct 35 ms 7916 KB Output is correct
53 Correct 31 ms 7916 KB Output is correct
54 Correct 37 ms 8556 KB Output is correct
55 Correct 48 ms 8556 KB Output is correct