oj.uz

Submission #422626

# Submission time Handle Problem Language Result Execution time Memory
422626 2021-06-10T09:21:57 Z snasibov05 Global Warming (CEOI18_glo) C++14
25 / 100
 159 ms 2632 KB 
#include <bits/stdc++.h>

using namespace std;

#define oo 1000000000

int main() {
    int n, x; cin >> n >> x;
    vector<int> v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }

    int sz = 1;
    vector<int> dp(n);
    vector<int> c(n+1, oo);
    c[0] = 0;
    c[1] = v[0];
    dp[0] = 1;

    for (int i = 1; i < n; ++i) {
        if (v[i] < c[1]) c[1] = v[i], dp[i] = 1;
        else if (v[i] > c[sz]) c[sz+1] = v[i], dp[i] = ++sz;
        else {
            int k = lower_bound(c.begin(), c.end(), v[i]) - c.begin();
            c[k] = v[i];
            dp[i] = k;
        }
    }

    int ans = dp[n-1];
    c.assign(n+1, 0);
    c[0] = oo;
    c[1] = v[n-1] + x;
    dp[n-1] = 1;
    sz = 1;

    for (int i = n-2; i >= 0; --i){
        if (v[i] > c[1]) ans = max(ans, dp[i]);
        else if (v[i] < c[sz]) ans = max(ans, dp[i] + sz);
        else{
            int k = upper_bound(c.rbegin(), c.rend(), v[i]) - c.rbegin();
            k = n - k;
            ans = max(ans, dp[i] + k - 1);
        }

        if (v[i] + x > c[1]) c[1] = v[i] + x;
        else if (v[i] + x < c[sz]) c[++sz] = v[i] + x;
        else{
            int k = upper_bound(c.rbegin(), c.rend(), v[i] + x) - c.rbegin();
            k = n - k + 1;
            c[k] = v[i] + x;
        }
    }

    cout << ans << "\n";

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Incorrect 2 ms 204 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 129 ms 2600 KB Output is correct
2 Correct 132 ms 2632 KB Output is correct
3 Correct 159 ms 2600 KB Output is correct
4 Correct 146 ms 2600 KB Output is correct
5 Correct 76 ms 2612 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 844 KB Output is correct
2 Correct 31 ms 880 KB Output is correct
3 Correct 32 ms 860 KB Output is correct
4 Incorrect 19 ms 876 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

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

Subtask #7
0 / 25.0

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