Template/template.hpp

• View this file on GitHub
• Last update: 2024-04-26 03:18:17+09:00
• Include: #include "Template/template.hpp"

Verified with

• Verify/AOJ_1595.test.cpp
• Verify/AOJ_DSL_1_B.test.cpp
• Verify/AOJ_DSL_2_D.test.cpp
• Verify/AOJ_GRL_6_A.test.cpp
• Verify/LC_area_of_union_of_rectangles.test.cpp
• Verify/LC_associative_array.test.cpp
• Verify/LC_bernoulli_number.test.cpp
• Verify/LC_biconnected_components.test.cpp
• Verify/LC_binomial_coefficient.test.cpp
• Verify/LC_bipartitematching.test.cpp
• Verify/LC_bitwise_and_convolution.test.cpp
• Verify/LC_bitwise_xor_convolution.test.cpp
• Verify/LC_cartesian_tree.test.cpp
• Verify/LC_chromatic_number.test.cpp
• Verify/LC_convolution_mod.test.cpp
• Verify/LC_convolution_mod_1000000007.test.cpp
• Verify/LC_convolution_mod_2.test.cpp
• Verify/LC_counting_primes.test.cpp
• Verify/LC_cycle_detection.test.cpp
• Verify/LC_cycle_detection_undirected.test.cpp
• Verify/LC_deque_operate_all_composite.test.cpp
• Verify/LC_discrete_logarithm_mod.test.cpp
• Verify/LC_dynamic_tree_vertex_add_path_sum.test.cpp
• Verify/LC_dynamic_tree_vertex_add_subtree_sum.test.cpp
• Verify/LC_dynamic_tree_vertex_set_path_composite.test.cpp
• Verify/LC_enumerate_cliques.test.cpp
• Verify/LC_enumerate_palindromes.test.cpp
• Verify/LC_enumerate_primes.test.cpp
• Verify/LC_exp_of_formal_power_series.test.cpp
• Verify/LC_factorize.test.cpp
• Verify/LC_find_linear_recurrence.test.cpp
• Verify/LC_frequency_table_of_tree_distance.test.cpp
• Verify/LC_gcd_convolution.test.cpp
• Verify/LC_general_weighted_matching.test.cpp
• Verify/LC_hafnian_of_matrix.test.cpp
• Verify/LC_inv_of_formal_power_series.test.cpp
• Verify/LC_kth_root_integer.test.cpp
• Verify/LC_kth_term_of_linearly_recurrent_sequence.test.cpp
• Verify/LC_lca.test.cpp
• Verify/LC_lca_2.test.cpp
• Verify/LC_lcm_convolution.test.cpp
• Verify/LC_line_add_get_min.test.cpp
• Verify/LC_log_of_formal_power_series.test.cpp
• Verify/LC_manhattanmst.test.cpp
• Verify/LC_many_aplusb.test.cpp
• Verify/LC_many_factorials.test.cpp
• Verify/LC_matrix_det.test.cpp
• Verify/LC_matrix_product.test.cpp
• Verify/LC_maximum_independent_set.test.cpp
• Verify/LC_min_cost_b_flow.test.cpp
• Verify/LC_multipoint_evaluation.test.cpp
• Verify/LC_multivariate_convolution.test.cpp
• Verify/LC_multivariate_convolution_cyclic.test.cpp
• Verify/LC_nim_product_64.test.cpp
• Verify/LC_number_of_substrings.test.cpp
• Verify/LC_partition_function.test.cpp
• Verify/LC_persistent_unionfind.test.cpp
• Verify/LC_point_add_range_sum.test.cpp
• Verify/LC_point_add_rectangle_sum.test.cpp
• Verify/LC_point_set_range_composite.test.cpp
• Verify/LC_point_set_range_sort_range_composite.test.cpp
• Verify/LC_polynomial_interpolation.test.cpp
• Verify/LC_polynomial_taylor_shift.test.cpp
• Verify/LC_pow_of_formal_power_series.test.cpp
• Verify/LC_predecessor_problem.test.cpp
• Verify/LC_prefix_substring_lcs.test.cpp
• Verify/LC_product_of_polynomial_sequence.test.cpp
• Verify/LC_queue_operate_all_composite.test.cpp
• Verify/LC_range_affine_range_sum.test.cpp
• Verify/LC_range_chmin_chmax_add_range_sum.test.cpp
• Verify/LC_range_kth_smallest-2.test.cpp
• Verify/LC_range_kth_smallest.test.cpp
• Verify/LC_rectangle_sum.test.cpp
• Verify/LC_scc.test.cpp
• Verify/LC_segment_add_get_min.test.cpp
• Verify/LC_shift_of_sampling_points_of_polynomial.test.cpp
• Verify/LC_sparse_matrix_det.test.cpp
• Verify/LC_static_range_frequency.test.cpp
• Verify/LC_static_range_inversions_query.test.cpp
• Verify/LC_static_range_lis_query.test.cpp
• Verify/LC_static_range_sum.test.cpp
• Verify/LC_static_rectangle_add_rectangle_sum.test.cpp
• Verify/LC_staticrmq-2.test.cpp
• Verify/LC_staticrmq.test.cpp
• Verify/LC_stirling_number_of_the_first_kind.test.cpp
• Verify/LC_stirling_number_of_the_first_kind_small_p_large_n.test.cpp
• Verify/LC_stirling_number_of_the_second_kind.test.cpp
• Verify/LC_stirling_number_of_the_second_kind_small_p_large_n.test.cpp
• Verify/LC_subset_convolution.test.cpp
• Verify/LC_suffixarray.test.cpp
• Verify/LC_sum_of_exponential_times_polynomial.test.cpp
• Verify/LC_sum_of_exponential_times_polynomial_limit.test.cpp
• Verify/LC_sum_of_floor_of_linear.test.cpp
• Verify/LC_sum_of_totient_function.test.cpp
• Verify/LC_system_of_linear_equations.test.cpp
• Verify/LC_two_edge_connected_components.test.cpp
• Verify/LC_two_sat.test.cpp
• Verify/LC_unionfind.test.cpp
• Verify/LC_vertex_add_path_sum.test.cpp
• Verify/LC_vertex_add_range_contour_sum_on_tree.test.cpp
• Verify/LC_vertex_set_path_composite.test.cpp
• Verify/LC_zalgorithm.test.cpp
• Verify/YUKI_1080.test.cpp
• Verify/YUKI_1112.test.cpp
• Verify/YUKI_1781.test.cpp
• Verify/YUKI_2097.test.cpp
• Verify/YUKI_310.test.cpp
• Verify/YUKI_901.test.cpp

