Halc's Library

This documentation is automatically generated by online-judge-tools/verification-helper

---

Project maintained by halc-git Hosted on GitHub Pages — Theme by mattgraham

Template/Util.hpp

• View this file on GitHub
• Last update: 2024-10-22 20:46:56+09:00
• Include: #include "Template/Util.hpp"

Required by

• Template/Template.hpp

Verified with

• Verify/verify-aoj-alds/alds1_14_b-rollinghash.test.cpp
• Verify/verify-aoj-grl/grl_1_a.test.cpp
• Verify/verify-aoj/2667.test.cpp
• Verify/verify-yosupo-datastructure/associative_array.test.cpp
• Verify/verify-yosupo-datastructure/deque_operate_all_composite.test.cpp
• Verify/verify-yosupo-datastructure/point_add_range_sum.test.cpp
• Verify/verify-yosupo-datastructure/point_set_range_composite.test.cpp
• Verify/verify-yosupo-datastructure/predecessor_problem-fenwick_tree.test.cpp
• Verify/verify-yosupo-datastructure/predecessor_problem-segment_tree.test.cpp
• Verify/verify-yosupo-datastructure/queue_operate_all_composite.test.cpp
• Verify/verify-yosupo-datastructure/range_affine_point_get.test.cpp
• Verify/verify-yosupo-datastructure/range_affine_range_sum.test.cpp
• Verify/verify-yosupo-datastructure/static_range_inversions_query-mo.test.cpp
• Verify/verify-yosupo-datastructure/static_range_sum-disjoint_sparse_table.test.cpp
• Verify/verify-yosupo-datastructure/staticrmq.test.cpp
• Verify/verify-yosupo-datastructure/unionfind.test.cpp
• Verify/verify-yosupo-enumerative-combinatorics/binomial_coefficient_prime_mod.test.cpp
• Verify/verify-yosupo-new/sum_of_multiplicative_function-black_algorithm.test.cpp
• Verify/verify-yosupo-new/sum_of_multiplicative_function-min25_sieve.test.cpp
• Verify/verify-yosupo-number-theory/enumerate_primes.test.cpp
• Verify/verify-yosupo-number-theory/enumerate_quotients.test.cpp
• Verify/verify-yosupo-number-theory/sum_of_totient_function.test.cpp
• Verify/verify-yosupo-string/enumerate_palindromes-rollinghash.test.cpp
• Verify/verify-yosupo-string/enumerate_palindromes.test.cpp
• Verify/verify-yosupo-string/zalgorithm-rollinghash.test.cpp
• Verify/verify-yosupo-string/zalgorithm.test.cpp
• Verify/verify-yosupo-tree/lca-hldecomposition.test.cpp
• Verify/verify-yosupo-tree/point_set_tree_path_composite_sum_fixed_root.test.cpp
• Verify/verify-yosupo-tree/vertex_add_path_sum.test.cpp
• Verify/verify-yosupo-tree/vertex_add_subtree_sum.test.cpp
• Verify/verify-yosupo-tree/vertex_set_path_composite.test.cpp
• Verify/verify-yuki/1092.test.cpp
• Verify/verify-yuki/117.test.cpp
• Verify/verify-yuki/2338.test.cpp
• Verify/verify-yuki/235.test.cpp
• Verify/verify-yuki/399.test.cpp
• Verify/verify-yuki/650.test.cpp
• Verify/verify-yuki/900.test.cpp
• Verify/verify-yuki/901.test.cpp

Code

#pragma once
#include <array>
#include <climits>
#include <cstdint>
#include <functional>
#include <limits>
#include <queue>
#include <vector>
using ll = int64_t;
using ld = long double;
using ull = uint64_t;
using uint = uint32_t;
using pll = std::pair<ll, ll>;
using pii = std::pair<int32_t, int32_t>;
using vl = std::vector<ll>;
using vvl = std::vector<std::vector<ll>>;
using pdd = std::pair<ld, ld>;
using tuplis = std::array<ll, 3>;
template <class T>
using pq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
constexpr ll LINF = (1LL << 62) - (1LL << 31);
constexpr int32_t INF = INT_MAX >> 1;
constexpr ll MINF = 1LL << 40;
constexpr ld DINF = std::numeric_limits<ld>::infinity();
constexpr int32_t MODD = 1000000007;
constexpr int32_t MOD = 998244353;
constexpr ld EPS = 1e-9;
constexpr ld PI = 3.1415926535897932;
const ll four[] = {0, 1, 0, -1, 0};
const ll eight[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    } else
        return false;
}
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    } else
        return false;
}
template <class T>
ll sum(const T &a) {
    return accumulate(std::begin(a), std::end(a), 0LL);
}
template <class T>
ld dsum(const T &a) {
    return accumulate(std::begin(a), std::end(a), 0.0L);
}
template <class T>
auto min(const T &a) {
    return *min_element(std::begin(a), std::end(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(std::begin(a), std::end(a));
}

#line 2 "Template/Util.hpp"
#include <array>
#include <climits>
#include <cstdint>
#include <functional>
#include <limits>
#include <queue>
#include <vector>
using ll = int64_t;
using ld = long double;
using ull = uint64_t;
using uint = uint32_t;
using pll = std::pair<ll, ll>;
using pii = std::pair<int32_t, int32_t>;
using vl = std::vector<ll>;
using vvl = std::vector<std::vector<ll>>;
using pdd = std::pair<ld, ld>;
using tuplis = std::array<ll, 3>;
template <class T>
using pq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
constexpr ll LINF = (1LL << 62) - (1LL << 31);
constexpr int32_t INF = INT_MAX >> 1;
constexpr ll MINF = 1LL << 40;
constexpr ld DINF = std::numeric_limits<ld>::infinity();
constexpr int32_t MODD = 1000000007;
constexpr int32_t MOD = 998244353;
constexpr ld EPS = 1e-9;
constexpr ld PI = 3.1415926535897932;
const ll four[] = {0, 1, 0, -1, 0};
const ll eight[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    } else
        return false;
}
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    } else
        return false;
}
template <class T>
ll sum(const T &a) {
    return accumulate(std::begin(a), std::end(a), 0LL);
}
template <class T>
ld dsum(const T &a) {
    return accumulate(std::begin(a), std::end(a), 0.0L);
}
template <class T>
auto min(const T &a) {
    return *min_element(std::begin(a), std::end(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(std::begin(a), std::end(a));
}

Back to top page