Submission #389371

#	Time	Username	Problem	Language	Result	Execution time	Memory
389371		VROOM_VARUN	Sterilizing Spray (JOI15_sterilizing)	C++14	100 / 100	176 ms	9488 KiB

sterilizing

/*
ID: varunra2
LANG: C++
TASK: spray
*/

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

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define int long long

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

struct fenwick {
  VI bit;
  int n;
  void init(int _n) {
    n = _n;
    bit.resize(n + 1, 0);
  }

  int qry(int ind) {
    int ret = 0;
    ind++;
    while (ind > 0) {
      ret += bit[ind];
      ind -= (ind & -ind);
    }
    return ret;
  }

  void upd(int ind, int val) {
    ind++;
    while (ind <= n) {
      bit[ind] += val;
      ind += (ind & -ind);
    }
  }

  int qry(int l, int r) { return qry(r) - qry(l - 1); }
};

int32_t main() {
  // #ifndef ONLINE_JUDGE
  // freopen("spray.in", "r", stdin);
  // freopen("spray.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  int n, q, k;
  cin >> n >> q >> k;
  VI vals(n);

  trav(x, vals) cin >> x;

  SETI use;

  rep(i, 0, n) if (vals[i] > 0) use.insert(i);

  fenwick bit;

  bit.init(n);

  for (int i = 0; i < n; i++) {
    bit.upd(i, vals[i]);
  }

  while (q--) {
    int type;
    cin >> type;
    if (type == 1) {
      int a, b;
      cin >> a >> b;
      a--;
      bit.upd(a, b - vals[a]);
      if (vals[a] == 0 and b > 0) {
        use.insert(a);
      }
      if (b == 0 and vals[a] > 0) {
        use.erase(use.find(a));
      }
      vals[a] = b;
    } else if (type == 2) {
      int l, r;
      cin >> l >> r;
      if (k == 1) continue;
      l--, r--;
      auto it = use.lower_bound(l);
      while (it != use.end()) {
        int ind = *it;
        if (ind > r) break;
        bit.upd(ind, vals[ind] / k - vals[ind]);
        vals[ind] /= k;
        it++;
        if (vals[ind] == 0) {
          SETI::iterator prv = it;
          prv--;
          use.erase(prv);
        }
      }
    } else {
      int l, r;
      cin >> l >> r;
      l--, r--;
      cout << bit.qry(l, r) << '\n';
    }
  }

  return 0;
}

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