답안 #71001 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
71001	2018-08-24T01:56:45 Z	윤교준(#2204)	Global Warming (CEOI18_glo)	C++11	100 / 100	121 ms	6900 KB

#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define upmax(a,b) (a)=max((a),(b))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;

const bool debug = 0;
const int MAXN = 200005;

vector<ll> LISV, LDSV;
int B[MAXN]; ll C[MAXN];

ll A[MAXN];

int N, K, Ans;

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> K;
	for(int i = 1; i <= N; i++) cin >> A[i];

	for(int i = 1; i <= N; i++) {
		int t = int(lower_bound(allv(LISV), A[i]) - LISV.begin());
		B[i] = t;
		if(sz(LISV) <= t) {
			C[i] = -INFLL;
			LISV.eb(A[i]);
		} else {
			C[i] = LISV[t];
			LISV[t] = A[i];
		}
	}
	Ans = sz(LISV);

	for(int i = N; i; i--) {
		int t = int(lower_bound(allv(LDSV), -A[i]) - LDSV.begin());
		if(sz(LDSV) <= t) LDSV.eb(-A[i]); else LDSV[t] = -A[i];

		ll x = -LDSV.back();
		if(C[i] <= -INFLL) {
			LISV.pop_back();
		} else {
			LISV[B[i]] = C[i];
		}

		if(debug) {
			printf("LDS : ");
			for(int v : LDSV) printf("%d ", -v);
			puts("");
			printf("LIS : ");
			for(int v : LISV) printf("%d ", v);
			puts("");
		}

		upmax(Ans, sz(LDSV) + int(lower_bound(allv(LISV), x + K) - LISV.begin()));
		upmax(Ans, t+1 + int(lower_bound(allv(LISV), A[i] + K) - LISV.begin()));
		
		if(!LISV.empty())
			upmax(Ans, sz(LISV) + int(lower_bound(allv(LDSV), K - LISV.back()) - LDSV.begin()));
	}
	upmax(Ans, sz(LDSV));

	cout << Ans << endl;
	return 0;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	292 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	3 ms	392 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	544 KB	Output is correct
7	Correct	2 ms	548 KB	Output is correct
8	Correct	2 ms	548 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	2 ms	548 KB	Output is correct
11	Correct	2 ms	548 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	292 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	3 ms	392 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	544 KB	Output is correct
7	Correct	2 ms	548 KB	Output is correct
8	Correct	2 ms	548 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	2 ms	548 KB	Output is correct
11	Correct	2 ms	548 KB	Output is correct
12	Correct	3 ms	548 KB	Output is correct
13	Correct	2 ms	548 KB	Output is correct
14	Correct	3 ms	548 KB	Output is correct
15	Correct	2 ms	548 KB	Output is correct
16	Correct	2 ms	620 KB	Output is correct
17	Correct	2 ms	620 KB	Output is correct
18	Correct	3 ms	620 KB	Output is correct

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	121 ms	4588 KB	Output is correct
2	Correct	82 ms	4588 KB	Output is correct
3	Correct	92 ms	4588 KB	Output is correct
4	Correct	89 ms	4588 KB	Output is correct
5	Correct	78 ms	6756 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	21 ms	6756 KB	Output is correct
2	Correct	29 ms	6756 KB	Output is correct
3	Correct	20 ms	6756 KB	Output is correct
4	Correct	26 ms	6756 KB	Output is correct
5	Correct	2 ms	6756 KB	Output is correct
6	Correct	15 ms	6756 KB	Output is correct
7	Correct	28 ms	6756 KB	Output is correct

Subtask #6
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	56 ms	6756 KB	Output is correct
2	Correct	34 ms	6756 KB	Output is correct
3	Correct	72 ms	6756 KB	Output is correct
4	Correct	70 ms	6756 KB	Output is correct
5	Correct	31 ms	6756 KB	Output is correct
6	Correct	51 ms	6756 KB	Output is correct
7	Correct	69 ms	6756 KB	Output is correct
8	Correct	30 ms	6756 KB	Output is correct

Subtask #7
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	292 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	3 ms	392 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	544 KB	Output is correct
7	Correct	2 ms	548 KB	Output is correct
8	Correct	2 ms	548 KB	Output is correct
9	Correct	2 ms	548 KB	Output is correct
10	Correct	2 ms	548 KB	Output is correct
11	Correct	2 ms	548 KB	Output is correct
12	Correct	3 ms	548 KB	Output is correct
13	Correct	2 ms	548 KB	Output is correct
14	Correct	3 ms	548 KB	Output is correct
15	Correct	2 ms	548 KB	Output is correct
16	Correct	2 ms	620 KB	Output is correct
17	Correct	2 ms	620 KB	Output is correct
18	Correct	3 ms	620 KB	Output is correct
19	Correct	3 ms	620 KB	Output is correct
20	Correct	3 ms	620 KB	Output is correct
21	Correct	3 ms	620 KB	Output is correct
22	Correct	2 ms	620 KB	Output is correct
23	Correct	3 ms	620 KB	Output is correct
24	Correct	3 ms	620 KB	Output is correct
25	Correct	3 ms	620 KB	Output is correct
26	Correct	3 ms	620 KB	Output is correct
27	Correct	121 ms	4588 KB	Output is correct
28	Correct	82 ms	4588 KB	Output is correct
29	Correct	92 ms	4588 KB	Output is correct
30	Correct	89 ms	4588 KB	Output is correct
31	Correct	78 ms	6756 KB	Output is correct
32	Correct	21 ms	6756 KB	Output is correct
33	Correct	29 ms	6756 KB	Output is correct
34	Correct	20 ms	6756 KB	Output is correct
35	Correct	26 ms	6756 KB	Output is correct
36	Correct	2 ms	6756 KB	Output is correct
37	Correct	15 ms	6756 KB	Output is correct
38	Correct	28 ms	6756 KB	Output is correct
39	Correct	56 ms	6756 KB	Output is correct
40	Correct	34 ms	6756 KB	Output is correct
41	Correct	72 ms	6756 KB	Output is correct
42	Correct	70 ms	6756 KB	Output is correct
43	Correct	31 ms	6756 KB	Output is correct
44	Correct	51 ms	6756 KB	Output is correct
45	Correct	69 ms	6756 KB	Output is correct
46	Correct	30 ms	6756 KB	Output is correct
47	Correct	41 ms	6756 KB	Output is correct
48	Correct	42 ms	6756 KB	Output is correct
49	Correct	113 ms	6756 KB	Output is correct
50	Correct	70 ms	6828 KB	Output is correct
51	Correct	53 ms	6828 KB	Output is correct
52	Correct	66 ms	6828 KB	Output is correct
53	Correct	60 ms	6900 KB	Output is correct
54	Correct	58 ms	6900 KB	Output is correct
55	Correct	80 ms	6900 KB	Output is correct

답안 #71001

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