test/verify/yosupo-static-range-sum.test.cpp

View this file on GitHub
Last update: 2025-08-16 01:23:21+09:00
Problem: https://judge.yosupo.jp/problem/static_range_sum

Depends on

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/static_range_sum

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

#include "../../dp/cumulative-sum.hpp"

int main() {
  int n, q;
  cin >> n >> q;
  CumulativeSum< int64 > cs(n);
  for(int i = 0; i < n; i++) {
    int x;
    cin >> x;
    cs.add(i, x);
  }
  cs.build();
  for(int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    cout << cs.fold(l, r) << "\n";
  }
}

#line 1 "test/verify/yosupo-static-range-sum.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/static_range_sum

#line 1 "template/template.hpp"
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif

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(std::forward<F>(f)) {}

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

template <typename F>
inline decltype(auto) MFP(F&& f) {
  return FixPoint<F>{std::forward<F>(f)};
}
#line 4 "test/verify/yosupo-static-range-sum.test.cpp"

#line 1 "dp/cumulative-sum.hpp"
template <class T>
struct CumulativeSum {
  vector<T> data;

  CumulativeSum() = default;

  explicit CumulativeSum(size_t sz) : data(sz + 1, 0) {}

  void add(int k, const T& x) { data[k + 1] += x; }

  void build() {
    for (int i = 1; i < data.size(); i++) {
      data[i] += data[i - 1];
    }
  }

  T fold(int r) const {
    if (r < 0) return 0;
    return data[min(r, (int)data.size() - 1)];
  }

  T fold(int l, int r) const { return fold(r) - fold(l); }
};
#line 6 "test/verify/yosupo-static-range-sum.test.cpp"

int main() {
  int n, q;
  cin >> n >> q;
  CumulativeSum< int64 > cs(n);
  for(int i = 0; i < n; i++) {
    int x;
    cin >> x;
    cs.add(i, x);
  }
  cs.build();
  for(int i = 0; i < q; i++) {
    int l, r;
    cin >> l >> r;
    cout << cs.fold(l, r) << "\n";
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	5 ms	4 MB
g++	max_random_00	AC	138 ms	7 MB
g++	max_random_01	AC	126 ms	7 MB
g++	max_random_02	AC	124 ms	7 MB
g++	max_random_03	AC	123 ms	7 MB
g++	max_random_04	AC	123 ms	7 MB
g++	random_00	AC	102 ms	6 MB
g++	random_01	AC	106 ms	7 MB
g++	random_02	AC	72 ms	4 MB
g++	random_03	AC	35 ms	7 MB
g++	random_04	AC	39 ms	6 MB
clang++	example_00	AC	5 ms	4 MB
clang++	max_random_00	AC	123 ms	7 MB
clang++	max_random_01	AC	126 ms	7 MB
clang++	max_random_02	AC	129 ms	7 MB
clang++	max_random_03	AC	127 ms	7 MB
clang++	max_random_04	AC	125 ms	7 MB
clang++	random_00	AC	102 ms	6 MB
clang++	random_01	AC	115 ms	7 MB
clang++	random_02	AC	78 ms	4 MB
clang++	random_03	AC	35 ms	7 MB
clang++	random_04	AC	38 ms	6 MB