Submission #674123

#	Time	Username	Problem	Language	Result	Execution time	Memory
674123		DwightKSchrute	Growing Trees (BOI11_grow)	C++17	30 / 100	1095 ms	1456 KiB

grow

/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map


template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
struct seg{
    int l,r,m;
    seg *lp=0,*rp=0;
    int sum=0,prop=0;

    seg(int l,int r):l(l),r(r),m((l+r)/2){}
    void expand(){
        if(!lp)lp=new seg(l,m);
        if(!rp)rp=new seg(m,r);
    }

    void add(int x){
        sum+=x*(r-l);//x*(r-l)??
        prop+=x;
    }
    void push(){
        lp->add(prop);
        rp->add(prop);
        prop=0;
    }

    void upd(int a,int b,int v){//add v to[a,b)
        if(b<=l || r<=a)
            return;
        if(a<=l && r<=b){
            add(v);
            return;
        }
        expand();
        push();
        lp->upd(a,b,v);
        rp->upd(a,b,v);

        sum = lp->sum + rp->sum;
    }

    int qur(int a,int b){ //sum query
        if(b<=l || r<=a)
            return 0;
        if(a<=l && r<=b)
            return sum;
        expand();
        push();

        return lp->qur(a,b) + rp->qur(a,b);
    }

    int first_pref_greater_equal(int k){
        if(l+1==r)
            return l;

        expand();
        push();

        if(lp->sum>=k)
            return lp->first_pref_greater_equal(k);
        else
            return rp->first_pref_greater_equal(k-lp->sum);
    }
};


void solve() {
    int n,q;
    cin >> n >> q;

    vi a(n);
    read(a);
    sort(all(a));

    while(q--){
        char op;
        cin >> op;
        if(op=='C'){
            int l,r;
            cin >> l >> r;

            int up_to_r = upper_bound(all(a),r)-a.begin()-1;
            int up_to_l1 = upper_bound(all(a),l-1)-a.begin()-1;

            cout << up_to_r - up_to_l1 << "\n";
            continue;
        }

        int h,c;
        cin >> c >> h;

        for(int i= lower_bound(all(a),h)-a.begin(); i<n && c; i++)
            if(a[i]>=h)
                a[i]++,c--;
        sort(all(a));
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 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