oj.uz

Submission #873813

# Submission time Handle Problem Language Result Execution time Memory
873813 2023-11-15T20:23:34 Z themm1 Global Warming (CEOI18_glo) C++17
100 / 100
 50 ms 4696 KB 
#include <bits/stdc++.h>
using namespace std;
// ordered set whith s.order_of_key(x) method, which returns rank of element x in set s
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
*/

// pair printing
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "(" << par.first << "; " << par.second << ")"; return out;}
// set printing
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for(const auto &x:cont) out << x << ", "; out << "}"; return out; }
// map printing
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for(const auto &x:cont) out << x << ", "; out << "}"; return out; }
// unordered_set printing
template <class T>
ostream& operator<<(ostream& out, const unordered_set<T> &cont) {out << "{";for(const auto &x:cont) out << x << ", ";out << "}";return out;}
// unordered_map printing
template <class T, class U>
ostream& operator<<(ostream& out, const unordered_map<T, U> &cont) {out << "{";for(const auto &x:cont) out << x << ", ";out << "}";return out;}
// vector printing
template<class T>
ostream& operator<<(ostream& out, const vector<T> &cont){ out << "[";  for (const auto &x:cont) out << x << ", ";  out << "]"; return out;}

#define print(x) cout << (x) << endl;
#define dmp(x) cerr << #x << " = " << x << endl
#define dmpn(x) cerr << #x << " = " << x << "; "
#define dmpl(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << x << endl

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define pb push_back
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define contains(s,x) ((s).find(x) != (s).end())
const int MOD = 998244353;

void solve() {
        int N, D;
        cin >> N >> D;
        vector<int> a(N);
        for (int i = 0; i < N; i++) cin >> a[i];
        vector<int> dp(N + 1, INT_MAX), ending_length(N + 1, 0);
        dp[0] = 0;
        for (int i = 0; i < N; i++) {
                int j = lower_bound(all(dp), a[i]) - begin(dp);
                if (dp[j] > a[i]) dp[j] = a[i];
                ending_length[i + 1] = j;
        }
        dp.assign(N + 1, -INT_MAX);
        int ans = 1;
        for (int i = N - 1; i >= 0; i--) {
                auto it = upper_bound(all(dp), a[i] - D);
                int k = (it == end(dp)) ? 0 : N - (it - begin(dp)) + 1;
                // dmpn(ending_length[i + 1]); dmp(k);
                int cans = ending_length[i + 1] + k;
                ans = max(cans, ans);

                int j = upper_bound(all(dp), a[i]) - begin(dp);
                if (dp[j - 1] < a[i]) dp[j - 1] = a[i];
                // dmp(dp);
        }
        cout << ans << endl;
}

int32_t main() {
        ios::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);

        int t = 1;
        // cin >> t;
        while (t--) {
                solve();
        }
}

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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 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 0 ms 348 KB Output is correct
23 Correct 0 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 50 ms 2652 KB Output is correct
2 Correct 49 ms 2652 KB Output is correct
3 Correct 47 ms 2652 KB Output is correct
4 Correct 49 ms 2800 KB Output is correct
5 Correct 35 ms 2648 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 856 KB Output is correct
2 Correct 12 ms 860 KB Output is correct
3 Correct 11 ms 856 KB Output is correct
4 Correct 9 ms 1116 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 9 ms 860 KB Output is correct
7 Correct 9 ms 1052 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1628 KB Output is correct
2 Correct 20 ms 1628 KB Output is correct
3 Correct 42 ms 2796 KB Output is correct
4 Correct 34 ms 2648 KB Output is correct
5 Correct 18 ms 1624 KB Output is correct
6 Correct 29 ms 2492 KB Output is correct
7 Correct 32 ms 2652 KB Output is correct
8 Correct 17 ms 1628 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 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 0 ms 348 KB Output is correct
23 Correct 0 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 50 ms 2652 KB Output is correct
28 Correct 49 ms 2652 KB Output is correct
29 Correct 47 ms 2652 KB Output is correct
30 Correct 49 ms 2800 KB Output is correct
31 Correct 35 ms 2648 KB Output is correct
32 Correct 11 ms 856 KB Output is correct
33 Correct 12 ms 860 KB Output is correct
34 Correct 11 ms 856 KB Output is correct
35 Correct 9 ms 1116 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 9 ms 860 KB Output is correct
38 Correct 9 ms 1052 KB Output is correct
39 Correct 20 ms 1628 KB Output is correct
40 Correct 20 ms 1628 KB Output is correct
41 Correct 42 ms 2796 KB Output is correct
42 Correct 34 ms 2648 KB Output is correct
43 Correct 18 ms 1624 KB Output is correct
44 Correct 29 ms 2492 KB Output is correct
45 Correct 32 ms 2652 KB Output is correct
46 Correct 17 ms 1628 KB Output is correct
47 Correct 23 ms 2396 KB Output is correct
48 Correct 26 ms 2604 KB Output is correct
49 Correct 48 ms 4684 KB Output is correct
50 Correct 34 ms 3964 KB Output is correct
51 Correct 29 ms 2960 KB Output is correct
52 Correct 42 ms 3928 KB Output is correct
53 Correct 31 ms 3924 KB Output is correct
54 Correct 33 ms 4688 KB Output is correct
55 Correct 39 ms 4696 KB Output is correct