oj.uz

Submission #161208

# Submission time Handle Problem Language Result Execution time Memory
161208 2019-11-01T12:22:45 Z rama_pang Global Warming (CEOI18_glo) C++14
62 / 100
 68 ms 5924 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;

int N, X;
int A[200005];
int lis[200005];
int lds[200005];
pair<int, int> anslis[200005];
pair<int, int> anslds[200005];


int LIS() {
    for (int i = 0; i <= N; i++) lis[i] = INF, lds[i] = -INF;
    lis[0] = -INF, lds[N] = INF;

    int res = 0;

    for (int i = 0, cur = 0; i < N; i++) {
        int j = upper_bound(lis, lis + N + 1, A[i] - X) - lis;
        if (lis[j - 1] < A[i] - X && A[i] - X < lis[j]) lis[j] = A[i] - X, cur = max(cur, j);
        anslis[i] = {cur, lis[cur]};
    }

    for (int i = N - 1, cur = N - 1; i >= 0; i--) {
        int j = lower_bound(lds, lds + N + 1, A[i]) - lds;
        if (j >= 1 && lds[j - 1] < A[i] && A[i] < lds[j]) lds[j - 1] = A[i], cur = min(cur, j - 1);
        if (j >= 2 && lds[j - 2] < A[i] && A[i] < lds[j - 1]) lds[j - 2] = A[i], cur = min(cur, j - 2);
        
        anslds[i] = {cur, lds[cur]};
    }

    for (int i = 0; i <= N; i++) {
        if (lis[i] < INF) res = max(res, i);
    }

    for (int i = 0; i + 1 < N; i++) {
        if (anslis[i].second < anslds[i + 1].second) 
            res = max(res, anslis[i].first + N - anslds[i + 1].first);
    }

    return res;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> N >> X;
    for (int i = 0; i < N; i++) cin >> A[i];

    int ans = LIS();
    cout << ans << "\n"; 

}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 404 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 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 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 404 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 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 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 404 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Incorrect 2 ms 376 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 67 ms 5820 KB Output is correct
2 Correct 66 ms 5880 KB Output is correct
3 Correct 66 ms 5880 KB Output is correct
4 Correct 68 ms 5924 KB Output is correct
5 Correct 50 ms 5776 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1656 KB Output is correct
2 Correct 18 ms 1656 KB Output is correct
3 Correct 17 ms 1656 KB Output is correct
4 Correct 14 ms 1656 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 14 ms 1656 KB Output is correct
7 Correct 21 ms 1756 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 3028 KB Output is correct
2 Correct 34 ms 3116 KB Output is correct
3 Correct 66 ms 5892 KB Output is correct
4 Correct 49 ms 5752 KB Output is correct
5 Correct 26 ms 3068 KB Output is correct
6 Correct 50 ms 5500 KB Output is correct
7 Correct 53 ms 5492 KB Output is correct
8 Correct 30 ms 3064 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 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 404 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Incorrect 2 ms 376 KB Output isn't correct
20 Halted 0 ms 0 KB -