firiexp's Library

verify実行結果ダッシュボード (BETA)

Library Files

datastructure

• Aho-Corasick法 (datastructure/ahocorasick.cpp)
• 二分ヒープ(Binary Heap) (datastructure/binaryheap.cpp)
• Binary Indexed Tree(BIT) (datastructure/binaryindexedtree.cpp)
• Binary Trie (datastructure/binarytrie.cpp)
• Disjoint Sparse Table (datastructure/disjoint_sparse_table.cpp)
• 動的bitset(Dynamic Bitset) (datastructure/dynamic_bitset.cpp)
• 2次元Fenwick Tree(2D BIT) (datastructure/fenwick_tree_2d.cpp)
• Implicit Treap (datastructure/implicit_treap.cpp)
• 区間集合(Interval Set) (datastructure/interval_set.cpp)
• Li Chao Tree (datastructure/li_chao_tree.cpp)
• Convex-Hull Trick (クエリ単調) (datastructure/monotoniccht.cpp)
• 完全永続UnionFind(Fully Persistent Union Find) (datastructure/persistent_unionfind.cpp)
• 点加算長方形和(Point Add Rectangle Sum) (datastructure/point_add_rectangle_sum.cpp)
• Quick Find (datastructure/quickfind.cpp)
• datastructure/radixheap.cpp
• 長方形加算点取得(Rectangle Add Point Get) (datastructure/rectangle_add_point_get.cpp)
• スライド最小値(最大値) (datastructure/slidingwindow.cpp)
• Slope Trick (datastructure/slope_trick.cpp)
• Sparse Table (datastructure/sparsetable.cpp)
• 固定長bitset(Static Bitset) (datastructure/static_bitset.cpp)
• 静的長方形和(Static Rectangle Sum) (datastructure/static_rectangle_sum.cpp)
• SWAG (datastructure/swag.cpp)
• SWAG Deque (datastructure/swag_deque.cpp)
• 上位K個の和を管理する (datastructure/top_k_sum.cpp)
• 上位K個を管理するTreap (datastructure/top_kth.cpp)
• Trie 木 (datastructure/trie.cpp)
• Undoable Union Find (datastructure/undoableunionfind.cpp)
• UnionFind(素集合データ構造) (datastructure/unionfind.cpp)
• Wavelet Matrix (datastructure/wavelet_matrix.cpp)
• 重み付きWavelet Matrix(Weighted Wavelet Matrix) (datastructure/weighted_wavelet_matrix.cpp)
• 重み付きUnionFind(Weighted Union Find) (datastructure/weightedunionfind.cpp)

datastructure/segmenttree

• 双対セグメント木(Dual Segment Tree) (datastructure/segmenttree/dualsegtree.cpp)
• Dynamic Segment Tree (datastructure/segmenttree/dynamic_segtree.cpp)
• 遅延セグメント木(Lazy Segment Tree) (datastructure/segmenttree/lazysegtree.cpp)
• 永続セグメント木(Persistent Segment Tree) (datastructure/segmenttree/persistent_segtree.cpp)
• Segment Tree Beats! (datastructure/segmenttree/segbeats.cpp)
• Segment Tree (datastructure/segmenttree/segtree.cpp)

flow

• 容量スケーリングDinic(Capacity Scaling Dinic) (flow/costscalingdinic.cpp)
• Dinic法(Dinic) (flow/dinic.cpp)
• ハンガリアン法(Hungarian Algorithm) (flow/hungarian.cpp)
• 最小費用流(Primal-Dual) (flow/primaldual.cpp)
• Project Selection Problem (flow/project_selection_problem.cpp)

fps

• 線形漸化式(Linear Recurrence) (fps/linear_recurrence.cpp)
• 多点評価(Multipoint Evaluation) (fps/multipoint_evaluation.cpp)
• 有理型母関数のN項目 (fps/nth_term.cpp)
• 多項式補間(Polynomial Interpolation) (fps/polynomial_interpolation.cpp)
• 標本点シフト(Sample Point Shift) (fps/sample_point_shift.cpp)
• Taylor Shift (fps/taylor_shift.cpp)

