oj.uz

Submission #328170

# Submission time Handle Problem Language Result Execution time Memory
328170 2020-11-15T13:53:51 Z Karen124 Global Warming (CEOI18_glo) C++14
62 / 100
 115 ms 9856 KB 
#include <bits/stdc++.h>
     
using namespace std;
     
#define ll long long int 
#define F first
#define S second
#define pb push_back
#define md ((b + e) >> 1)
#define lc (ind << 1)
#define rc (lc | 1)

const ll N = 2e5 + 10;
const ll LOG = 50;
const ll MOD = 1e9 + 7;
const ll INF = 1e9 + 10;
ll n, add, a[N], b[N], ans;
pair <ll, ll> mxl[N], mxr[N];
int main() {
    cin >> n >> add;
    for (ll i = 0; i < n; i++){
        cin >> a[i];
    }
    ll len = 0;
    for (ll i = 0; i < n; i++){
        ll p = lower_bound(b, b + len, a[i]) - b; 
        b[p] = a[i];
        len = max(len, p + 1ll);
        if (i == 0) mxl[i] = {p + 1ll, -a[0]};
        else mxl[i] = max(mxl[i - 1], {p + 1ll, -a[i]}); 
    }
    ans = len;
    fill(b, b + n + 1, 0);
    len = 0;
    for (ll i = n - 1; i >= 0; i--){
        ll p = lower_bound(b, b + len, -(a[i] + add)) - b;
        b[p] = -(a[i] + add);
        len = max(len, p + 1ll);
        if (i == n - 1) mxr[i] = {p + 1ll, a[i] + add};
        else mxr[i] = max(mxr[i + 1], {p + 1ll, a[i] + add});
    }
    for (int i = 1; i < n; i++){
        if (-mxl[i - 1].S < mxr[i].S){
            ans = max(ans, mxl[i - 1].F + mxr[i].F);
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Incorrect 1 ms 364 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 113 ms 9708 KB Output is correct
2 Correct 111 ms 9708 KB Output is correct
3 Correct 115 ms 9856 KB Output is correct
4 Correct 110 ms 9644 KB Output is correct
5 Correct 72 ms 9836 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2668 KB Output is correct
2 Correct 27 ms 2668 KB Output is correct
3 Correct 30 ms 2668 KB Output is correct
4 Correct 18 ms 2668 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 18 ms 2668 KB Output is correct
7 Correct 26 ms 2668 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 5100 KB Output is correct
2 Correct 56 ms 5100 KB Output is correct
3 Correct 112 ms 9728 KB Output is correct
4 Correct 73 ms 9720 KB Output is correct
5 Correct 35 ms 5100 KB Output is correct
6 Correct 70 ms 9196 KB Output is correct
7 Correct 89 ms 9196 KB Output is correct
8 Correct 54 ms 5100 KB Output is correct

Subtask #7
0 / 25.0

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