oj.uz

Submission #796993

# Submission time Handle Problem Language Result Execution time Memory
796993 2023-07-29T03:23:41 Z 12345678 Rabbit Carrot (LMIO19_triusis) C++17
100 / 100
 67 ms 5760 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=3e5+5;
int n, m, h[nx], v[nx], c, dp[nx], ans;

struct fenwick
{
    int d[nx];
    void add(int idx, int val)
    {
        while (idx<nx) d[idx]=min(d[idx], val), idx+=(idx&-idx);
    }
    int find(int idx)
    {
        int tmp=INT_MAX;
        while (idx>0) tmp=min(tmp, d[idx]), idx-=(idx&-idx);
        return tmp;
    }
} f;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    ans=n;
    for (int i=1; i<=n; i++) cin>>h[i], h[i]-=i*m, h[i]=-h[i], v[i]=h[i];
    for (int i=0; i<nx; i++) f.d[i]=1e9;
    sort(v, v+n+1);
    int id=lower_bound(v, v+n+1, 0)-v+1;
    f.add(id, -1);
    for (int i=1; i<=n; i++)
    {
        auto idx=lower_bound(v, v+n+1, h[i])-v+1;
        dp[i]=f.find(idx)+i;
        //cout<<i<<' '<<idx<<' '<<f.find(idx)<<' '<<dp[i]<<' '<<h[i]<<'\n';
        f.add(idx, dp[i]-i-1);
        ans=min(ans, dp[i]+n-i);
    }
    cout<<ans;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1492 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 2 ms 1492 KB Output is correct
22 Correct 2 ms 1492 KB Output is correct
23 Correct 2 ms 1492 KB Output is correct
24 Correct 1 ms 1492 KB Output is correct
25 Correct 2 ms 1492 KB Output is correct
26 Correct 2 ms 1492 KB Output is correct
27 Correct 1 ms 1492 KB Output is correct
28 Correct 2 ms 1492 KB Output is correct
29 Correct 1 ms 1492 KB Output is correct
30 Correct 2 ms 1492 KB Output is correct
31 Correct 1 ms 1492 KB Output is correct
32 Correct 2 ms 1492 KB Output is correct
33 Correct 2 ms 1492 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 2 ms 1492 KB Output is correct
7 Correct 2 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 2 ms 1492 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 2 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 2 ms 1492 KB Output is correct
17 Correct 2 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 1 ms 1492 KB Output is correct
22 Correct 1 ms 1492 KB Output is correct
23 Correct 1 ms 1492 KB Output is correct
24 Correct 1 ms 1492 KB Output is correct
25 Correct 1 ms 1492 KB Output is correct
26 Correct 1 ms 1492 KB Output is correct
27 Correct 1 ms 1492 KB Output is correct
28 Correct 1 ms 1492 KB Output is correct
29 Correct 1 ms 1492 KB Output is correct
30 Correct 1 ms 1492 KB Output is correct
31 Correct 1 ms 1492 KB Output is correct
32 Correct 1 ms 1492 KB Output is correct
33 Correct 1 ms 1492 KB Output is correct
34 Correct 2 ms 1492 KB Output is correct
35 Correct 2 ms 1492 KB Output is correct
36 Correct 2 ms 1492 KB Output is correct
37 Correct 1 ms 1492 KB Output is correct
38 Correct 1 ms 1492 KB Output is correct
39 Correct 1 ms 1492 KB Output is correct
40 Correct 1 ms 1492 KB Output is correct
41 Correct 1 ms 1492 KB Output is correct
42 Correct 2 ms 1492 KB Output is correct
43 Correct 2 ms 1492 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1492 KB Output is correct
2 Correct 2 ms 1492 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 2 ms 1492 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Correct 2 ms 1492 KB Output is correct
17 Correct 2 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 2 ms 1492 KB Output is correct
20 Correct 2 ms 1492 KB Output is correct
21 Correct 1 ms 1492 KB Output is correct
22 Correct 2 ms 1492 KB Output is correct
23 Correct 1 ms 1492 KB Output is correct
24 Correct 2 ms 1492 KB Output is correct
25 Correct 1 ms 1492 KB Output is correct
26 Correct 2 ms 1492 KB Output is correct
27 Correct 2 ms 1492 KB Output is correct
28 Correct 1 ms 1492 KB Output is correct
29 Correct 1 ms 1492 KB Output is correct
30 Correct 1 ms 1492 KB Output is correct
31 Correct 1 ms 1492 KB Output is correct
32 Correct 1 ms 1492 KB Output is correct
33 Correct 1 ms 1492 KB Output is correct
34 Correct 1 ms 1492 KB Output is correct
35 Correct 1 ms 1492 KB Output is correct
36 Correct 1 ms 1492 KB Output is correct
37 Correct 1 ms 1492 KB Output is correct
38 Correct 1 ms 1492 KB Output is correct
39 Correct 1 ms 1492 KB Output is correct
40 Correct 1 ms 1492 KB Output is correct
41 Correct 1 ms 1492 KB Output is correct
42 Correct 1 ms 1492 KB Output is correct
43 Correct 1 ms 1492 KB Output is correct
44 Correct 28 ms 3816 KB Output is correct
45 Correct 61 ms 5712 KB Output is correct
46 Correct 57 ms 5760 KB Output is correct
47 Correct 67 ms 5708 KB Output is correct
48 Correct 31 ms 4684 KB Output is correct
49 Correct 31 ms 4940 KB Output is correct
50 Correct 29 ms 5680 KB Output is correct
51 Correct 28 ms 5680 KB Output is correct
52 Correct 27 ms 4708 KB Output is correct
53 Correct 25 ms 5044 KB Output is correct
54 Correct 33 ms 4836 KB Output is correct
55 Correct 33 ms 4860 KB Output is correct