geometry

• 長方形和集合面積(Area of Union of Rectangles) (geometry/area_of_union_of_rectangles.cpp)
• 偏角ソート(Argument Sort) (geometry/argsort.cpp)
• Closest Pair (geometry/closest_pair.cpp)
• 凸包(Convex Hull) (geometry/convex_hull.cpp)
• 双対グラフ(Dual Graph) (geometry/dualgraph.cpp)
• 幾何ライブラリ(Geometry) (geometry/geometry.cpp)
• 3次元幾何 (geometry/geometry3d.cpp)
• 半平面共通部分(Half-Plane Intersection) (geometry/half_plane_intersection.cpp)

graph

• 強連結成分分解(SCC) (graph/SCC.cpp)
• Bellman-Ford法 (graph/bellman_ford.cpp)
• Bellman-Ford法(負閉路伝播) (graph/bellman_ford_negative_loop.cpp)
• 01-BFS (graph/bfs01.cpp)
• 二重連結成分分解(Biconnected Components) (graph/biconnected_components.cpp)
• 二部グラフ最大マッチング(Bipartite Matching) (graph/bipartite_matching.cpp)
• 辞書順最小二部マッチング(Lexicographically Minimum Bipartite Matching) (graph/bipartite_matching_lexmin.cpp)
• ブロックカット木(Block-Cut Tree) (graph/block_cut_tree.cpp)
• 橋木(Bridge Tree) (graph/bridge_tree.cpp)
• 最小全域有向木(Chu-Liu/Edmonds) (graph/chu_liu_edmonds.cpp)
• 有向閉路検出(Directed Cycle Detection) (graph/cycle_detection_directed.cpp)
• 無向閉路検出(Undirected Cycle Detection) (graph/cycle_detection_undirected.cpp)
• Dijkstra法 (graph/dijkstra.cpp)
• graph/dijkstra_common.cpp
• Dijkstra法(Radix Heap) (graph/dijkstra_radix_heap.cpp)
• 経路復元付きDijkstra法 (graph/dijkstra_restore.cpp)
• Dominator Tree (graph/dominatortree.cpp)
• Dynamic Graph Vertex Add Component Sum (graph/dynamic_graph_vertex_add_component_sum.cpp)
• オイラー路(Eulerian Trail) (graph/eulerian_trail.cpp)
• Functional Graph (graph/functional_graph.cpp)
• 一般グラフ最大マッチング(General Matching) (graph/general_matching.cpp)
• Hopcroft-Karp法 (graph/hopcroft_karp.cpp)
• 最大独立集合(Maximum Independent Set) (graph/independentset.cpp)
• 最小全域木(Kruskal法) (graph/kruskal.cpp)
• LowLink (graph/lowlink.cpp)
• マンハッタンMST(Manhattan MST) (graph/manhattanmst.cpp)
• 下限制約付きs-t最大流 (Max Flow with Lower Bounds) (graph/maxflow_lower_bound.cpp)
• 最小費用b-flow(Min-Cost b-Flow) (graph/minimum_cost_b_flow.cpp)
• Offline Dynamic Connectivity (graph/offlinedynamicconnectivity.cpp)
• トポロジカルソート(Topological Sort) (graph/topological_sort.cpp)
• 二辺連結成分分解(Two-Edge-Connected Components) (graph/twoedgeconnectedcomponents.cpp)
• 2-SAT (graph/twosat.cpp)

math

