oj.uz

Submission #70994

# Submission time Handle Problem Language Result Execution time Memory
70994 2018-08-24T01:40:19 Z 윤교준(#2204) Global Warming (CEOI18_glo) C++11
62 / 100
 69 ms 4260 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<int> LISV, LDSV;
int B[MAXN], C[MAXN];

int 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] = -INF;
			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];

		t = -LDSV.back();
		if(C[i] <= -INF) {
			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), t + K) - LISV.begin()));
	}

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 396 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 568 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 2 ms 696 KB Output is correct
9 Correct 2 ms 696 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 2 ms 696 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 396 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 568 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 2 ms 696 KB Output is correct
9 Correct 2 ms 696 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 2 ms 696 KB Output is correct
12 Correct 2 ms 696 KB Output is correct
13 Correct 2 ms 696 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 724 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 396 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 568 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 2 ms 696 KB Output is correct
9 Correct 2 ms 696 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 2 ms 696 KB Output is correct
12 Correct 2 ms 696 KB Output is correct
13 Correct 2 ms 696 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Incorrect 2 ms 724 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 2984 KB Output is correct
2 Correct 62 ms 2984 KB Output is correct
3 Correct 65 ms 2984 KB Output is correct
4 Correct 62 ms 2984 KB Output is correct
5 Correct 43 ms 4260 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 4260 KB Output is correct
2 Correct 18 ms 4260 KB Output is correct
3 Correct 19 ms 4260 KB Output is correct
4 Correct 13 ms 4260 KB Output is correct
5 Correct 3 ms 4260 KB Output is correct
6 Correct 17 ms 4260 KB Output is correct
7 Correct 17 ms 4260 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 4260 KB Output is correct
2 Correct 32 ms 4260 KB Output is correct
3 Correct 67 ms 4260 KB Output is correct
4 Correct 54 ms 4260 KB Output is correct
5 Correct 26 ms 4260 KB Output is correct
6 Correct 42 ms 4260 KB Output is correct
7 Correct 60 ms 4260 KB Output is correct
8 Correct 31 ms 4260 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 396 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 568 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 2 ms 696 KB Output is correct
9 Correct 2 ms 696 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 2 ms 696 KB Output is correct
12 Correct 2 ms 696 KB Output is correct
13 Correct 2 ms 696 KB Output is correct
14 Correct 2 ms 724 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Incorrect 2 ms 724 KB Output isn't correct
20 Halted 0 ms 0 KB -