kyopro/test/cumulative-sum_yosupo-judge.test.cpp

View this file on GitHub
Last update: 2022-07-20 00:04:43+09:00
Problem: https://judge.yosupo.jp/problem/static_range_sum

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/static_range_sum"

#include "../library/template/template.cpp"

#include "../library/others/cumulative-sum.cpp"

int main() {

    int n, q;
    scanf("%d%d", &n, &q);
    vector<ll> a(n);
    rep(i, n)scanf("%lld", &a[i]);
    cumulativesum<ll> cs(a, 0, plus<ll>(), minus<ll>());
    while (q--) {
        int l, r;
        scanf("%d%d", &l, &r);
        printf("%lld\n", cs.query(l, r));
    }

	Please AC;
}

#line 1 "kyopro/test/cumulative-sum_yosupo-judge.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/static_range_sum"

#line 1 "kyopro/library/template/template.cpp"
/*
* @title template
* @docs kyopro/docs/template.md
*/


/*
このコード、と～おれ!
Be accepted!
∧＿∧　
（｡･ω･｡)つ━☆・*。
⊂　　 ノ 　　　・゜+.
　しーＪ　　　°。+ *´¨)
 　　　　　　　　　.· ´¸.·*´¨) ¸.·*¨)
		  　　　　　　　　　　(¸.·´ (¸.·'* ☆
*/

#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#include <iomanip>
#include <set>
#include <stack>
#include <bitset>
#include <array>
#include <chrono>

//#pragma GCC target("arch=skylake-avx512")
//#pragma GCC target ("avx2")
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define repeat(i, n, m) for(int i = n; i < (m); ++i)
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a)
#define printLdb(a) printf("%.50Lf\n", a)
#define printdbd(a) printf("%.16lf\n", a)
#define prints(s) printf("%s\n", s.c_str())
#define all(x) (x).begin(), (x).end()
#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)
#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)
#define Please return
#define AC 0
#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d))

using ll = long long;
using ull = unsigned long long;

constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1e9 + 7;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-6;
const long double PI = acosl(-1.0L);

using namespace std;

void scans(string& str) {
	char c;
	str = "";
	scanf("%c", &c);
	if (c == '\n')scanf("%c", &c);
	while (c != '\n' && c != -1 && c != ' ') {
		str += c;
		scanf("%c", &c);
	}
}

void scanc(char& str) {
	char c;
	scanf("%c", &c);
	if (c == -1)return;
	while (c == '\n') {
		scanf("%c", &c);
	}
	str = c;
}

double acot(double x) {
	return PI / 2 - atan(x);
}

ll LSB(ll n) { return (n & (-n)); }

template<typename T>
inline T chmin(T& a, const T& b) {
	if (a > b)a = b;
	return a;
}

template<typename T>
inline T chmax(T& a, const T& b) {
	if (a < b)a = b;
	return a;
}

////cpp_int
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//using namespace boost::multiprecision;

//atcoder library
//#include <atcoder/all>
//using namespace atcoder;

//random_device seed_gen;
//mt19937 engine(seed_gen());
//uniform_distribution dist(-1.0, 1.0);

/*----------------------------------------------------------------------------------*/
#line 4 "kyopro/test/cumulative-sum_yosupo-judge.test.cpp"

#line 1 "kyopro/library/others/cumulative-sum.cpp"
/*
* @title 累積和
* @docs kyopro/docs/cumulative-sum.md
*/

template<typename T>
struct cumulativesum {
    vector<T> cs;
    const function<T(T, T)> rev;
    cumulativesum(const vector<T> a, const T e, const function<T(T, T)> f, const function<T(T, T)> rev) : rev(rev) {
        int siz = a.size() + 1;
        cs.assign(siz, e);
        rep(i, siz - 1)cs[i + 1] = f(cs[i], a[i]);
    }

    //0-indexed で [l, r) の和
    T query(int l, int r) {
        return rev(cs[r], cs[l]);
    }
};
#line 6 "kyopro/test/cumulative-sum_yosupo-judge.test.cpp"

int main() {

    int n, q;
    scanf("%d%d", &n, &q);
    vector<ll> a(n);
    rep(i, n)scanf("%lld", &a[i]);
    cumulativesum<ll> cs(a, 0, plus<ll>(), minus<ll>());
    while (q--) {
        int l, r;
        scanf("%d%d", &l, &r);
        printf("%lld\n", cs.query(l, r));
    }

	Please AC;
}