• 中国剰余定理(Chinese Remainder Theorem) (math/CRT.cpp)
• AND畳み込み(Bitwise AND Convolution) (math/and_convolution.cpp)
• Berlekamp-Massey法 (math/berlekamp_massey.cpp)
• 二項係数(mod p^q) (math/binom_mod_prime_power.cpp)
• math/comb_table.cpp
• 離散対数(Discrete Logarithm) (math/discrete_logarithm.cpp)
• 拡張ユークリッド互除法(Extended GCD) (math/extgcd.cpp)
• 階乗・二項係数(Factorial) (math/factorial.cpp)
• math/fastkitamasa.cpp
• 任意MOD畳み込み(3 NTT + Garner) (math/fft.cpp)
• Floor Sum (math/floor_sum.cpp)
• 高速Walsh-Hadamard変換(FWHT) (math/fwht.cpp)
• math/garner.cpp
• Gauss-Jordan消去(modint) (math/gauss_jordan_mint.cpp)
• math/gcd_transform.cpp
• 逆行列(Inverse Matrix) (math/inverse_matrix.cpp)
• 整数平方根(Integer Square Root) (math/isqrt.cpp)
• 整数k乗根(K-th Root Integer) (math/kth_root_integer.cpp)
• Many Factorials (math/many_factorials.cpp)
• 行列 (math/matrix.cpp)
• 行列式(Matrix Determinant) (math/matrix_determinant.cpp)
• min-plus畳み込み(Min-Plus Convolution) (math/min_plus_convolution.cpp)
• 平方根 (mod p) (math/mod_sqrt.cpp)
• math/modinv.cpp
• NTT・形式的冪級数(NTT/FPS) (math/ntt.cpp)
• OR畳み込み(Bitwise OR Convolution) (math/or_convolution.cpp)
• math/pell_equation.cpp
• math/pow.cpp
• math/powk_all.cpp
• 固定長正方行列(Square Matrix) (math/squarematrix.cpp)
• 固定長正方行列(mint専用) (math/squarematrix_mint.cpp)
• Stern-Brocot木 (math/stern_brocot_tree.cpp)
• 部分集合畳み込み(Subset Convolution) (math/subset_convolution.cpp)
• Tetration Mod (math/tetration.cpp)
• XOR基底(Linear Basis) (math/xor_basis.cpp)

math/prime

• 素数数え上げ(Prime Counting) (math/prime/counting_primes.cpp)
• math/prime/divisor.cpp
• オイラーのφ関数(Euler Phi) (math/prime/eulerphi.cpp)
• オイラーのφ関数テーブル (math/prime/eulerphi_all.cpp)
• 最小素因数テーブル(Min Factor Table) (math/prime/get_min_factor.cpp)
• 素数列挙 (math/prime/get_prime.cpp)
• 高速素数列挙(ExactDiv) (math/prime/get_prime2.cpp)
• get_prime_wheel (math/prime/get_prime_wheel.cpp)
• 線形篩(Linear Sieve) (math/prime/linear_sieve.cpp)
• Miller-Rabin素数判定 (math/prime/miller_rabin.cpp)
• メビウス関数テーブル(Mobius Table) (math/prime/mobius_all.cpp)
• math/prime/mobius_mu.cpp
• 素因数分解(試し割り) (math/prime/primefactor.cpp)
• 素因数分解(Pollard Rho) (math/prime/primefactor_ll.cpp)
• 原始根(Primitive Root) (math/prime/primitive_root.cpp)

snippets

• snippets/jp.cpp
• snippets/template.cpp
• snippets/treedfs.cpp
• snippets/uniq.cpp

string

• KMP法 (string/kmp.cpp)
• LCS(bitset) (string/lcs_bit.cpp)
• Lyndon分解(Lyndon Factorization) (string/lyndon_factorization.cpp)
• string/manacher.cpp
• 回文木(Palindromic Tree) (string/palindromic_tree.cpp)
• Rolling Hash (string/rolling_hash.cpp)
• Rolling Hash(mod 2^61-1) (string/rolling_hash_ull.cpp)
• Suffix Array (string/suffix_array.cpp)
• Suffix Automaton (string/suffix_automaton.cpp)
• Z-Algorithm (string/z-algorithm.cpp)

tree

