template/template.hpp

• View this file on GitHub
• Last update: 2022-07-17 16:00:30+09:00
• Include: #include "template/template.hpp"

Verified with

• algebra/test/matrix_det.test.cpp
• algebra/test/matrix_product.test.cpp
• convolution/test/bitwise_and_convolution.test.cpp
• convolution/test/bitwise_or_convolution.test.cpp
• convolution/test/exp_of_set_power_series.test.cpp
• convolution/test/subset_convolution.test.cpp
• convolution/test/subset_convolution_exp_log.test.cpp
• data_structure/test/1891.test.cpp
• data_structure/test/dsl_2_g.test.cpp
• data_structure/test/point_add_range_sum.test.cpp
• data_structure/test/point_add_rectangle_sum.test.cpp
• data_structure/test/point_set_range_composite.test.cpp
• data_structure/test/queue_operate_all_composite.test.cpp
• data_structure/test/range_affine_range_sum.test.cpp
• data_structure/test/range_kth_smallest.test.cpp
• data_structure/test/rectangle_sum.test.cpp
• data_structure/test/sparse_segment_tree.test.cpp
• data_structure/test/static_range_frequency.test.cpp
• data_structure/test/staticrmq.test.cpp
• data_structure/test/unionfind.test.cpp
• data_structure/test/wavelet_matrix.test.cpp
• graph/test/jump_on_tree.test.cpp
• graph/test/lca.test.cpp
• graph/test/scc.test.cpp
• graph/test/two_edge_connected_components.test.cpp
• graph/test/two_sat.test.cpp
• graph/test/vertex_add_path_sum.test.cpp
• graph/test/vertex_add_subtree_sum.test.cpp
• graph/test/vertex_set_path_composite.test.cpp
• number_theory/test/convolution_mod.test.cpp
• polynomial/test/exp_of_formal_power_series.test.cpp
• polynomial/test/exp_of_formal_power_series_acl.test.cpp
• polynomial/test/inv_of_formal_power_series.test.cpp
• polynomial/test/inv_of_formal_power_series_acl.test.cpp
• polynomial/test/kth_term_of_linearly_recurrent_sequence.test.cpp
• polynomial/test/log_of_formal_power_series.test.cpp
• polynomial/test/log_of_formal_power_series_acl.test.cpp
• polynomial/test/polynomial_taylor_shift.test.cpp
• polynomial/test/pow_of_formal_power_series.test.cpp
• polynomial/test/pow_of_formal_power_series_acl.test.cpp
• string/test/zalgorithm.test.cpp

Code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64) x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64) x;
    return os;
}

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;

#line 1 "template/template.hpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64) x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64) x;
    return os;
}

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;

Back to top page