oj.uz

Submission #879822

# Submission time Handle Problem Language Result Execution time Memory
879822 2023-11-28T07:29:08 Z noyancanturk Growing Trees (BOI11_grow) C++17
0 / 100
 182 ms 5944 KB 
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    const int lim=2e5+100;
#else
    const int lim=3e3+100;
#endif

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back

const int mod=998244353;
using pii=pair<int,int>;

struct BIT{
    int n,tree[lim];
    BIT();
    BIT(int n):n(n){
        memset(tree,0,sizeof(int)*(n+1));
    }
    BIT(int n,int*ref){
        memset(tree,0,sizeof(int)*(n+1));
        for(int i=1;i<=n;i++){
            tree[i]+=ref[i];
            if(i+(i&-i)<=n)tree[i+(i&-i)]+=tree[i];
        }
    }
    inline void update(int p,int val){
        while(p<=n){
            tree[p]+=val;
            p+=p&-p;
        }
    }
    inline int query(int p){
        int res=0;
        while(p){
            res+=tree[p];
            p-=p&-p;
        }
        return res;
    }
};
 
struct RangeBIT{
    BIT a,b;
    RangeBIT(int n):a(n),b(n){}
    inline void update(int l,int r,int x){
        a.update(l,x);
        a.update(r+1,-x);
        b.update(l,x*(l-1));
        b.update(r+1,-x*r);
    }
    inline void update(int p,int x){
        update(p,p,x);
    }
    inline int sumy(int p){
        return p * a.query(p) - b.query(p);
    }
    inline int query(int l,int r){
        return sumy(r)-sumy(l-1);
    }
    inline int query(int p){
        return query(p,p);
    }
};

void solve(){
    int n,q;
    cin>>n>>q;
    int a[n+1];
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    RangeBIT bit(n);
    for(int i=1;i<=n;i++){
        bit.update(i,a[i]);
    }
    while(q--){
        char t;
        cin>>t;
        if(t=='F'){
            int c,h;
            cin>>c>>h;
            int l=1,r=n,resind=-1;
            while(l<=r){
                int mid=(l+r)>>1;
                if(h<=bit.query(mid)){
                    resind=mid;
                    r=mid-1;
                }else{
                    l=mid+1;
                }
            }
            if(resind==-1)continue;
            int endval=bit.query(min(n,resind+c-1));
            l=resind,r=n;
            int firstind=-1;
            while(l<=r){
                int mid=(l+r)>>1;
                if(endval<bit.query(mid)){
                    r=mid-1;
                }
                else if(endval==bit.query(mid)){
                    firstind=mid;
                    r=mid-1;
                }
                else{
                    l=mid+1;
                }
            }
            bit.update(resind,firstind-1,1);
            l=firstind,r=n;
            int lastind=-1;
            while(l<=r){
                int mid=(l+r)>>1;
                //cerr<<l<<" "<<r<<" "<<mid<<" "<<bit.query(mid)<<" "<<endval<<"\n";
                if(endval<bit.query(mid)){
                    r=mid-1;
                }
                else if(endval==bit.query(mid)){
                    lastind=mid;
                    l=mid+1;
                }
                else{
                    l=mid+1;
                }
            }
            //cerr<<(c-(firstind-resind))<<"\n";
            bit.update(lastind-(c-(firstind-resind))+1,lastind,1);
            /*
            for(int i=1;i<=n;i++){
                cerr<<bit.query(i)<<" ";
            }cerr<<"\n";
            */
        }else{
            int L,R;
            cin>>L>>R;
            int l=1,r=n,begind=-1;
            while(l<=r){
                int mid=(l+r)>>1;
                if(L<=bit.query(mid)){
                    begind=mid;
                    r=mid-1;
                }else{
                    l=mid+1;
                }
            }
            if(begind==-1){
                cout<<"0\n";
                continue;
            }
            l=1,r=n;
            int endind=-1;
            while(l<=r){
                int mid=(l+r)>>1;
                if(bit.query(mid)<=R){
                    endind=mid;
                    l=mid+1;
                }else{
                    r=mid-1;
                }
            }
            if(endind==-1){
                cout<<"0\n";
                return;
            }
            //cerr<<endind<<" "<<begind<<"\n";
            cout<<endind-begind+1<<"\n";
        }
        //cerr<<"ok\n";
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
#ifdef Local  
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
#else
    //freopen("optmilk.in","r",stdin);
    //freopen("optmilk.out","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 4752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3420 KB Output is correct
2 Incorrect 3 ms 3420 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 3596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 3676 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 119 ms 4936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 182 ms 5264 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 4752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 149 ms 5944 KB Output isn't correct
2 Halted 0 ms 0 KB -