Code

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b-1); i >= (int)(a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())

using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;

template <typename T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T, typename U> T ceil(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U> T floor(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T> int popcnt(T x) {
    return __builtin_popcountll(x);
}
template <typename T> int topbit(T x) {
    return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <typename T> int lowbit(T x) {
    return (x == 0 ? -1 : __builtin_ctzll(x));
}

#ifdef LOCAL
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define show(...) true
#endif
template <typename T> void _show(int i, T name) {
    cerr << '\n';
}
template <typename T1, typename T2, typename... T3>
void _show(int i, const T1 &a, const T2 &b, const T3 &...c) {
    for (; a[i] != ',' && a[i] != '\0'; i++)
        cerr << a[i];
    cerr << ":" << b << " ";
    _show(i + 1, a, c...);
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << "P(" << p.first << ", " << p.second << ")";
    return os;
}
template <typename T, template <class> class C>
ostream &operator<<(ostream &os, const C<T> &v) {
    os << "[";
    for (auto d : v)
        os << d << ", ";
    os << "]";
    return os;
}

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

using namespace std;

#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b-1); i >= (int)(a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())

using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;

template <typename T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T, typename U> T ceil(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U> T floor(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T> int popcnt(T x) {
    return __builtin_popcountll(x);
}
template <typename T> int topbit(T x) {
    return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <typename T> int lowbit(T x) {
    return (x == 0 ? -1 : __builtin_ctzll(x));
}

#ifdef LOCAL
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define show(...) true
#endif
template <typename T> void _show(int i, T name) {
    cerr << '\n';
}
template <typename T1, typename T2, typename... T3>
void _show(int i, const T1 &a, const T2 &b, const T3 &...c) {
    for (; a[i] != ',' && a[i] != '\0'; i++)
        cerr << a[i];
    cerr << ":" << b << " ";
    _show(i + 1, a, c...);
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << "P(" << p.first << ", " << p.second << ")";
    return os;
}
template <typename T, template <class> class C>
ostream &operator<<(ostream &os, const C<T> &v) {
    os << "[";
    for (auto d : v)
        os << d << ", ";
    os << "]";
    return os;
}

Back to top page