test/verify/aoj-dsl-2-b.test.cpp

• View this file on GitHub
• Last update: 2024-05-01 23:44:47+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_B

Depends on

• Binary-Indexed-Tree(BIT) (structure/others/binary-indexed-tree.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_B

#include "../../template/template.hpp"

#include "../../structure/others/binary-indexed-tree.hpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  BinaryIndexedTree< int > bit(N);
  while(Q--) {
    int T, X, Y;
    cin >> T >> X >> Y;
    if(T == 0) bit.apply(X - 1, Y);
    else cout << bit.prod(X - 1, Y) << "\n";
  }
}

#line 1 "test/verify/aoj-dsl-2-b.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_B

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/aoj-dsl-2-b.test.cpp"

#line 1 "structure/others/binary-indexed-tree.hpp"
/**
 * @brief Binary-Indexed-Tree(BIT)
 *
 */
template <typename T>
struct BinaryIndexedTree {
 private:
  int n;
  vector<T> data;

 public:
  BinaryIndexedTree() = default;

  explicit BinaryIndexedTree(int n) : n(n) { data.assign(n + 1, T()); }

  explicit BinaryIndexedTree(const vector<T> &v)
      : BinaryIndexedTree((int)v.size()) {
    build(v);
  }

  void build(const vector<T> &v) {
    assert(n == (int)v.size());
    for (int i = 1; i <= n; i++) data[i] = v[i - 1];
    for (int i = 1; i <= n; i++) {
      int j = i + (i & -i);
      if (j <= n) data[j] += data[i];
    }
  }

  void apply(int k, const T &x) {
    for (++k; k <= n; k += k & -k) data[k] += x;
  }

  T prod(int r) const {
    T ret = T();
    for (; r > 0; r -= r & -r) ret += data[r];
    return ret;
  }

  T prod(int l, int r) const { return prod(r) - prod(l); }

  int lower_bound(T x) const {
    int i = 0;
    for (int k = 1 << (__lg(n) + 1); k > 0; k >>= 1) {
      if (i + k <= n && data[i + k] < x) {
        x -= data[i + k];
        i += k;
      }
    }
    return i;
  }

  int upper_bound(T x) const {
    int i = 0;
    for (int k = 1 << (__lg(n) + 1); k > 0; k >>= 1) {
      if (i + k <= n && data[i + k] <= x) {
        x -= data[i + k];
        i += k;
      }
    }
    return i;
  }
};
#line 6 "test/verify/aoj-dsl-2-b.test.cpp"

int main() {
  int N, Q;
  cin >> N >> Q;
  BinaryIndexedTree< int > bit(N);
  while(Q--) {
    int T, X, Y;
    cin >> T >> X >> Y;
    if(T == 0) bit.apply(X - 1, Y);
    else cout << bit.prod(X - 1, Y) << "\n";
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_small_00.in	AC	6 ms	4 MB
g++	00_small_01.in	AC	6 ms	4 MB
g++	00_small_02.in	AC	6 ms	4 MB
g++	00_small_03.in	AC	6 ms	4 MB
g++	01_rand_00.in	AC	6 ms	4 MB
g++	01_rand_01.in	AC	6 ms	4 MB
g++	01_rand_02.in	AC	6 ms	4 MB
g++	01_rand_03.in	AC	6 ms	4 MB
g++	02_slight_00.in	AC	6 ms	4 MB
g++	02_slight_01.in	AC	6 ms	4 MB
g++	02_slight_02.in	AC	7 ms	4 MB
g++	02_slight_03.in	AC	10 ms	4 MB
g++	03_biased_00.in	AC	6 ms	4 MB
g++	03_biased_01.in	AC	21 ms	4 MB
g++	03_biased_02.in	AC	21 ms	4 MB
g++	03_biased_03.in	AC	21 ms	4 MB
g++	04_maximum_00.in	AC	25 ms	4 MB
g++	04_maximum_01.in	AC	28 ms	4 MB
g++	04_maximum_02.in	AC	24 ms	4 MB
g++	04_maximum_03.in	AC	24 ms	4 MB
clang++	00_small_00.in	AC	6 ms	4 MB
clang++	00_small_01.in	AC	6 ms	4 MB
clang++	00_small_02.in	AC	6 ms	4 MB
clang++	00_small_03.in	AC	6 ms	4 MB
clang++	01_rand_00.in	AC	6 ms	4 MB
clang++	01_rand_01.in	AC	6 ms	4 MB
clang++	01_rand_02.in	AC	6 ms	4 MB
clang++	01_rand_03.in	AC	6 ms	4 MB
clang++	02_slight_00.in	AC	6 ms	4 MB
clang++	02_slight_01.in	AC	6 ms	4 MB
clang++	02_slight_02.in	AC	6 ms	4 MB
clang++	02_slight_03.in	AC	9 ms	4 MB
clang++	03_biased_00.in	AC	6 ms	4 MB
clang++	03_biased_01.in	AC	21 ms	4 MB
clang++	03_biased_02.in	AC	22 ms	4 MB
clang++	03_biased_03.in	AC	21 ms	4 MB
clang++	04_maximum_00.in	AC	24 ms	4 MB
clang++	04_maximum_01.in	AC	24 ms	4 MB
clang++	04_maximum_02.in	AC	24 ms	4 MB
clang++	04_maximum_03.in	AC	24 ms	4 MB

Back to top page