other/type-utils.hpp

• View this file on GitHub
• Last update: 2025-09-09 18:28:28+09:00
• Include: #include "other/type-utils.hpp"

Required by

• data-structure/compress.hpp
• data-structure/hash-map-variable-length.hpp
• data-structure/lazy-segtree.hpp
• data-structure/lazy-splaytree.hpp
• Persistent Segment Tree (永続セグメント木) (data-structure/persistent-segtree.hpp)
• data-structure/range-chminmaxaddsum-segtree-beats.hpp
• data-structure/rectangle-sum.hpp
• data-structure/rectangle-union-area.hpp
• data-structure/segtree-beats.hpp
• data-structure/segtree.hpp
• data-structure/slope-trick.hpp
• data-structure/sparse-table.hpp
• data-structure/splaytree.hpp
• data-structure/union-find-with-undo.hpp
• data-structure/union-find.hpp
• debug.hpp
• dp/cumulative-sum.hpp
• dp/longest-increasing-sequence.hpp
• マンハッタン距離での最小全域木(となる辺の候補) (geometry/manhattan-mst.hpp)
• 二重頂点連結成分分解 (graph/biconnected-components.hpp)
• ブロックカット木的な (graph/block-cut-tree.hpp)
• graph/chromatic-number.hpp
• graph/cycle-detection.hpp
• Edmonds Karp(最大流) (graph/flow/edmonds-karp.hpp)
• Graph Template(グラフテンプレート) (graph/graph-template.hpp)
• Low Link(橋・関節点) (graph/lowlink.hpp)
• 最大独立集合 (graph/maximum-independent-set.hpp)
• 最小シュタイナー木 (graph/minimum-steiner-tree.hpp)
• graph/shortest-path.hpp
• 強連結成分分解(Tarjan) (graph/strongly-connected-components.hpp)
• 二重辺連結成分分解 (graph/two-edge-connected-components.hpp)
• math/factorial-large.hpp
• math/factorial.hpp
• math/linear-sieve.hpp
• math/matrix.hpp
• math/miller-rabin.hpp
• math/mod-log.hpp
• math/mod-pow.hpp
• math/mod-sqrt.hpp
• math/pollard-rho.hpp
• math/primitive-root.hpp
• number-theory/divisor-multiple-transform.hpp
• number-theory/enumerate-primes.hpp
• number-theory/enumerate-quotients.hpp
• number-theory/gcd-convolution.hpp
• Kth Root (Integer) (number-theory/kth-root-integer.hpp)
• number-theory/lcm-convolution.hpp
• other/fastio.hpp
• グリッドの回転・転置・拡大 (other/grid-rotate-expansion.hpp)
• n次元のインデックスを列挙するためのイテレータ (other/n-dim-enum.hpp)
• other/range-xor.hpp
• タイマー (other/timer.hpp)
• Two Satisfiability(2-SAT) (other/twosat.hpp)
• poly/bostan-mori.hpp
• poly/formal-power-series.hpp
• Polynomial Taylor Shift(平行移動) (poly/poly-taylor-shift.hpp)
• poly/shift-of-sampling-points.hpp
• 冪乗和の列挙 (poly/sum-of-powers.hpp)
• 乱数 (rng.hpp)
• set-function/fast-hadamard-transform.hpp
• set-function/xor-convolution.hpp
• Aho-Corasick (string/aho-corasick.hpp)
• string/run-length-encoding.hpp
• string/wildcard-pattern-matching.hpp
• template.hpp
• 指定された頂点たちの最小共通祖先関係を保って木を圧縮してできる補助的な木 (tree/auxiliary-tree.hpp)
• tree/cartesian-tree.hpp
• tree/euler-tour.hpp
• Heavy Light Decomposition (tree/heavy-light-decomposition.hpp)
• tree/rerooting.hpp
• tree/tree-diameter.hpp
• tree/tree-of-merging-process.hpp
• tree/tree-query.hpp

Verified with

