competitive-programming-library

競技プログラミング用のライブラリです。 C++17 での使用を想定しています。

Library Files

src/datastructure/

• Disjoint Set Union (Union-Find) (disjoint_set_union.hpp)
• ポテンシャル付き Disjoint Set Union (ポテンシャル付き Union-Find) (disjoint_set_union_with_potential.hpp)
• Fenwick Tree (Binary Indexed Tree) (fenwick_tree.hpp)
• Segment tree with lazy propagation (lazy_segment_tree.hpp)
• Segment tree (segment_tree.hpp)
• Sparse Table (sparse_table.hpp)

src/flow/

• Dinic (dinic.hpp)
• Ford-Fulkerson (ford_fulkerson.hpp)
• Primal-Dual (primal_dual.hpp)

src/geometry/

• Geometry (geometry.hpp)

src/graph/

• Bellman-Ford (bellman_ford.hpp)
• Dijkstra (dijkstra.hpp)
• Kruskal (kruskal.hpp)
• Prim (prim.hpp)
• Strongly Connected Components (strongly_connected_components.hpp)

src/math/

• 組み合わせ (combination.hpp)
• 約数列挙 (divisor.hpp)
• 拡張ユークリッドの互除法 (extended_gcd.hpp)
• 行列 (matrix.hpp)
• Mod Int (mod_int.hpp)
• エラトステネスの篩 (sieve_of_eratosthenes.hpp)

src/string/

• Rolling Hash (rolling_hash.hpp)

src/tree/

• Euler Tour (euler_tour.hpp)
• Rerooting DP (rerooting_dp.hpp)

src/vector/

• 座標圧縮 (coordinate_compression.hpp)
• 転倒数 (inversion_number.hpp)

Verification Files

test/datastructure/disjoint_set_union/

• aoj_dsl_1_a.test.cpp

test/datastructure/disjoint_set_union_with_potential/

• aoj_dsl_1_b.test.cpp

test/datastructure/fenwick_tree/

• aoj_dsl_2_b.test.cpp

test/datastructure/lazy_segment_tree/

• aoj_dsl_2_d.test.cpp
• aoj_dsl_2_f.test.cpp

test/datastructure/segment_tree/

• aoj_dsl_2_a.test.cpp
• aoj_dsl_2_b.test.cpp
• yosupo_point_set_range_composite.test.cpp

test/datastructure/sparse_table/

• aoj_dsl_3_d.test.cpp

test/flow/dinic/

• aoj_grl_6_a.test.cpp

test/flow/ford_fulkerson/

• aoj_grl_6_a.test.cpp

test/flow/primal_dual/

• aoj_grl_6_b.test.cpp

test/geometry/geometry/

• aoj_cgl_1_a.test.cpp
• aoj_cgl_1_b.test.cpp
• aoj_cgl_1_c.test.cpp
• aoj_cgl_2_a.test.cpp
• aoj_cgl_2_b.test.cpp
• aoj_cgl_2_c.test.cpp
• aoj_cgl_2_d.test.cpp
• aoj_cgl_3_a.test.cpp
• aoj_cgl_3_b.test.cpp
• aoj_cgl_3_c.test.cpp
• aoj_cgl_4_a.test.cpp
• aoj_cgl_4_b.test.cpp
• aoj_cgl_4_c.test.cpp
• aoj_cgl_5_a.test.cpp
• aoj_cgl_6_a.test.cpp
• aoj_cgl_7_a.test.cpp
• aoj_cgl_7_b.test.cpp
• aoj_cgl_7_c.test.cpp
• aoj_cgl_7_d.test.cpp
• aoj_cgl_7_e.test.cpp
• aoj_cgl_7_f.test.cpp
• aoj_cgl_7_g.test.cpp
• aoj_cgl_7_h.test.cpp
• aoj_cgl_7_i.test.cpp

test/graph/bellman_ford/

• aoj_grl_1_b.test.cpp

test/graph/dijkstra/

• aoj_grl_1_a.test.cpp

test/graph/kruskal/

• aoj_grl_2_a.test.cpp

test/graph/prim/

• aoj_grl_2_a.test.cpp

test/graph/strongly_connected_components/

• aoj_grl_3_c.test.cpp
• yosupo_scc.test.cpp

test/math/combination/

• atcoder_abc145_d.test.cpp

test/math/divisor/

• aoj_1626.test.cpp

test/math/extended_gcd/

• aoj_ntl_1_e.test.cpp

test/math/matrix/

• aoj_3079.test.cpp
• aoj_itp1_7_d.test.cpp

test/math/sieve_of_eratosthenes/

• aoj_1276.test.cpp
• aoj_itp1_3_d.test.cpp

test/string/rolling_hash/

• aoj_alds1_14_b.test.cpp

test/tree/euler_tour/

• aoj_grl_5_c.test.cpp
• aoj_grl_5_d.test.cpp
• atcoder_abc294_g.test.cpp
• yosupo_vertex_add_path_sum.test.cpp

test/tree/rerooting_dp/

• aoj_1595.test.cpp
• aoj_grl_5_a.test.cpp
• aoj_grl_5_b.test.cpp

test/vector/inversion_number/

• aoj_alds1_5_d.test.cpp