• 最近共通祖先(LCA) (tree/LCA.cpp)
• 補助木(Aux Tree) (tree/auxtree.cpp)
• Cartesian Tree (tree/cartesian_tree.cpp)
• 重心分解(Centroid Decomposition) (tree/centroid_decomposition.cpp)
• 重心分解クエリ補助(Centroid Query Helper) (tree/centroid_decomposition_query_helper.cpp)
• 木の直径(Tree Diameter) (tree/diameter.cpp)
• 木の直径(重み付き) (tree/diameter_weighted.cpp)
• DSU on Tree (tree/dsu_on_tree.cpp)
• Frequency Table of Tree Distance (tree/frequency_table_of_tree_distance.cpp)
• HL分解(HL Decomposition) (tree/hld.cpp)
• HL分解(辺クエリ) (tree/hld_edge.cpp)
• Jump on Tree (tree/jump_on_tree.cpp)
• Link-Cut Tree (tree/link_cut_tree.cpp)
• ReRooting(全方位木DP) (tree/rerooting.cpp)
• 木の中心(Tree Center) (tree/tree_center.cpp)
• 木ハッシュ(Tree Hash) (tree/tree_hash.cpp)
• Virtual Tree Helper (tree/virtual_tree_helper.cpp)

util

• 多倍長整数(BigInteger) (util/biginteger.cpp)
• util/dice.cpp
• 高速入出力(Fast IO) (util/fastio.cpp)
• Floor/Ceil Division (util/ifloor.cpp)
• util/is_palindrome.cpp
• util/kado.cpp
• make_v, chmin, chmax (util/makev.cpp)
• Mo's Algorithm (util/mo.cpp)
• modint(固定MOD) (util/modint.cpp)
• modint(任意MOD) (util/modint_arbitrary.cpp)
• 式パーサ(Parse) (util/parse.cpp)
• ランレングス圧縮(RLE) (util/rle.cpp)
• Xor-Shift (util/xorshift.cpp)

Verification Files

test

