답안 #462454

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
462454	2021-08-10T14:49:42 Z	Return_0	Global Warming (CEOI18_glo)	C++17	100 / 100	70 ms	4172 KB

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 2e5 + 7;

ll a [N], L [N], lis [N], len, n, x, ans;

int main ()
{
	cin.tie(0)->sync_with_stdio(false);

	cin>> n >> x;
	input(1, n, a);

	for (ll i = 1; i <= n; i++) {
		lis[L[i] = (lower_bound(lis + 1, lis + len + 1, a[i]) - lis)] = a[i];
		len = max(len, L[i]);
	}

	ans = len;
	len = 0;
	for (ll i = n, p; i; i--) {
		p = lower_bound(lis + 1, lis + len + 1, a[i] - x, greater<ll>()) - lis;
		ans = max(ans, L[i] + p - 1);
		lis[p = (lower_bound(lis + 1, lis + len + 1, a[i], greater<ll>()) - lis)] = a[i];
		len = max(len, p);
	}

	cout<< ans << endl;

	cerr<< "\n" __TIMESTAMP__ " - Time elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*

*/

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	328 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	320 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	63 ms	3756 KB	Output is correct
2	Correct	67 ms	3796 KB	Output is correct
3	Correct	70 ms	3756 KB	Output is correct
4	Correct	62 ms	3712 KB	Output is correct
5	Correct	39 ms	3396 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	15 ms	1192 KB	Output is correct
2	Correct	16 ms	1176 KB	Output is correct
3	Correct	15 ms	1104 KB	Output is correct
4	Correct	9 ms	1068 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	8 ms	1000 KB	Output is correct
7	Correct	12 ms	1212 KB	Output is correct

Subtask #6
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	29 ms	2076 KB	Output is correct
2	Correct	26 ms	2016 KB	Output is correct
3	Correct	60 ms	3696 KB	Output is correct
4	Correct	34 ms	3340 KB	Output is correct
5	Correct	17 ms	1892 KB	Output is correct
6	Correct	29 ms	3356 KB	Output is correct
7	Correct	41 ms	4152 KB	Output is correct
8	Correct	22 ms	2080 KB	Output is correct

Subtask #7
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	320 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	320 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	328 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	320 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	63 ms	3756 KB	Output is correct
28	Correct	67 ms	3796 KB	Output is correct
29	Correct	70 ms	3756 KB	Output is correct
30	Correct	62 ms	3712 KB	Output is correct
31	Correct	39 ms	3396 KB	Output is correct
32	Correct	15 ms	1192 KB	Output is correct
33	Correct	16 ms	1176 KB	Output is correct
34	Correct	15 ms	1104 KB	Output is correct
35	Correct	9 ms	1068 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	8 ms	1000 KB	Output is correct
38	Correct	12 ms	1212 KB	Output is correct
39	Correct	29 ms	2076 KB	Output is correct
40	Correct	26 ms	2016 KB	Output is correct
41	Correct	60 ms	3696 KB	Output is correct
42	Correct	34 ms	3340 KB	Output is correct
43	Correct	17 ms	1892 KB	Output is correct
44	Correct	29 ms	3356 KB	Output is correct
45	Correct	41 ms	4152 KB	Output is correct
46	Correct	22 ms	2080 KB	Output is correct
47	Correct	30 ms	2012 KB	Output is correct
48	Correct	32 ms	2036 KB	Output is correct
49	Correct	67 ms	3700 KB	Output is correct
50	Correct	38 ms	3424 KB	Output is correct
51	Correct	38 ms	2740 KB	Output is correct
52	Correct	40 ms	3508 KB	Output is correct
53	Correct	47 ms	3596 KB	Output is correct
54	Correct	49 ms	4172 KB	Output is correct
55	Correct	50 ms	3816 KB	Output is correct

답안 #462454

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