oj.uz

Submission #161192

# Submission time Handle Problem Language Result Execution time Memory
161192 2019-11-01T11:33:25 Z rama_pang Global Warming (CEOI18_glo) C++14
27 / 100
 79 ms 4676 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;

int N, X;
int A[200005];
int last[200005];
int jumped[200005];
// two state LIS
int LIS() {
    for (int i = 0; i <= N; i++) last[i] = INF, jumped[i] = INF;
    last[0] = -INF;
    jumped[0] = -INF;

    for (int i = 0; i < N; i++) {
        int j = upper_bound(last, last + N + 1, A[i]) - last;
        if (last[j - 1] < A[i] && A[i] < last[j]) last[j] = A[i];

        j = upper_bound(jumped, jumped + N + 1, A[i] - X) - jumped;
        if (jumped[j - 1] < A[i] - X && A[i] - X < jumped[j]) jumped[j] = A[i] - X;

        j = upper_bound(jumped, jumped + N + 1, A[i]) - jumped;
        if (jumped[j - 1] < A[i] && A[i] < jumped[j]) jumped[j] = A[i];

        
    }

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

    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
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 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
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 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -

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 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 2704 KB Output is correct
2 Correct 75 ms 4600 KB Output is correct
3 Correct 76 ms 4600 KB Output is correct
4 Correct 75 ms 4600 KB Output is correct
5 Correct 52 ms 3832 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 888 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 1528 KB Output is correct
2 Correct 40 ms 2588 KB Output is correct
3 Correct 79 ms 4676 KB Output is correct
4 Correct 56 ms 3960 KB Output is correct
5 Correct 30 ms 2168 KB Output is correct
6 Correct 49 ms 3832 KB Output is correct
7 Correct 55 ms 4472 KB Output is correct
8 Correct 30 ms 2556 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 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -