Submission #752831

#	Time	Username	Problem	Language	Result	Execution time	Memory
752831		Tien_Noob	Sterilizing Spray (JOI15_sterilizing)	C++17	10 / 100	300 ms	9616 KiB

sterilizing

#include <bits/stdc++.h>
#define ll long long
#define sp << " "
#define faster ios_base::sync_with_stdio(0); cin.tie(0);  .tie(0);
using namespace std;
ll n, q, k, a[100005], t, l, r;
set<ll>::iterator il, ir;
ll st[400005], tmp;
set<ll> s;
bool still;
vector<ll> v;

void update(ll id, ll l , ll r, ll i, ll v){
    if(i<l||r<i) return ;
    if(l==r){
        st[id]=v;
        return ;
    }
    ll mid=(l+r)/2;
    update(id*2,l,mid,i,v);
    update(id*2+1,mid+1,r,i,v);
    st[id]=st[id*2]+st[id*2+1];
}

void update_divk(ll id, ll l , ll r, ll i){
    if(i<l||r<i) return ;
    if(l==r){
        st[id]=st[id]/k;
        if(st[id]>0) still=true;
        return ;
    }
    ll mid=(l+r)/2;
    update_divk(id*2,l,mid,i);
    update_divk(id*2+1,mid+1,r,i);
    st[id]=st[id*2]+st[id*2+1];
}

ll getsum(ll id, ll l, ll r, ll u, ll v){
    if(v<l||r<u) return 0;
    if(u<=l&&r<=v) return st[id];
    ll mid=(l+r)/2;
    return getsum(id*2,l,mid,u,v)+getsum(id*2+1,mid+1,r,u,v);
}
int main(){
    //faster;
    cin >> n >> q >> k;
    for(ll i = 1; i <= n; i++){
        cin >> a[i];
        if(a[i]>=0) s.insert(i);
        update(1,1,n,i,a[i]);
    }
    while(q--){
        cin >> t >> l >> r;
        if(t==1) update(1,1,n,l,r);
        else if(t==2&&k!=1){
            while(true){
                il = s.lower_bound(l);
                if(il==s.end()||*il>r){
                    break;
                }
                still=false;
                update_divk(1,1,n,*il);
                if(still) v.push_back(*il);
                s.erase(*il);
            }
            while(v.size()>0){
                s.insert(v.back());
                v.pop_back();
            }
        }
        else if(t==3) cout << getsum(1,1,n,l,r) << "\n";
    }
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 75