• test/aoj/1040.test.cpp
• test/aoj/1508.test.cpp
• test/aoj/2873.test.cpp
• test/aoj/3022.test.cpp
• test/aoj/GRL_3_A.test.cpp
• test/aoj/GRL_3_A_2.test.cpp
• test/aoj/GRL_3_B.test.cpp
• test/aoj/GRL_3_C.test.cpp
• test/aoj/GRL_6_A.test.cpp
• test/library_checker/convolution/bitwise_xor_convolution.test.cpp
• test/library_checker/data_structure/area_of_union_of_rectangles.test.cpp
• test/library_checker/data_structure/associative_array.test.cpp
• test/library_checker/data_structure/dynamic_sequence_range_affine_range_sum.test.cpp
• test/library_checker/data_structure/persistent_unionfind.test.cpp
• test/library_checker/data_structure/point_add_range_sum.test.cpp
• test/library_checker/data_structure/point_set_range_composite.test.cpp
• test/library_checker/data_structure/range_affine_point_get.test.cpp
• test/library_checker/data_structure/range_affine_range_sum.test.cpp
• test/library_checker/data_structure/range_chmin_chmax_add_range_sum.test.cpp
• test/library_checker/data_structure/range_kth_smallest.test.cpp
• test/library_checker/data_structure/range_reverse_range_sum.test.cpp
• test/library_checker/data_structure/range_set_range_composite.test.cpp
• test/library_checker/data_structure/range_set_range_composite_splay.test.cpp
• test/library_checker/data_structure/rectangle_sum.test.cpp
• test/library_checker/data_structure/static_range_sum_cumulative_sum.test.cpp
• test/library_checker/data_structure/static_range_sum_segtree.test.cpp
• test/library_checker/data_structure/staticrmq.test.cpp
• test/library_checker/data_structure/staticrmq_sparse_table.test.cpp
• test/library_checker/data_structure/unionfind.test.cpp
• test/library_checker/enumerative_combinatorics/many_factorials.test.cpp
• test/library_checker/geometry/manhattanmst.test.cpp
• test/library_checker/graph/biconnected_components.test.cpp
• test/library_checker/graph/biconnected_components_2.test.cpp
• test/library_checker/graph/chromatic_number.test.cpp
• test/library_checker/graph/cycle_detection.test.cpp
• test/library_checker/graph/cycle_detection_undirected.test.cpp
• test/library_checker/graph/maximum_independent_set.test.cpp
• test/library_checker/graph/minimum_steiner_tree.test.cpp
• test/library_checker/graph/scc.test.cpp
• test/library_checker/graph/shortest_path.test.cpp
• test/library_checker/graph/two_edge_connected_components.test.cpp
• test/library_checker/linear_algebra/matrix_det.test.cpp
• test/library_checker/linear_algebra/matrix_product.test.cpp
• test/library_checker/linear_algebra/pow_of_matrix.test.cpp
• test/library_checker/number_theory/discrete_logarithm_mod.test.cpp
• test/library_checker/number_theory/enumerate_primes.test.cpp
• test/library_checker/number_theory/enumerate_quotients.test.cpp
• test/library_checker/number_theory/factorize.test.cpp
• test/library_checker/number_theory/gcd_convolution.test.cpp
• test/library_checker/number_theory/kth_root_integer.test.cpp
• test/library_checker/number_theory/lcm_convolution.test.cpp
• test/library_checker/number_theory/primality_test.test.cpp
• test/library_checker/number_theory/primitive_root.test.cpp
• test/library_checker/number_theory/sqrt_mod.test.cpp
• test/library_checker/other/kth_term_of_linearly_recurrent_sequence.test.cpp
• test/library_checker/other/longest_increasing_subsequence.test.cpp
• test/library_checker/other/two_sat.test.cpp
• test/library_checker/polynomial/exp_of_formal_power_series.test.cpp
• test/library_checker/polynomial/inv_of_formal_power_series.test.cpp
• test/library_checker/polynomial/log_of_formal_power_series.test.cpp
• test/library_checker/polynomial/polynomial_taylor_shift.test.cpp
• test/library_checker/polynomial/shift_of_sampling_points_of_polynomial.test.cpp
• test/library_checker/polynomial/sqrt_of_formal_power_series.test.cpp
• test/library_checker/sample/aplusb.test.cpp
• test/library_checker/sample/many_aplusb.test.cpp
• test/library_checker/sample/many_aplusb_128bit.test.cpp
• test/library_checker/string/aho_corasick.test.cpp
• test/library_checker/string/wildcard_pattern_matching.test.cpp
• test/library_checker/tree/cartesian_tree.test.cpp
• test/library_checker/tree/jump_on_tree.test.cpp
• test/library_checker/tree/lca.test.cpp
• test/library_checker/tree/lca_doubling.test.cpp
• test/library_checker/tree/tree_diameter.test.cpp
• test/library_checker/tree/tree_path_composite_sum.test.cpp
• test/library_checker/tree/vertex_add_path_sum.test.cpp
• test/library_checker/tree/vertex_add_subtree_sum.test.cpp
• test/library_checker/tree/vertex_set_path_composite.test.cpp
• test/my-test/floor-ceil-bmod.test.cpp
• test/my-test/linear-sieve_vs_pollard-rho.test.cpp
• test/my-test/run-length-encoding.test.cpp
• test/my-test/splaytree.test.cpp
• test/my-test/uf-atcoderdsu.test.cpp
• test/my-test/uf-ufwithundo.test.cpp
• test/yukicoder/1077.test.cpp
• test/yukicoder/114.test.cpp
• test/yukicoder/1145.test.cpp
• test/yukicoder/12.test.cpp
• test/yukicoder/1326.test.cpp
• test/yukicoder/1634.test.cpp
• test/yukicoder/1718.test.cpp
• test/yukicoder/2051.test.cpp
• test/yukicoder/2092.test.cpp
• test/yukicoder/230.test.cpp
• test/yukicoder/2304.test.cpp
• test/yukicoder/2459.test.cpp
• test/yukicoder/2677.test.cpp
• test/yukicoder/2896.test.cpp
• test/yukicoder/3004.test.cpp
• test/yukicoder/3006.test.cpp
• test/yukicoder/3044.test.cpp
• test/yukicoder/3206.test.cpp
• test/yukicoder/430.test.cpp
• test/yukicoder/565.test.cpp
• test/yukicoder/654.test.cpp
• test/yukicoder/880.test.cpp
• test/yukicoder/888.test.cpp
• test/yukicoder/924.test.cpp

