제출 #1146173

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1146173		fryingduc	Sterilizing Spray (JOI15_sterilizing)	C++20	100 / 100	131 ms	5192 KiB

sterilizing

#include "bits/stdc++.h"
using namespace std;

#ifdef duc_debug
#include "bits/debug.h"
#else
#define debug(...)
#endif

const int maxn = 1e5 + 5;
int n, q, k, a[maxn];
long long ps[maxn];

long long tree[maxn << 2];
int tree_mx[maxn << 2];
void build(int ind = 1, int l = 1, int r = n) {
  if (l == r) {
    tree[ind] = tree_mx[ind] = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(ind << 1, l, mid);
  build(ind << 1 | 1, mid + 1, r);
  tree[ind] = tree[ind << 1] + tree[ind << 1 | 1];
  tree_mx[ind] = max(tree_mx[ind << 1], tree_mx[ind << 1 | 1]);
}

void update(int x, int y, int ind = 1, int l = 1, int r = n) {
  if (l > y || r < x || tree_mx[ind] == 0) return;
  if (l == r) {
    tree[ind] /= k;
    tree_mx[ind] /= k;
    return;
  }
  int mid = (l + r) >> 1;
  update(x, y, ind << 1, l, mid);
  update(x, y, ind << 1 | 1, mid + 1, r);
  tree[ind] = tree[ind << 1] + tree[ind << 1 | 1];
  tree_mx[ind] = max(tree_mx[ind << 1], tree_mx[ind << 1 | 1]);
}

void assign(int pos, int val, int ind = 1, int l = 1, int r = n) {
  if (l == r) {
    tree[ind] = tree_mx[ind] = val;
    return;
  }
  int mid = (l + r) >> 1;
  if (pos <= mid) {
    assign(pos, val, ind << 1, l, mid);
  } else {
    assign(pos, val, ind << 1 | 1, mid + 1, r);
  }
  tree[ind] = tree[ind << 1] + tree[ind << 1 | 1];
  tree_mx[ind] = max(tree_mx[ind << 1], tree_mx[ind << 1 | 1]);
}

long long get(int x, int y, int ind = 1, int l = 1, int r = n) {
  if (l > y || r < x) return 0;
  if (x <= l and r <= y) {
    return tree[ind];
  }
  int mid = (l + r) >> 1;
  return get(x, y, ind << 1, l, mid) + get(x, y, ind << 1 | 1, mid + 1, r);
}

void solve() {
  cin >> n >> q >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    ps[i] = ps[i - 1] + a[i];
  }
  build();
  while (q--) {
    int op; cin >> op;
    if (op == 1) {
      int pos, val; cin >> pos >> val;
      assign(pos, val);
    } else if (op == 2) {
      int l, r; cin >> l >> r;
      if (k > 1) {
        update(l, r);
      }
    } else {
      int l, r; cin >> l >> r;
      cout << get(l, r) << '\n';
    }
  }
}

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  solve();

  return 0;
}

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