cp_library

Library Files

data_structure/bbst

• スプレー木 (一点更新・区間取得) (data_structure/bbst/splay_tree.hpp)

data_structure/other

• デカルト木 (data_structure/other/cartesian_tree_min.hpp)
• Li Chao Tree (data_structure/other/li_chao_tree.hpp)
• Sliding Window Aggregation (data_structure/other/sliding_window_aggregation.hpp)

data_structure/sequence

• Binary Indexed Tree (data_structure/sequence/binary_indexed_tree.hpp)
• 可換双対セグメント木 (らて木) (data_structure/sequence/commutative_dual_segment_tree.hpp)
• コンパクト Bit Vector (data_structure/sequence/compact_bit_vector.hpp)
• 累積和 (data_structure/sequence/cumulative_sum.hpp)
• Disjoint Sparse Table (data_structure/sequence/disjoint_sparse_table.hpp)
• 双対 Binary Indexed Tree (data_structure/sequence/dual_binary_indexed_tree.hpp)
• 双対 Disjoint Sparse Table (data_structure/sequence/dual_disjoint_sparse_table.hpp)
• 双対可逆 Binary Indexed Tree (data_structure/sequence/dual_invertible_binary_indexed_tree.hpp)
• 双対セグメント木 (びーと木) (data_structure/sequence/dual_segment_tree.hpp)
• 双対スパーステーブル (data_structure/sequence/dual_sparse_table.hpp)
• 可逆 Binary Indexed Tree (data_structure/sequence/invertible_binary_indexed_tree.hpp)
• 可逆累積和 (data_structure/sequence/invertible_cumulative_sum.hpp)
• 遅延セグメント木 (data_structure/sequence/lazy_segment_tree.hpp)
• セグメント木 (うし木) (data_structure/sequence/segment_tree.hpp)
• Segment Tree Beats (data_structure/sequence/segment_tree_beats.hpp)
• スパーステーブル (data_structure/sequence/sparse_table.hpp)
• ウェーブレット行列 (data_structure/sequence/wavelet_matrix.hpp)
• XOR セグメント木 (data_structure/sequence/xor_segment_tree.hpp)

data_structure/tree

• 重軽分解 (data_structure/tree/heavy_light_decomposition.hpp)

data_structure/unionfind

• UnionFind (data_structure/unionfind/unionfind.hpp)

graph

• 二重頂点連結成分分解 (graph/biconnected_components.hpp)
• Block Cut Tree (graph/block_cut_tree.hpp)
• 三角形列挙 (graph/enumerate_triangles.hpp)
• 拡張 Block Cut Tree (graph/extended_block_cut_tree.hpp)
• 強連結成分分解 (graph/strongly_connected_components.hpp)
• 二重辺連結成分分解 (graph/two_edge_connected_components.hpp)

old_Data_Structures

• old_Data_Structures/Bidirectional_Segment_Tree.cpp
• old_Data_Structures/Euler_Tour_Path_Query.cpp
• old_Data_Structures/Euler_Tour_Path_Query_Commutative.cpp
• old_Data_Structures/Euler_Tour_Subtree_Query.cpp
• old_Data_Structures/Heavy_Light_Decomposition.cpp
• old_Data_Structures/Heavy_Light_Decomposition_Commutative.cpp
• old_Data_Structures/Inversion_Number.cpp
• old_Data_Structures/Segment_Tree_Beats.cpp
• old_Data_Structures/Treap.cpp
• old_Data_Structures/Trie.cpp

old_Dynamic_Programming

• old_Dynamic_Programming/Count_Subsequences.cpp
• old_Dynamic_Programming/Longest_Common_Subsequence.cpp
• old_Dynamic_Programming/Longest_Increasing_Subsequence.cpp
• old_Dynamic_Programming/Matrix_Chain_Multiplication.cpp

old_Geometry

• old_Geometry/Circle.cpp
• old_Geometry/Line.cpp
• old_Geometry/Point.cpp

old_Graph

• old_Graph/All_Pairs_Shortest_Path_(Warshall_Floyd).cpp
• old_Graph/Bipartite_Matching.cpp
• old_Graph/Convert_to_Rooted_Tree.cpp
• old_Graph/Detect_Cycle.cpp
• old_Graph/Lowest_Common_Ancestor.cpp
• old_Graph/Max_Flow_(Dinic).cpp
• old_Graph/Max_Flow_(Ford_Fulkerson).cpp
• old_Graph/Min_Cost_Flow_(Primal_Dual).cpp
• old_Graph/Minimium_Cost_Arborescence.cpp
• old_Graph/Minimum_Spanning_Tree_(Kruskal).cpp
• old_Graph/Range_Edges.cpp
• old_Graph/Rerooting.cpp
• old_Graph/Rerooting_1.cpp
• old_Graph/Rerooting_2.cpp
• old_Graph/Single_Source_Shortest_Path_(Bellman_Ford).cpp
• old_Graph/Single_Source_Shortest_Path_(Dijkstra).cpp
• old_Graph/Topological_Sort.cpp
• old_Graph/Tree_Diameter.cpp
• old_Graph/Tree_Height.cpp

old_Math

