oj.uz

Submission #575426

# Submission time Handle Problem Language Result Execution time Memory
575426 2022-06-10T11:36:56 Z Trent Rabbit Carrot (LMIO19_triusis) C++14
63 / 100
 1000 ms 19516 KB 
#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(; 0 < i && 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() {
    boost();
    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
14.0 / 14.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 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct

Subtask #2
21.0 / 21.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 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 5 ms 468 KB Output is correct
21 Correct 6 ms 1044 KB Output is correct
22 Correct 6 ms 468 KB Output is correct
23 Correct 36 ms 2788 KB Output is correct
24 Correct 53 ms 2784 KB Output is correct
25 Correct 8 ms 1616 KB Output is correct
26 Correct 17 ms 2764 KB Output is correct
27 Correct 7 ms 340 KB Output is correct
28 Correct 7 ms 340 KB Output is correct
29 Correct 6 ms 1044 KB Output is correct
30 Correct 8 ms 1652 KB Output is correct
31 Correct 5 ms 468 KB Output is correct
32 Correct 30 ms 2792 KB Output is correct
33 Correct 29 ms 2796 KB Output is correct

Subtask #3
28.0 / 28.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 5 ms 468 KB Output is correct
5 Correct 6 ms 1044 KB Output is correct
6 Correct 6 ms 468 KB Output is correct
7 Correct 36 ms 2788 KB Output is correct
8 Correct 53 ms 2784 KB Output is correct
9 Correct 8 ms 1616 KB Output is correct
10 Correct 17 ms 2764 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 7 ms 340 KB Output is correct
13 Correct 6 ms 1044 KB Output is correct
14 Correct 8 ms 1652 KB Output is correct
15 Correct 5 ms 468 KB Output is correct
16 Correct 30 ms 2792 KB Output is correct
17 Correct 29 ms 2796 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 452 ms 5048 KB Output is correct
35 Correct 515 ms 5184 KB Output is correct
36 Correct 482 ms 5092 KB Output is correct
37 Correct 17 ms 2764 KB Output is correct
38 Correct 7 ms 340 KB Output is correct
39 Correct 7 ms 340 KB Output is correct
40 Correct 6 ms 468 KB Output is correct
41 Correct 8 ms 332 KB Output is correct
42 Correct 59 ms 2780 KB Output is correct
43 Correct 55 ms 2768 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 452 ms 5048 KB Output is correct
2 Correct 515 ms 5184 KB Output is correct
3 Correct 482 ms 5092 KB Output is correct
4 Correct 17 ms 2764 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 7 ms 340 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 8 ms 332 KB Output is correct
9 Correct 59 ms 2780 KB Output is correct
10 Correct 55 ms 2768 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 6 ms 1044 KB Output is correct
16 Correct 6 ms 468 KB Output is correct
17 Correct 36 ms 2788 KB Output is correct
18 Correct 53 ms 2784 KB Output is correct
19 Correct 8 ms 1616 KB Output is correct
20 Correct 17 ms 2764 KB Output is correct
21 Correct 7 ms 340 KB Output is correct
22 Correct 7 ms 340 KB Output is correct
23 Correct 6 ms 1044 KB Output is correct
24 Correct 8 ms 1652 KB Output is correct
25 Correct 5 ms 468 KB Output is correct
26 Correct 30 ms 2792 KB Output is correct
27 Correct 29 ms 2796 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 206 ms 19516 KB Output is correct
45 Execution timed out 1080 ms 19088 KB Time limit exceeded
46 Halted 0 ms 0 KB -