제출 #1177457

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177457		Tymond	Sterilizing Spray (JOI15_sterilizing)	C++20	100 / 100	1241 ms	8480 KiB

sterilizing

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

const int MAXN = 1e5 + 7;
const int BASE = (1 << 17);
ll tree[2 * BASE + 7];//suma na przedziale
pll treeMx[2 * BASE + 7];
ll A[MAXN];
int n, q, K;

pii merge(pii x, pii y){
    if(x.fi >= y.fi){
        return x;
    }
    return y;
}

void init(){
    for(int i = 1; i <= n; i++){
        tree[i + BASE]  = A[i];
        treeMx[i + BASE] = mp(A[i], i);
    }
    
    for(int i = BASE - 1; i >= 1; i--){
        tree[i] = tree[2 * i] + tree[2 * i + 1];
        treeMx[i] = merge(treeMx[2 * i], treeMx[2 * i + 1]);
    }
}

void upd(int ind, int val){
    ind += BASE;
    tree[ind] = val;
    treeMx[ind] = mp(val, ind - BASE);
    ind /= 2;
    while(ind > 0){
        tree[ind] = tree[2 * ind] + tree[2 * ind + 1];
        treeMx[ind] = merge(treeMx[2 * ind], treeMx[2 * ind + 1]);
        ind /= 2;
    }
}

ll querySum(int v, int l, int p, int a, int b){
    if(p < a || b < l){
        return 0LL;
    }
    
    if(a <= l && p <= b){
        return tree[v];
    }
    int mid = (l + p) / 2;
    return querySum(2 * v, l, mid, a, b) + querySum(2 * v + 1, mid + 1, p, a, b);
}

pii getMx(int v, int l, int p, int a, int b){
    if(p < a || b < l){
        return mp(-1, 0);
    }
    
    if(a <= l && p <= b){
        return treeMx[v];
    }
    int mid = (l + p) / 2;
    return merge(getMx(2 * v, l, mid, a, b), getMx(2 * v + 1, mid + 1, p, a, b));
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    
    cin >> n >> q >> K;
    for(int i = 1; i <= n; i++){
        cin >> A[i];
    }
    
    init();
    while(q--){
        ll t, a, b;
        cin >> t >> a >> b;
        if(t == 1){
            upd(a, b);
        }else if(t == 3){
            cout << querySum(1, 0, BASE - 1, a, b) << '\n';
        }else{
            vector<pii> newVal = {};
            pii mx = getMx(1, 0, BASE - 1, a, b);
            while(mx.fi != -1 && (mx.fi / K) != mx.fi){
                newVal.pb(mp(mx.se, mx.fi / K));
                upd(mx.se, -1);
                mx = getMx(1, 0, BASE - 1, a, b);
            }
            
            for(auto& ele : newVal){
                upd(ele.fi, ele.se);
            }
        }
    }
    
    return 0;
}

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