제출 #57408

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57408		Benq	Sterilizing Spray (JOI15_sterilizing)	C++14	100 / 100	333 ms	72580 KiB

sterilizing

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

template<class T, int SZ> struct BIT {
    T bit[SZ+1];
    
    BIT() { memset(bit,0,sizeof bit); }
    
    void upd(int k, T val) { // add val to index k
        for( ;k <= SZ; k += (k&-k)) bit[k] += val;
    }
    
    T query(int k) {
        T temp = 0;
        for (;k > 0;k -= (k&-k)) temp += bit[k];
        return temp;
    }
    T query(int l, int r) { return query(r)-query(l-1); } // range query [l,r]
};

BIT<ll,MX> B;
int N,Q,K,A[MX];
map<int,int> x;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> Q >> K;
    FOR(i,1,N+1) {
        cin >> A[i];
        if (A[i]) {
            B.upd(i,A[i]);
            x[i] = A[i];
        }
    }
    F0R(i,Q) {
        int S,T,U; cin >> S >> T >> U;
        if (S == 1) {
            if (A[T]) {
                B.upd(T,-A[T]);
                x.erase(T);
            }
            A[T] = U;
            if (A[T]) {
                B.upd(T,A[T]);
                x[T] = A[T];
            }
        } else if (S == 2) {
            if (K == 1) continue;
            auto it = x.lb(T);
            while (it != x.end() && it->f <= U) {
                B.upd(it->f,-it->s);
                it->s /= K; 
                A[it->f] = it->s;
                B.upd(it->f,it->s);
                it = next(it);
                if (prev(it)->s == 0) x.erase(prev(it));
            }
        } else {
            cout << B.query(T,U) << "\n";
        }
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

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