Code

#pragma once
#include <bits/stdc++.h>
using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = unsigned __int128;
using vi = std::vector<int>;
using vii = std::vector<std::vector<int>>;
using pii = std::pair<int, int>;
using vl = std::vector<ll>;
using vll = std::vector<vl>;
using pll = std::pair<ll, ll>;

template <class T>
concept extended_integral =
    std::integral<T> || std::same_as<std::remove_cv_t<T>, i128> ||
    std::same_as<std::remove_cv_t<T>, u128>;
template <class T>
concept extended_signed_integral =
    std::signed_integral<T> || std::same_as<std::remove_cv_t<T>, i128>;
template <class T>
concept extended_unsigned_integral =
    std::unsigned_integral<T> || std::same_as<std::remove_cv_t<T>, u128>;

template <class T>
concept Streamable =
    requires(std::ostream &os, T &x) { os << x; } || extended_integral<T>;
template <class mint>
concept is_modint = requires(mint &x) {
    { x.val() } -> std::convertible_to<int>;
};

#line 2 "other/type-utils.hpp"
#include <bits/stdc++.h>
using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = unsigned __int128;
using vi = std::vector<int>;
using vii = std::vector<std::vector<int>>;
using pii = std::pair<int, int>;
using vl = std::vector<ll>;
using vll = std::vector<vl>;
using pll = std::pair<ll, ll>;

template <class T>
concept extended_integral =
    std::integral<T> || std::same_as<std::remove_cv_t<T>, i128> ||
    std::same_as<std::remove_cv_t<T>, u128>;
template <class T>
concept extended_signed_integral =
    std::signed_integral<T> || std::same_as<std::remove_cv_t<T>, i128>;
template <class T>
concept extended_unsigned_integral =
    std::unsigned_integral<T> || std::same_as<std::remove_cv_t<T>, u128>;

template <class T>
concept Streamable =
    requires(std::ostream &os, T &x) { os << x; } || extended_integral<T>;
template <class mint>
concept is_modint = requires(mint &x) {
    { x.val() } -> std::convertible_to<int>;
};

Back to top page