oj.uz

Submission #581372

# Submission time Handle Problem Language Result Execution time Memory
581372 2022-06-22T14:43:50 Z drdilyor Global Warming (CEOI18_glo) C++17
52 / 100
 91 ms 5804 KB 
#if defined(ONPC) && !defined(_GLIBCXX_ASSERTIONS)
    #define _GLIBCXX_ASSERTIONS
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#ifdef ONPC
    #include "t_debug.cpp"
#else
    #define debug(...) 42
#endif
#define allit(a) (a).begin(), (a).end()
#define sz(a) ((int) (a).size())

using namespace std;
using ll = long long;
using vi = vector<int>;
namespace pd = __gnu_pbds;
template<typename K>
using ordered_set = pd::tree<K, pd::null_type, less<int>, pd::rb_tree_tag, pd::tree_order_statistics_node_update>;
template<typename... T>
using gp_hash_table = pd::gp_hash_table<T...>;//simple using statement gives warnings

const int INF = 1e9;
const ll INFL = 1e18;
const int N = 1e5;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rng(RANDOM);

struct Fenwick {
    int n;
    vi tree;
    Fenwick(int n) : n(n), tree(n) {}
    void set_(int i, int d) {
        for (; i < n; i |= i + 1) tree[i] = max(tree[i], d);
    }
    int max_(int i) {
        i = min(i, n-1);
        int res = 0;
        for (; i >= 0; i = (i & (i+1))-1) res = max(res, tree[i]);
        return res;
    }
};

int solve() {
    int n, x; cin >> n >> x;
    vi a(n); for (auto& i : a) cin >> i;

    // compress
    vi highest(n), b(n);
    {
        vi ix(n);
        for (int i = 0; i < n; i++) ix[i] = i;
        sort(allit(ix), [&](int i, int j) { return a[i] < a[j]; });
        for (int i = 0, prev = -1, key = -1; i < n; i++) {
            if (a[ix[i]] == prev) b[ix[i]] = key;
            else {
                prev = a[ix[i]];
                b[ix[i]] = ++key;
            }
        }

        for (int i = 0; i < n; i++) {
            int l = 0, r = n;
            while (l < r - 1) {
                int mid = (l + r) / 2;
                if (a[ix[mid]] < a[ix[i]] + x) l = mid;
                else r = mid;
            }
            highest[ix[i]] = b[ix[l]];
        }
    }

    vector<vi> dp(2, vi(n));
    Fenwick tree1(n), tree2(n);

    int res = 0;
    for (int i = 0; i < n; i++) {
        dp[0][i] = tree1.max_(b[i]-1) + 1;
        dp[1][i] = max(tree1.max_(highest[i]), tree2.max_(b[i]-1)) + 1;
        tree1.set_(b[i], dp[0][i]);
        tree2.set_(b[i], dp[1][i]);
    }
    cout << tree2.max_(n-1);
    return 0;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    //cin >> t;
    while (t-- && cin) {
        if (solve()) break;
        #ifdef ONPC
            cout << "____________________" << endl;
        #endif
    }
    return 0;
}

Compilation message

glo.cpp: In function 'int solve()':
glo.cpp:77:9: warning: unused variable 'res' [-Wunused-variable]
   77 |     int res = 0;
      |         ^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Incorrect 0 ms 212 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Incorrect 0 ms 212 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 5744 KB Output is correct
2 Correct 91 ms 5800 KB Output is correct
3 Correct 88 ms 5804 KB Output is correct
4 Correct 90 ms 5804 KB Output is correct
5 Correct 51 ms 5740 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1680 KB Output is correct
2 Correct 19 ms 2192 KB Output is correct
3 Correct 23 ms 2056 KB Output is correct
4 Correct 15 ms 1984 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 15 ms 1936 KB Output is correct
7 Correct 23 ms 2104 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 3056 KB Output is correct
2 Correct 34 ms 3020 KB Output is correct
3 Correct 70 ms 5804 KB Output is correct
4 Correct 55 ms 5704 KB Output is correct
5 Correct 23 ms 3020 KB Output is correct
6 Correct 50 ms 5524 KB Output is correct
7 Correct 47 ms 5476 KB Output is correct
8 Correct 33 ms 3064 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Incorrect 0 ms 212 KB Output isn't correct
14 Halted 0 ms 0 KB -