oj.uz

Submission #949291

# Submission time Handle Problem Language Result Execution time Memory
949291 2024-03-19T05:07:10 Z steveonalex Global Warming (CEOI18_glo) C++14
100 / 100
 54 ms 5496 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int INF = 2e9 + 69;

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, d; cin >> n >> d;
    vector<int> a(n);
    for(int i = 0; i<n; ++i) cin >> a[i];

    vector<int> st(n+1, 0); st[0] = INF;
    vector<int> suff(n+1);
    int ans = 0;
    for(int i = n-1; i>=0; --i){
        int idx = lower_bound(ALL(st), a[i], greater<int>()) - st.begin();
        suff[i] = idx;
        st[idx] = a[i];
        maximize(ans, idx);
    }

    st = vector<int>(n+1, INF); st[0] = 0;
    for(int i = 0; i<n-1; ++i){
        int idx = lower_bound(ALL(st), a[i]) - st.begin();
        st[idx] = a[i];
        idx = lower_bound(ALL(st), a[i+1] + d) - st.begin();
        maximize(ans, idx + suff[i+1] - 1);
    }

    cout << ans << "\n";

    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 5460 KB Output is correct
2 Correct 47 ms 5324 KB Output is correct
3 Correct 54 ms 5496 KB Output is correct
4 Correct 48 ms 5456 KB Output is correct
5 Correct 34 ms 4688 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1624 KB Output is correct
2 Correct 12 ms 1624 KB Output is correct
3 Correct 12 ms 1628 KB Output is correct
4 Correct 9 ms 1372 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 1464 KB Output is correct
7 Correct 12 ms 1552 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2904 KB Output is correct
2 Correct 21 ms 2908 KB Output is correct
3 Correct 45 ms 5460 KB Output is correct
4 Correct 37 ms 4692 KB Output is correct
5 Correct 18 ms 2396 KB Output is correct
6 Correct 30 ms 4392 KB Output is correct
7 Correct 33 ms 5200 KB Output is correct
8 Correct 20 ms 2908 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 49 ms 5460 KB Output is correct
28 Correct 47 ms 5324 KB Output is correct
29 Correct 54 ms 5496 KB Output is correct
30 Correct 48 ms 5456 KB Output is correct
31 Correct 34 ms 4688 KB Output is correct
32 Correct 13 ms 1624 KB Output is correct
33 Correct 12 ms 1624 KB Output is correct
34 Correct 12 ms 1628 KB Output is correct
35 Correct 9 ms 1372 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 9 ms 1464 KB Output is correct
38 Correct 12 ms 1552 KB Output is correct
39 Correct 21 ms 2904 KB Output is correct
40 Correct 21 ms 2908 KB Output is correct
41 Correct 45 ms 5460 KB Output is correct
42 Correct 37 ms 4692 KB Output is correct
43 Correct 18 ms 2396 KB Output is correct
44 Correct 30 ms 4392 KB Output is correct
45 Correct 33 ms 5200 KB Output is correct
46 Correct 20 ms 2908 KB Output is correct
47 Correct 24 ms 2896 KB Output is correct
48 Correct 24 ms 2908 KB Output is correct
49 Correct 48 ms 5460 KB Output is correct
50 Correct 34 ms 4700 KB Output is correct
51 Correct 34 ms 3676 KB Output is correct
52 Correct 36 ms 4692 KB Output is correct
53 Correct 30 ms 4688 KB Output is correct
54 Correct 33 ms 5464 KB Output is correct
55 Correct 39 ms 5460 KB Output is correct