Submission #1274548

#	Time	Username	Problem	Language	Result	Execution time	Memory
1274548		hihihihaw	Growing Trees (BOI11_grow)	C++20	0 / 100	1096 ms	2224 KiB

grow

#pragma GCC optimize("O3,unroll-loops,fast-math")    
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define pb push_back
#define pii pair<int,int>
#define sz(v) (int)v.size()
#define fi first
#define se second
#define INF 1223372036854775807
#define INF2 122337203
#define MOD 1000000007
#define cint(x) int x;cin>>x;
#define cinarr(a,n) int a[n];for (int i=0;i<n;i++) cin>>a[i];
#define coutarr(a) for (auto d:a)cout<<d<<" "; cout<<endl;
#define coutarrD(a) for (auto d:a) cout<<d.fi<<","<<d.se<<" "; cout<<endl;
#define BERKAY_TUP ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
#define ld long double
#define mid (start+end)/2
#define vvi vector<vector<int>>
int t=1;
int interactive=0;
int usaco=0;
int testCase=0;
int tree[100023];
int n,q;
void update(int l,int r,int x){
    r++;
    while (l<100023){
        tree[l]+=x;
        l+=l&-l;
    }
    while (r<100023){
        tree[r]-=x;
        r+=r&-r;
    }
}
int get(int x){
    int ans=0;
    while (x>0){
        ans+=tree[x];
        x-=x&-x;
    }
    return ans;
}
int findF(int x){
    int l=1,r=n;
    while (r>=l){
        int m=(l+r)/2;
        if (get(m)>=x) r=m-1;
        else l=m+1;
    }
    return l;
}
int findL(int x){
    x++;
    int l=1,r=n;
    while (r>=l){
        int m=(l+r)/2;
        if (get(m)>=x) r=m-1;
        else l=m+1;
    }
    return r;
}
int a[100023];
void solve(){
    cin>>n>>q;
    for (int i=0;i<n;i++){
        cin>>a[i];
    }
    sort(a,a+n);
    for (int i=1;i<=n;i++) update(i,i,a[i-1]);
    while (q--){
        char type;
        int x,h;
        cin>>type;
        cin>>x>>h;
        if (type=='F'){
            int l=findF(h);
            if (l+x-1>n){
                update(l,n,1);
            }
            else{
                int c=get(h+x-1);
                int g=findF(c);
                if (l<=g-1) update(l,g-1,1);
                x-=g-l;
                g=findL(c);
                update(g-x+1,g,1);
            }
            //for (int i=1;i<=n;i++) cout<<get(i)<<" ";
            //cout<<endl;
        }
        else{
            cout<<findL(h)-findF(x)+1<<endl;
        }
        
    }
    
   

    
}

 
 
 
 
 
 

 
int32_t main(){
    
    BERKAY_TUP;
    if (usaco){
        freopen("team.in", "r", stdin);
        freopen("team.out", "w", stdout);
    }
    if (!interactive){
    #ifdef Local
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        //freopen("wormsort.out", "w", stdout);
    #endif
    }
    if (t==1) solve();
    else{
        cin>>t;
        while (t--){testCase++;solve();}
    }
    
        
    return 0;
}

Compilation message (stderr)

grow.cpp: In function 'int32_t main()':
grow.cpp:119:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  119 |         freopen("team.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
grow.cpp:120:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  120 |         freopen("team.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10