• old_Math/Bitwise_And_Convolution.cpp
• old_Math/Catalan_Number.cpp
• old_Math/Convolution_(FFT).cpp
• old_Math/Convolution_(NTT).cpp
• old_Math/Cycle_Decomposition.cpp
• old_Math/Euler_phi.cpp
• old_Math/Matrix_Multiplication.cpp
• old_Math/Modulo.cpp
• old_Math/Multipoint_Evaluation.cpp
• old_Math/Polynomial_Division.cpp
• old_Math/Polynomial_Inverse.cpp
• old_Math/Prime.cpp
• old_Math/Quotient_Ranges.cpp
• old_Math/XOR_Convolution.cpp

old_Range_Queries

• old_Range_Queries/Naive.cpp
• old_Range_Queries/Point_Add_Range_Sum.cpp
• old_Range_Queries/Point_Update_Range_Max.cpp
• old_Range_Queries/Point_Update_Range_Min.cpp
• old_Range_Queries/Range_Add_Point_Value.cpp
• old_Range_Queries/Range_Add_Range_Min.cpp
• old_Range_Queries/Range_Add_Range_Sum.cpp
• old_Range_Queries/Range_Chmin_Range_Min.cpp
• old_Range_Queries/Range_Min.cpp
• old_Range_Queries/Range_Sum.cpp
• old_Range_Queries/Range_Update_Add_Range_Sum.cpp
• old_Range_Queries/Range_Update_Point_Value.cpp
• old_Range_Queries/Range_Update_Range_Min.cpp
• old_Range_Queries/Range_Update_Range_Sum.cpp

old_String

• old_String/LCP_Array.cpp
• old_String/Rolling_Hash.cpp

other/monoids

• other/monoids/affine_sum.hpp
• other/monoids/linear.hpp

other

• ポーカー役判定 (other/poker_hands.hpp)

string

• 高さ配列 (LCP Array) (string/lcp_array.hpp)
• 最長回文 (Manacher's Algorithm) (string/manacher.hpp)
• 接尾辞配列 (SA-IS) (string/suffix_array.hpp)
• Z Algorithm (string/z_algorithm.hpp)

Verification Files

test/aoj/dsl

• test/aoj/dsl/dsl_1_a.test.cpp
• test/aoj/dsl/dsl_2_a.test.cpp
• test/aoj/dsl/dsl_2_b.test.cpp
• test/aoj/dsl/dsl_2_b_2.test.cpp
• test/aoj/dsl/dsl_2_b_3.test.cpp
• test/aoj/dsl/dsl_2_d.test.cpp
• test/aoj/dsl/dsl_2_e.test.cpp
• test/aoj/dsl/dsl_2_e_2.test.cpp
• test/aoj/dsl/dsl_2_e_3.test.cpp
• test/aoj/dsl/dsl_2_f.test.cpp
• test/aoj/dsl/dsl_2_g.test.cpp
• test/aoj/dsl/dsl_2_h.test.cpp
• test/aoj/dsl/dsl_2_i.test.cpp
• test/aoj/dsl/dsl_5_a.test.cpp
• test/aoj/dsl/dsl_5_a_2.test.cpp
• test/aoj/dsl/dsl_5_a_3.test.cpp

test/aoj/grl

• test/aoj/grl/grl_3_a.test.cpp
• test/aoj/grl/grl_3_a_2.test.cpp
• test/aoj/grl/grl_3_b.test.cpp
• test/aoj/grl/grl_3_c.test.cpp

test/aoj/itp

• test/aoj/itp/itp1_6_a.test.cpp

test/aoj/other

• test/aoj/other/1508.test.cpp
• test/aoj/other/1508_2.test.cpp
• test/aoj/other/2535.test.cpp
• test/aoj/other/2677.test.cpp

test/library_checker/data_structure

• test/library_checker/data_structure/line_add_get_min.test.cpp
• test/library_checker/data_structure/point_add_range_sum.test.cpp
• test/library_checker/data_structure/point_add_range_sum_2.test.cpp
• test/library_checker/data_structure/point_add_range_sum_3.test.cpp
• test/library_checker/data_structure/point_set_range_composite.test.cpp
• test/library_checker/data_structure/queue_operate_all_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/segment_add_get_min.test.cpp
• test/library_checker/data_structure/static_range_frequency.test.cpp
• test/library_checker/data_structure/static_range_sum.test.cpp
• test/library_checker/data_structure/static_range_sum_2.test.cpp
• test/library_checker/data_structure/static_range_sum_3.test.cpp
• test/library_checker/data_structure/staticrmq.test.cpp
• test/library_checker/data_structure/staticrmq_2.test.cpp
• test/library_checker/data_structure/staticrmq_3.test.cpp
• test/library_checker/data_structure/unionfind.test.cpp

test/library_checker/graph

• test/library_checker/graph/biconnected_components.test.cpp
• test/library_checker/graph/biconnected_components_2.test.cpp
• test/library_checker/graph/enumerate_triangles.test.cpp
• test/library_checker/graph/scc.test.cpp
• test/library_checker/graph/two_edge_connected_components.test.cpp

test/library_checker/string

• test/library_checker/string/enumerate_palindromes.test.cpp
• test/library_checker/string/number_of_substrings.test.cpp
• test/library_checker/string/suffixarray.test.cpp
• test/library_checker/string/zalgorithm.test.cpp

test/library_checker/tree

• test/library_checker/tree/cartesian_tree.test.cpp
• test/library_checker/tree/lca.test.cpp

test/yukicoder

• test/yukicoder/yuki_1326.test.cpp
• test/yukicoder/yuki_1326_2.test.cpp
• test/yukicoder/yuki_1891.test.cpp
• test/yukicoder/yuki_945.test.cpp