oj.uz

Submission #954582

# Submission time Handle Problem Language Result Execution time Memory
954582 2024-03-28T07:37:24 Z ezzzay Growing Trees (BOI11_grow) C++14
10 / 100
 222 ms 5028 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=2e5+5;
int bit[N];
int arr[N];
int n,q;
vector<int>ans;
void update(int idx, int val){
    if(idx==0)return;
    while(idx<N){
        bit[idx]+=val;
        idx+= idx & -idx;
    }
}
int find(int idx){
    if(idx==0)return 0;
    int s=0;
    while(idx>0){
        s+=bit[idx];
        idx-= idx & -idx;
    }
    return s;
}
int findpos(int h){
    int lo=1;
    int hi=n+1;
    while(hi>=lo){
        int mid=(hi+lo)/2;
        if(find(mid)+arr[mid]<h){
            lo=mid+1;
        }
        else{
            hi=mid-1;
        }
    }
    return lo;
}
signed main(){
    vector<int>v;
    cin>>n>>q;
    
    for(int i=1;i<=n;i++){
        int a;
        cin>>a;
        v.pb(a);
    }
    sort(v.begin(),v.end());
    for(int i=1;i<=n;i++){
        arr[i]=v[i-1];
    }
    cout<<endl;
    while(q--){
        char c;
        cin>>c;
        if(c=='F'){
            int x,h;
            cin>>x>>h;
            int lo=findpos(h);
            if(n-lo+1<=x){
                update(lo,1);
 
                continue;
            }
            
            int r= lo+x-1;
            int p=find(r)+arr[r];
            
            int z=findpos(p);
            
            update(lo,1);
            update(z,-1);
            
            int cnt=r-z+1;
            
            int y=findpos(p+1)-1;
            
            int t=max(1LL,y-cnt+1);
            update(t,1);
            update(y+1,-1);
           
        }
        else{
            int l,r ;
            cin>>l>>r;
            int y=findpos(r+1);
            int x=findpos(l);
            ans.pb(y-x);
        }
    }
    for(auto a:ans)cout<<a<<endl;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 5028 KB Output is correct