kyopro-lib-cpp

Library Files

data_structure

• Convex Hull Trick (data_structure/cht.hpp)
• data_structure/fenwick_tree.hpp
• 遅延評価 Segment Tree (data_structure/lazy_segtree.hpp)
• 完全永続配列 (data_structure/persistent_array.hpp)
• data_structure/persistent_lazy_rbtree.hpp
• data_structure/persistent_unionfind.hpp
• Segment Tree (data_structure/segtree.hpp)
• Splay Tree (data_structure/splay_tree.hpp)
• data_structure/unionfind.hpp

graph

• graph/bfs01.hpp
• Dijkstra 法 (graph/dijkstra.hpp)
• Dinic 法 (graph/dinic.hpp)
• HL 分解 (graph/hld.hpp)
• Khan のトポロジカルソート (graph/khan.hpp)
• graph/kruskal.hpp
• graph/offline_dag_reachability.hpp
• SPFA (graph/spfa.hpp)
• Warshall-Floyd 法 (graph/wf.hpp)

math

• and / or 畳み込み (math/and_or_convolution.hpp)
• math/bostan_mori.hpp
• 組み合わせ (math/combination.hpp)
• 畳み込み (math/convolution.hpp)
• math/divisors.hpp
• 形式的冪級数 (math/fps.hpp)
• 高速 Walsh-Hadamard 変換 (math/fwht.hpp)
• 高速 Zeta / Moebius 変換 (math/fzt_fmt.hpp)
• math/kth_of_lrs.hpp
• 行列 (math/matrix.hpp)
• modint (math/modint.hpp)
• 離散対数問題 (math/modlog.hpp)
• 数論変換 (math/ntt.hpp)
• 順列 (math/permutation.hpp)
• math/prime_factorize.hpp
• Subset Convolution (math/subset_convolution.hpp)
• xor 基底 (math/xor_basis.hpp)
• xor 畳み込み (math/xor_convolution.hpp)

string

• string/parser.hpp
• ローリングハッシュ (string/rolling_hash.hpp)

.

• template.hpp

util

• 二分探索 (util/bisect.hpp)
• ダブリング (util/doubling.hpp)
• util/dynamic_bitset.hpp
• Fibonacci 探索 (util/fibsect.hpp)
• util/inversion.hpp
• util/mex.hpp
• Xorshift (util/xorshift.hpp)

Verification Files

test/judge.u-aizu.ac.jp

• test/judge.u-aizu.ac.jp/Enumeration.0.test.cpp

test/judge.yosupo.jp

• test/judge.yosupo.jp/Bitwise_And_Convolution.0.test.cpp
• test/judge.yosupo.jp/Bitwise_And_Convolution.1.test.cpp
• test/judge.yosupo.jp/Bitwise_Xor_Convolution.0.test.cpp
• test/judge.yosupo.jp/Convolution.0.test.cpp
• test/judge.yosupo.jp/Determinant_of_Matrix.0.test.cpp
• test/judge.yosupo.jp/Discrete_Logaritm.0.test.cpp
• test/judge.yosupo.jp/Exp_of_Formal_Power_Series.0.test.cpp
• test/judge.yosupo.jp/Inv_of_Formal_Power_Series.0.test.cpp
• test/judge.yosupo.jp/Kth_Term_of_Linearly_Recurrent_Sequence.0.test.cpp
• test/judge.yosupo.jp/Line_Add_Get_Min.0.test.cpp
• test/judge.yosupo.jp/Log_of_Formal_Power_Series.0.test.cpp
• test/judge.yosupo.jp/Persistent_Queue.0.test.cpp
• test/judge.yosupo.jp/Persistent_UnionFind.0.test.cpp
• test/judge.yosupo.jp/Pow_of_Formal_Power_Series.0.test.cpp
• test/judge.yosupo.jp/Range_Affine_Range_Sum.0.test.cpp
• test/judge.yosupo.jp/Shortest_Path.0.test.cpp
• test/judge.yosupo.jp/Subset_Convolution.0.test.cpp
• test/judge.yosupo.jp/Unionfind.0.test.cpp

test/onlinejudge.u-aizu.ac.jp

• test/onlinejudge.u-aizu.ac.jp/All_Pairs_Shortest_Path.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/Arrangement_of_pieces.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/Maximum_Flow.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/Maximum_Flow.1.test.cpp
• test/onlinejudge.u-aizu.ac.jp/Maximum_Flow.2.test.cpp
• test/onlinejudge.u-aizu.ac.jp/Maximum_Flow.3.test.cpp
• test/onlinejudge.u-aizu.ac.jp/Prime_Factorization.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/RMQ_and_RAQ.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/RMQ_and_RUQ.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/RSQ_and_RAQ.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/RSQ_and_RUQ.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/Range_Sum_Query.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/Single_Source_Shortest_Path_Negative_Edges.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/String_Search.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/The_Smallest_Window_I.0.test.cpp
• test/onlinejudge.u-aizu.ac.jp/The_Smallest_Window_I.1.test.cpp
• test/onlinejudge.u-aizu.ac.jp/The_Smallest_Window_I.2.test.cpp
• test/onlinejudge.u-aizu.ac.jp/The_Smallest_Window_I.3.test.cpp
• test/onlinejudge.u-aizu.ac.jp/Vector.0.test.cpp

test/unit

• test/unit/hld.test.cpp
• test/unit/khan.test.cpp
• test/unit/permutation.test.cpp