oj.uz

Submission #1101012

# Submission time Handle Problem Language Result Execution time Memory
1101012 2024-10-15T09:37:38 Z tsengang Sterilizing Spray (JOI15_sterilizing) C++14
5 / 100
 119 ms 4172 KB 
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;
struct segtree{
    int n;
    vector<ll>d;
    segtree(ll n){
        d.resize(4*n);
        build(1,1,n);
    }
    void build(ll v,ll l,ll r){
        if(l==r){
            d[v]=0;
            return;
        }
        ll m=(l+r)/2;
        build(v*2,l,m);
        build(v*2+1,m+1,r);\
        d[v]=d[v*2]+d[v*2+1];
    }
    ll query(ll v,ll l,ll r,ll L,ll R){
        if(L>R||l>R||L>r) return 0;
        if(L<=l&&r<=R){
            return d[v];
        }
        ll m=(l+r)/2;
        return query(v*2,l,m,L,R)+query(v*2+1,m+1,r,L,R);
    }
    void update(ll v,ll l,ll r,ll pos,ll val){
        if(pos<l||r<pos) return;
        if(l==r){
            d[v]=val;
            return;
        }
        ll m=(l+r)/2;
        update(v*2,l,m,pos,val);
        update(v*2,m+1,r,pos,val);
    }
};
int main() {
    ll n,q,k;
    cin >> n >> q >> k;
    ll a[n+2];
    for(ll i = 1; i <= n; i++){
        cin >> a[i];
    }
    if(n <= 3000 && q <= 3000){
        while(q--){
            ll s,x,y;
            cin >> s >> x >> y;
            if(s == 1){
                a[x] = y;
            }
            if(s == 2){
                for(ll i = x; i <= y; i++)a[i] /= k;
            }
            if(s == 3){
                ll sum = 0;
                for(ll i = x; i <= y; i++){
                    sum+=a[i];
                }
                cout << sum << '\n';
            }
        }
        return 0;
    }
    segtree gang(n);
    for(ll i = 1 ; i <= n; i++){
        gang.update(1,1,n,i,a[i]);
    }
    while(q--){
        ll s,x,y;
        cin >> s >> x >> y;
        if(s == 1){
            gang.update(1,1,n,x,y);
        }
        if(s == 3){
            cout << gang.query(1,1,n,x,y);
        }
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 4 ms 500 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 7 ms 692 KB Output is correct
10 Correct 6 ms 532 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 6 ms 340 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 75.0

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