imsuck's library

C++ version: C++17

Referenced libraries

• [beet](https://beet-aizu.github.io/library/)
• [CP Algorithms](https://cp-algorithms.github.io/cp-algorithms-aux/)
• [ei1333](https://ei1333.github.io/library/)
• [hitonanode](https://hitonanode.github.io/cplib-cpp/)
• [maspy](https://maspypy.github.io/library/)
• [Nachia](https://nachiavivias.github.io/cp-library/cpp/)
• [noshi91](https://noshi91.github.io/Library/)
• [Nyaan](https://nyaannyaan.github.io/library/)
• [sotanishy](https://sotanishy.github.io/cp-library-cpp/)
• [suisen](https://suisen-cp.github.io/cp-library-cpp/)
• [tko919](https://tko919.github.io/library/)

Recent Commits

• Loading recent commits...

Library Files

ds/

• ds/bst_base.hpp
• Circular Deque (ds/circular_deque.hpp)
• Deque Aggregation (ds/deque_aggregation.hpp)
• Disjoint Sparse Table (ds/disjoint_sparse_table.hpp)
• Dynamic Lazy Segment Tree (ds/dynlazysegtree.hpp)
• Dynamic Segment Tree (ds/dynsegtree.hpp)
• Hash Map (ds/hashmap.hpp)
• Lazy Segment Tree (ds/lazysegtree.hpp)
• Ordered Set (ds/ordered_set.hpp)
• Rolling Hash (ds/rolling_hash.hpp)
• ds/rolling_hash_static.hpp
• Segment Tree (ds/segtree.hpp)
• Static Range Query (ds/srq.hpp)
• Sliding Window Aggregation (SWAG) (ds/swag.hpp)
• Treap (ds/treap.hpp)
• ds/treap_base.hpp
• Wavelet Matrix (ds/wavelet_matrix.hpp)

graph/

• Adjacency Edge List (graph/ael.hpp)
• Block Cut Tree (graph/block_cut.hpp)
• Bridge Tree (graph/bridge_tree.hpp)
• Centroid Decomposition (graph/centroid_decomposition.hpp)
• Compressed Sparse Row (graph/csr.hpp)
• Dinitz's Algorithm (graph/dinitz.hpp)
• Disjoint Set Union (graph/dsu.hpp)
• Strongly Connected Components (graph/scc.hpp)
• Shallowest Decomposition (graph/shallowest_decomposition.hpp)

math/

• Dynamic Modint (math/dynmodint.hpp)
• math/math.hpp
• Matrix (math/matrix.hpp)
• Modint (math/modint.hpp)
• Stern-Brocot Tree (math/stern_brocot_tree.hpp)
• Zeta-Moebius Transform (math/zeta_moebius_transform.hpp)

misc/

• misc/toptree_logger.hpp
• misc/type_name.hpp

other/

• other/blazingio.hpp
• other/bump_alloc.hpp
• other/chash.hpp
• Compressor (other/compressor.hpp)
• other/dbg.hpp
• other/dp_cache.hpp
• other/dp_cache_int.hpp
• other/enumerate_subsets.hpp
• other/main_top.hpp
• Mo's Algorithm (other/mo.hpp)
• other/pcg.hpp
• other/ptr32.hpp
• other/ranges_util.hpp
• other/st_alloc.hpp
• other/timer.hpp
• 2-SAT (other/two_sat.hpp)
• other/types.hpp
• other/update_proxy.hpp
• other/vec.hpp
• other/y_combinator.hpp

tree/

• DSU on Tree (tree/dsu_on_tree.hpp)
• Dynamic Tree DP (tree/dynamic_tree_dp.hpp)
• Euler Tour Tree (tree/ett.hpp)
• Heavy-light Decomposition (tree/hld.hpp)
• Lazy Euler Tour Tree (tree/lazy_ett.hpp)
• Link Cut Tree (tree/link_cut.hpp)
• Mo's Algorithm on Tree (tree/mo_on_tree.hpp)
• Rerooting (tree/rerooting.hpp)
• Static Top Tree (tree/static_top_tree.hpp)
• Top Tree (tree/top_tree.hpp)
• Top Tree (ecnerwala) (tree/top_tree_ecnerwala.hpp)
• Virtual Tree (tree/virtual_tree.hpp)
• XOR Tree (tree/xor_tree.hpp)

Verification Files

test/yosupo/convolution/

• test/yosupo/convolution/gcd_convolution.test.cpp
• test/yosupo/convolution/lcm_convolution.test.cpp

test/yosupo/ds/

• test/yosupo/ds/associative_array.test.cpp
• test/yosupo/ds/deque_operate_all_composite.test.cpp
• test/yosupo/ds/disjoint_sparse_table.test.cpp
• test/yosupo/ds/ordered_set.test.cpp
• test/yosupo/ds/point_add_range_sum.test.cpp
• test/yosupo/ds/point_set_range_frequency.test.cpp
• test/yosupo/ds/queue_operate_all_composite.test.cpp
• test/yosupo/ds/range_kth_smallest.test.cpp
• test/yosupo/ds/static_range_inversions_query.test.cpp
• test/yosupo/ds/unionfind.test.cpp

test/yosupo/ds/deque/

• test/yosupo/ds/deque/circular_deque.test.cpp
• test/yosupo/ds/deque/dynamic_circular_deque.test.cpp

test/yosupo/ds/segment_tree/

• test/yosupo/ds/segment_tree/point_set_range_composite.test.cpp
• test/yosupo/ds/segment_tree/point_set_range_composite_large_array.test.cpp
• test/yosupo/ds/segment_tree/range_affine_range_sum.test.cpp
• test/yosupo/ds/segment_tree/range_affine_range_sum_large_array.test.cpp

test/yosupo/graph/

• test/yosupo/graph/biconnected_components.test.cpp
• test/yosupo/graph/bipartitematching_dinitz.test.cpp
• test/yosupo/graph/incremental_minimum_spanning_forest.test.cpp
• test/yosupo/graph/minimum_spanning_tree_kruskal.test.cpp
• test/yosupo/graph/scc_ael.test.cpp
• test/yosupo/graph/scc_csr.test.cpp
• test/yosupo/graph/two_edge_connected_components.test.cpp

test/yosupo/num_theory/

• test/yosupo/num_theory/stern_brocot_tree.test.cpp

test/yosupo/other/

• test/yosupo/other/two_sat.test.cpp

test/yosupo/string/

• test/yosupo/string/enumerate_palindromes_rolling_hash.test.cpp

test/yosupo/tree/

• test/yosupo/tree/dynamic_tree_subtree_add_subtree_sum_ett.test.cpp
• test/yosupo/tree/dynamic_tree_subtree_add_subtree_sum_top_tree_ecnerwala.test.cpp
• test/yosupo/tree/dynamic_tree_vertex_add_subtree_sum.test.cpp
• test/yosupo/tree/dynamic_tree_vertex_add_subtree_sum_ett.test.cpp
• test/yosupo/tree/dynamic_tree_vertex_add_subtree_sum_top_tree.test.cpp
• test/yosupo/tree/dynamic_tree_vertex_set_path_composite.test.cpp
• test/yosupo/tree/dynamic_tree_vertex_set_path_composite_top_tree.test.cpp
• test/yosupo/tree/dynamic_tree_vertex_set_path_composite_top_tree_ecnerwala.test.cpp
• test/yosupo/tree/lca_hld.test.cpp
• test/yosupo/tree/lca_link_cut.test.cpp
• test/yosupo/tree/lca_top_tree_ecnerwala.test.cpp
• test/yosupo/tree/point_set_tree_path_composite_sum_fixed_root.test.cpp
• test/yosupo/tree/point_set_tree_path_composite_sum_top_tree.test.cpp
• test/yosupo/tree/point_set_tree_path_composite_sum_top_tree_ecnerwala.test.cpp
• test/yosupo/tree/tree_path_composite_sum.test.cpp
• test/yosupo/tree/vertex_add_path_sum_hld.test.cpp

test/yukicoder/

• test/yukicoder/772.test.cpp
• test/yukicoder/902.test.cpp