• test/aoj0273.test.cpp
• test/aoj0274.test.cpp
• test/aoj0275_dynamic_bitset.test.cpp
• test/aoj0275_static_bitset.test.cpp
• test/aoj0294.test.cpp
• test/aoj0334.test.cpp
• test/aoj0335.test.cpp
• test/aoj0342.test.cpp
• test/aoj0349.test.cpp
• test/aoj0355.test.cpp
• test/aoj0377.test.cpp
• test/aoj0396.test.cpp
• test/aoj0399.test.cpp
• test/aoj0402.test.cpp
• test/aoj0403.test.cpp
• test/aoj0415.test.cpp
• test/aoj0422.test.cpp
• test/aoj0438.test.cpp
• test/aoj0439.test.cpp
• test/aoj0439_virtual_tree_helper.test.cpp
• test/aoj0452.test.cpp
• test/aoj2257.test.cpp
• test/aoj2907_prefix_suffix_search.test.cpp
• test/aoj2945_bfs01.test.cpp
• test/aoj_alds1_10_c.test.cpp
• test/aoj_alds1_14_b.test.cpp
• test/aoj_alds1_14_b_dynamic_bitset.test.cpp
• test/aoj_alds1_1_c_get_prime.test.cpp
• test/aoj_alds1_1_c_get_prime2.test.cpp
• test/aoj_alds1_9_c_binaryheap.test.cpp
• test/aoj_cgl_4_c_half_plane_intersection.test.cpp
• test/aoj_dpl_5_a.test.cpp
• test/aoj_dsl_1_b_weightedunionfind.test.cpp
• test/aoj_dsl_2_b.test.cpp
• test/aoj_grl_1_a_dijkstra.test.cpp
• test/aoj_grl_1_b_bellman_ford.test.cpp
• test/aoj_grl_1_b_negative_loop.test.cpp
• test/aoj_grl_3_b.test.cpp
• test/aoj_grl_5_a_diameter.test.cpp
• test/aoj_grl_5_a_rerooting.test.cpp
• test/aoj_grl_6_a_costscalingdinic.test.cpp
• test/aoj_grl_6_a_maxflow_lower_bound.test.cpp
• test/aoj_grl_7_a_bipartite_matching.test.cpp
• test/aoj_ntl_1_d_eulerphi.test.cpp
• test/example.test.cpp
• test/yosupo_addition_of_big_integers.test.cpp
• test/yosupo_addition_of_hex_big_integers.test.cpp
• test/yosupo_aho_corasick.test.cpp
• test/yosupo_aplusb_dynamic_bitset.test.cpp
• test/yosupo_aplusb_functional_graph.test.cpp
• test/yosupo_aplusb_static_bitset.test.cpp
• test/yosupo_aplusb_top_k_sum.test.cpp
• test/yosupo_aplusb_top_kth.test.cpp
• test/yosupo_area_of_union_of_rectangles.test.cpp
• test/yosupo_assignment_hungarian.test.cpp
• test/yosupo_biconnected_components.test.cpp
• test/yosupo_binomial_coefficient.test.cpp
• test/yosupo_bipartitematching_hopcroft_karp.test.cpp
• test/yosupo_bitwise_and_convolution.test.cpp
• test/yosupo_bitwise_or_convolution.test.cpp
• test/yosupo_bitwise_xor_convolution.test.cpp
• test/yosupo_cartesian_tree.test.cpp
• test/yosupo_closest_pair.test.cpp
• test/yosupo_convolution.test.cpp
• test/yosupo_convolution_mod_1000000007_fft.test.cpp
• test/yosupo_counting_primes.test.cpp
• test/yosupo_cycle_detection_directed.test.cpp
• test/yosupo_cycle_detection_undirected.test.cpp
• test/yosupo_deque_operate_all_composite.test.cpp
• test/yosupo_directedmst.test.cpp
• test/yosupo_discrete_logarithm_mod.test.cpp
• test/yosupo_division_of_big_integers.test.cpp
• test/yosupo_division_of_hex_big_integers.test.cpp
• test/yosupo_dominator_tree.test.cpp
• test/yosupo_dynamic_graph_vertex_add_component_sum.test.cpp
• test/yosupo_dynamic_graph_vertex_add_component_sum_offlinedynamicconnectivity.test.cpp
• test/yosupo_dynamic_sequence_range_affine_range_sum.test.cpp
• test/yosupo_dynamic_tree_vertex_set_path_composite.test.cpp
• test/yosupo_eertree.test.cpp
• test/yosupo_enumerate_palindromes_manacher.test.cpp
• test/yosupo_enumerate_primes_get_prime_wheel.test.cpp
• test/yosupo_eulerian_trail_directed.test.cpp
• test/yosupo_eulerian_trail_undirected.test.cpp
• test/yosupo_exp_of_formal_power_series.test.cpp
• test/yosupo_factorize.test.cpp
• test/yosupo_find_linear_recurrence.test.cpp
• test/yosupo_frequency_table_of_tree_distance.test.cpp
• test/yosupo_general_matching.test.cpp
• test/yosupo_inverse_matrix.test.cpp
• test/yosupo_jump_on_tree.test.cpp
• test/yosupo_kth_root_integer.test.cpp
• test/yosupo_kth_term_of_linearly_recurrent_sequence.test.cpp
• test/yosupo_kth_term_of_linearly_recurrent_sequence_nth_term.test.cpp
• test/yosupo_lca.test.cpp
• test/yosupo_line_add_get_min.test.cpp
• test/yosupo_log_of_formal_power_series.test.cpp
• test/yosupo_lyndon_factorization.test.cpp
• test/yosupo_manhattanmst.test.cpp
• test/yosupo_many_aplusb.test.cpp
• test/yosupo_many_aplusb_modint_interface.test.cpp
• test/yosupo_many_factorials.test.cpp
• test/yosupo_matrix_det.test.cpp
• test/yosupo_matrix_product.test.cpp
• test/yosupo_matrix_rank.test.cpp
• test/yosupo_maximum_independent_set.test.cpp
• test/yosupo_min_cost_b_flow.test.cpp
• test/yosupo_min_plus_convolution_arbitrary_convex.test.cpp
• test/yosupo_min_plus_convolution_convex_arbitrary.test.cpp
• test/yosupo_min_plus_convolution_convex_convex.test.cpp
• test/yosupo_minimum_spanning_tree.test.cpp
• test/yosupo_multiplication_of_big_integers.test.cpp
• test/yosupo_multiplication_of_hex_big_integers.test.cpp
• test/yosupo_multipoint_evaluation.test.cpp
• test/yosupo_number_of_substrings.test.cpp
• test/yosupo_number_of_substrings_suffix_automaton.test.cpp
• test/yosupo_persistent_unionfind_persistent_unionfind.test.cpp
• test/yosupo_persistent_unionfind_undoableunionfind.test.cpp
• test/yosupo_point_add_range_sum.test.cpp
• test/yosupo_point_add_range_sum_dynamic_segtree.test.cpp
• test/yosupo_point_add_range_sum_persistent.test.cpp
• test/yosupo_point_add_rectangle_sum.test.cpp
• test/yosupo_point_add_rectangle_sum_fenwick_tree_2d.test.cpp
• test/yosupo_point_set_range_composite.test.cpp
• test/yosupo_polynomial_interpolation.test.cpp
• test/yosupo_polynomial_taylor_shift.test.cpp
• test/yosupo_pow_of_formal_power_series.test.cpp
• test/yosupo_pow_of_matrix.test.cpp
• test/yosupo_predecessor_problem_interval_set.test.cpp
• test/yosupo_primality_test.test.cpp
• test/yosupo_primitive_root.test.cpp
• test/yosupo_queue_operate_all_composite.test.cpp
• test/yosupo_range_affine_point_get_dualsegtree.test.cpp
• test/yosupo_range_affine_range_sum.test.cpp
• test/yosupo_range_chmin_chmax_add_range_sum.test.cpp
• test/yosupo_range_kth_smallest.test.cpp
• test/yosupo_rectangle_add_point_get.test.cpp
• test/yosupo_rooted_tree_isomorphism_classification_tree_hash.test.cpp
• test/yosupo_scc.test.cpp
• test/yosupo_segment_add_get_min.test.cpp
• test/yosupo_set_xor_min_binarytrie.test.cpp
• test/yosupo_shift_of_sampling_points_of_polynomial.test.cpp
• test/yosupo_shortest_path.test.cpp
• test/yosupo_shortest_path_radix_heap.test.cpp
• test/yosupo_sqrt_mod.test.cpp
• test/yosupo_sqrt_of_formal_power_series.test.cpp
• test/yosupo_static_convex_hull.test.cpp
• test/yosupo_static_range_frequency.test.cpp
• test/yosupo_static_range_inversions_query.test.cpp
• test/yosupo_static_range_sum_with_upper_bound.test.cpp
• test/yosupo_static_rectangle_sum.test.cpp
• test/yosupo_staticrmq_disjoint_sparse_table.test.cpp
• test/yosupo_staticrmq_sparsetable.test.cpp
• test/yosupo_stern_brocot_tree.test.cpp
• test/yosupo_subset_convolution.test.cpp
• test/yosupo_suffix_array.test.cpp
• test/yosupo_sum_of_floor_of_linear.test.cpp
• test/yosupo_sum_of_totient.test.cpp
• test/yosupo_system_of_linear_equations.test.cpp
• test/yosupo_tetration_mod.test.cpp
• test/yosupo_topological_sort.test.cpp
• test/yosupo_tree_diameter.test.cpp
• test/yosupo_two_edge_connected_components.test.cpp
• test/yosupo_twosat.test.cpp
• test/yosupo_unionfind.test.cpp
• test/yosupo_unionfind_quickfind.test.cpp
• test/yosupo_unionfind_with_potential.test.cpp
• test/yosupo_vertex_add_subtree_sum_dsu_on_tree.test.cpp
• test/yosupo_vertex_add_subtree_sum_hld.test.cpp
• test/yosupo_vertex_set_path_composite.test.cpp
• test/yosupo_vertex_set_path_composite_hld_helper.test.cpp
• test/yosupo_zalgorithm.test.cpp
• test/yuki1326_block_cut_tree.test.cpp
• test/yuki1358.test.cpp
• test/yuki2672_xor_basis.test.cpp
• test/yuki650_hld_edge.test.cpp
• test/yuki957.test.cpp
• test/yuki957_project_selection_problem.test.cpp