Submission #575423

#	Time	Username	Problem	Language	Result	Execution time	Memory
575423		Trent	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	1067 ms	212 KiB

triusis

#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"

using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define open(g) string _name_ = g; freopen((_name_ + ".in").c_str(), "r", stdin); freopen((_name_ + ".out").c_str(), "w", stdout)
#define printArr(a, len) for(int asdf = 0; asdf < (len); ++asdf) cout << (a)[asdf] << ' '; cout << '\n';
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define forR(i, x) for(int i = 0; i < x; ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define all(i) i.begin(), i.end()
#define pii pair<int, int>
#define vi vector<int>
#define si set<int>
#define usi unordered_set<int>
#define mii map<int, int>
#define umii unordered_map<int, int>
template <class K, class V> using ht = gp_hash_table<K, V, hash<K>, equal_to<K>, direct_mask_range_hashing<>,
linear_probe_fn<>, hash_standard_resize_policy<hash_exponential_size_policy<>, hash_load_check_resize_trigger<>, true>>;

const int MIN = 1e9 + 100, MAX=2e9 + 100, MN = 2e5 + 10;
gp_hash_table<int, int> bit;
int& get(int i){
    if(bit.find(i) == bit.end()) return bit[i] = MAX;
    return bit[i];
}
void upd(int i, int diff){
    i = MIN - i;
    assert(0 < i && i < MAX);
    for(; i < MAX; i += i&-i) get(i) = min(get(i), diff);
}
int qu(int i){
    i = MIN - i;
    assert(0 < i && i < MAX);
    int ma = MAX;
    for(; i > 0; i -= i&-i) ma = min(ma, get(i));
    return ma;
}

int dp[MN];

signed main() {
    int n, m;
    cin >> n >> m;
    upd(0, 0);

    REP(i, 1, n + 1){
        int a;
        cin >> a;
        dp[i] = qu(a - i * m) + i - 1;
        upd(a - i * m, dp[i] - i);
    }
    int mi = n;
    REP(i, 1, n + 1) {
        mi = min(mi, dp[i] + n - i);
    }
    cout << mi << '\n';
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37