oj.uz

Submission #938186

# Submission time Handle Problem Language Result Execution time Memory
938186 2024-03-05T01:53:24 Z Whisper Global Warming (CEOI18_glo) C++17
100 / 100
 244 ms 21428 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, nRange;
int a[MAX];

struct segment_tree{
    int n; vector<int> F;
    segment_tree(){}

    segment_tree(int _n){
        this -> n = _n;
        F.resize((n << 1));
    }
    void clear(){
        F.clear();
        F.resize((n << 1), 0);
    }
    void modify(int p, int val){
        for (F[p += n] = val; p > 0; p >>= 1) {
            F[p >> 1] = max(F[p], F[p ^ 1]);
        }
    }
    int query(int l, int r){
        int res = 0;
        for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1){
            if (l & 1) maximize(res, F[l++]);
            if (r & 1) maximize(res, F[--r]);
        }
        return res;
    }
};

vector<int> compress;
int Get(int x){
    return lower_bound(compress.begin(), compress.end(), x) - compress.begin() + 1;
}

int G[MAX];
void Whisper(){
    cin >> nArr >> nRange;
    for (int i = 1; i <= nArr; ++i) cin >> a[i];
    for (int i = 1; i <= nArr; ++i){
        compress.push_back(a[i]);
        compress.push_back(a[i] + nRange);
        compress.push_back(a[i] - nRange);
    }
    sort(compress.begin(), compress.end());
    compress.resize(unique(compress.begin(), compress.end()) - compress.begin());
    int Lim = (int)compress.size();
    segment_tree st(Lim + 1);

    for (int i = 1; i <= nArr; ++i){
        G[i] = st.query(1, Get(a[i]) - 1) + 1;
        st.modify(Get(a[i]), G[i]);
    }

    int ans = 0;
    st.clear();
    for (int i = nArr; i >= 1; --i){
        int v = st.query(Get(a[i] - nRange + 1), Lim);
        maximize(ans, G[i] + v);
        int p = Get(a[i]);
        st.modify(p, st.query(p + 1, Lim) + 1);
    }
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2524 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 3 ms 2524 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2904 KB Output is correct
20 Correct 1 ms 2532 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2492 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 15148 KB Output is correct
2 Correct 200 ms 15312 KB Output is correct
3 Correct 198 ms 15300 KB Output is correct
4 Correct 201 ms 14796 KB Output is correct
5 Correct 81 ms 13252 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 6824 KB Output is correct
2 Correct 52 ms 6836 KB Output is correct
3 Correct 50 ms 6608 KB Output is correct
4 Correct 26 ms 5312 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 25 ms 4984 KB Output is correct
7 Correct 42 ms 6220 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 11104 KB Output is correct
2 Correct 111 ms 11324 KB Output is correct
3 Correct 237 ms 21052 KB Output is correct
4 Correct 96 ms 15552 KB Output is correct
5 Correct 65 ms 12036 KB Output is correct
6 Correct 120 ms 19628 KB Output is correct
7 Correct 122 ms 19108 KB Output is correct
8 Correct 85 ms 11376 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2524 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 3 ms 2524 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2904 KB Output is correct
20 Correct 1 ms 2532 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2492 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 203 ms 15148 KB Output is correct
28 Correct 200 ms 15312 KB Output is correct
29 Correct 198 ms 15300 KB Output is correct
30 Correct 201 ms 14796 KB Output is correct
31 Correct 81 ms 13252 KB Output is correct
32 Correct 49 ms 6824 KB Output is correct
33 Correct 52 ms 6836 KB Output is correct
34 Correct 50 ms 6608 KB Output is correct
35 Correct 26 ms 5312 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 25 ms 4984 KB Output is correct
38 Correct 42 ms 6220 KB Output is correct
39 Correct 106 ms 11104 KB Output is correct
40 Correct 111 ms 11324 KB Output is correct
41 Correct 237 ms 21052 KB Output is correct
42 Correct 96 ms 15552 KB Output is correct
43 Correct 65 ms 12036 KB Output is correct
44 Correct 120 ms 19628 KB Output is correct
45 Correct 122 ms 19108 KB Output is correct
46 Correct 85 ms 11376 KB Output is correct
47 Correct 105 ms 11976 KB Output is correct
48 Correct 107 ms 12728 KB Output is correct
49 Correct 244 ms 21428 KB Output is correct
50 Correct 91 ms 14284 KB Output is correct
51 Correct 88 ms 10696 KB Output is correct
52 Correct 128 ms 14280 KB Output is correct
53 Correct 122 ms 20048 KB Output is correct
54 Correct 127 ms 21148 KB Output is correct
55 Correct 188 ms 18992 KB Output is correct