oj.uz

Submission #572282

# Submission time Handle Problem Language Result Execution time Memory
572282 2022-06-04T07:47:32 Z tarunares7250 Rabbit Carrot (LMIO19_triusis) C++17
100 / 100
 360 ms 24180 KB 
//ulimit -s unlimited
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<long long>
#define vi vector<int>
#define vb vector<bool>
#define pql priority_queue<long long>
#define pqp priority_queue<pair<ll,ll> >
#define pqs priority_queue<ll,vl,greater<ll> >
#define md ((ll) 1e9+7)

vl st;
//nl node left;nr node right;ql query left;qr query right;n node key;
ll minq(ll nl,ll nr,ll ql,ll qr,ll n){
    if(qr>=nr && ql<=nl){
        return st[n];
    }
    else if(qr<nl || ql>nr){
        return md;
    }
    return min(minq(nl,(nl+nr)/2,ql,qr,2*n),minq((nl+nr)/2 + 1,nr,ql,qr,2*n+1));
}

void updateq(ll nl,ll nr,ll n,ll i,ll v){
    if(nl == nr && nl == i){
        st[n] = min(v,st[n]);
        return;
    }
    ll mid = (nl+nr)/2;
    if(i<=mid){
        updateq(nl,mid,2*n,i,v);
    }
    else{
        updateq(mid+1,nr,2*n+1,i,v);
    }
    st[n] = min(st[2*n],st[2*n+1]);
}


void solve(){

    ll i,j,k,n,m;
    cin>>n>>m;

    ll a[n+1];
    a[0] = 0;
    for(i=1;i<=n;i++){
        cin>>a[i];
        a[i] -= i*m;
    }

    map<ll,ll> cc;
    for(i=0;i<=n;i++){
        cc[a[i]] = 0;
    }
    i = 0;
    for(auto &c:cc){
        c.second = i;
        i++;
    }

    k = cc.size();
    k++;
    st.resize(4*k,md);
    ll dp[n+1];

    for(i=n;i>=0;i--){
        ll ans = minq(0,k-1,0,cc[a[i]],1);
        dp[i] = ans-i-1;
        dp[i] = min(dp[i],n-i);
        updateq(0,k-1,1,cc[a[i]],dp[i]+i);
    }
    cout<<dp[0]<<"\n";

    // for(i=0;i<=n;i++){
    //     cout<<dp[i]<<" ";
    // }
    // cout<<"\n";

    // for(auto c:cc){
    //     cout<<c.first<<","<<c.second<<" ";
    // }
    // cout<<"\n";
    // cout<<cc.size()<<"\n";


}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t;
    //cin >> t;
    t = 1;
    while(t--)
        solve();
    return 0;
}

Compilation message

triusis.cpp: In function 'void solve()':
triusis.cpp:43:10: warning: unused variable 'j' [-Wunused-variable]
   43 |     ll i,j,k,n,m;
      |          ^

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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 312 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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 312 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 1 ms 212 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 3 ms 840 KB Output is correct
22 Correct 4 ms 720 KB Output is correct
23 Correct 5 ms 852 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 4 ms 852 KB Output is correct
26 Correct 3 ms 844 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 3 ms 852 KB Output is correct
30 Correct 3 ms 764 KB Output is correct
31 Correct 2 ms 592 KB Output is correct
32 Correct 3 ms 888 KB Output is correct
33 Correct 3 ms 852 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 1 ms 212 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 3 ms 840 KB Output is correct
6 Correct 4 ms 720 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 3 ms 844 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 3 ms 852 KB Output is correct
14 Correct 3 ms 764 KB Output is correct
15 Correct 2 ms 592 KB Output is correct
16 Correct 3 ms 888 KB Output is correct
17 Correct 3 ms 852 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 312 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 5 ms 968 KB Output is correct
35 Correct 4 ms 900 KB Output is correct
36 Correct 4 ms 852 KB Output is correct
37 Correct 5 ms 844 KB Output is correct
38 Correct 1 ms 400 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 3 ms 596 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 3 ms 852 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 968 KB Output is correct
2 Correct 4 ms 900 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 5 ms 844 KB Output is correct
5 Correct 1 ms 400 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 3 ms 724 KB Output is correct
15 Correct 3 ms 840 KB Output is correct
16 Correct 4 ms 720 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 4 ms 852 KB Output is correct
20 Correct 3 ms 844 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 3 ms 852 KB Output is correct
24 Correct 3 ms 764 KB Output is correct
25 Correct 2 ms 592 KB Output is correct
26 Correct 3 ms 888 KB Output is correct
27 Correct 3 ms 852 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 320 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 312 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 151 ms 22580 KB Output is correct
45 Correct 360 ms 24180 KB Output is correct
46 Correct 342 ms 24056 KB Output is correct
47 Correct 325 ms 24124 KB Output is correct
48 Correct 122 ms 22600 KB Output is correct
49 Correct 146 ms 23304 KB Output is correct
50 Correct 38 ms 5304 KB Output is correct
51 Correct 24 ms 5320 KB Output is correct
52 Correct 112 ms 13616 KB Output is correct
53 Correct 21 ms 4668 KB Output is correct
54 Correct 129 ms 23116 KB Output is correct
55 Correct 136 ms 22988 KB Output is correct