zawatins-library

テンプレート一覧

ライブラリノート一覧

Library Files

src/algorithm

• Cyclic Permutation(巡回置換分解) (src/algorithm/Cyclic-Permutation.hpp)
• Kadane's Algorithm (最大連続部分和) (src/algorithm/Kadane.hpp)
• LCS(最長共通部分列) (src/algorithm/LCS.hpp)
• RLE (連長圧縮) (src/algorithm/RLE.hpp)
• compression (座標圧縮) (src/algorithm/compression.hpp)
• count-inv (転倒数) (src/algorithm/count-inv.hpp)
• mo (Mo's Algorithm) (src/algorithm/mo.hpp)

src/dataStructure

• accum2d (二次元累積和) (src/dataStructure/accum2d.hpp)
• disjointSetUnion (互いに素な集合の森） (src/dataStructure/disjointSetUnion.hpp)
• dualSegmentTree (区間更新一点取得セグ木) (src/dataStructure/dualSegmentTree.hpp)
• fenwick_multiset (動的多重集合) (src/dataStructure/fenwick_multiset.hpp)
• fenwick_set (動的集合) (src/dataStructure/fenwick_set.hpp)
• fenwick_tree (一点加算、区間和取得) (src/dataStructure/fenwick_tree.hpp)
• lazySegmentTree (区間更新・区間和セグ木) (src/dataStructure/lazySegmentTree.hpp)
• lazySquareDecomp (区間更新可能平方分割) (src/dataStructure/lazySquareDecomp.hpp)
• monotone_CHT (追加直線の傾きが単調であることを仮定したCHT) (src/dataStructure/monotone_CHT.hpp)
• persistent array (全永続配列) (src/dataStructure/persistent-array.hpp)
• potentialized_unionfind (ポテンシャル付きUnion Find木) (src/dataStructure/potentialized_unionfind.hpp)
• segmentTree (一点更新・区間演算セグ木) (src/dataStructure/segmentTree.hpp)
• sparseTable ( $x \oplus x\ =\ x$ の区間クエリ解答 ) (src/dataStructure/sparseTable.hpp)
• squareDecomp (平方分割による区間クエリ) (src/dataStructure/squareDecomp.hpp)

src/geometryR2

• base (ベース) (src/geometryR2/base.hpp)
• ccw (ベクトルの位置関係) (src/geometryR2/ccw.hpp)
• line (直線) (src/geometryR2/line.hpp)
• point (点) (src/geometryR2/point.hpp)
• projection (射影) (src/geometryR2/projection.hpp)
• reflection (反射) (src/geometryR2/reflection.hpp)
• relation (オブジェクト同士の位置関係) (src/geometryR2/relation.hpp)
• segment (線分) (src/geometryR2/segment.hpp)

src/graph

• 01BFS (幅優先探索) (src/graph/01BFS.hpp)
• BFS (幅優先探索) (src/graph/BFS.hpp)
• Dijkstra (ダイクストラ法) (src/graph/Dijkstra.hpp)
• Functional Graph (ダブリングK回行動) (src/graph/Functional-Graph.hpp)
• Read-Graph (グラフ入力) (src/graph/Read-Graph.hpp)
• Read Weighted Graph (重み付きグラフ入力) (src/graph/Read-Weighted-Graph.hpp)
• range edge graph (区間に辺を貼るテク) (src/graph/range-edge-graph.hpp)
• rerooting (全方位木DP) (src/graph/rerooting.hpp)

src/graph/simple

• bfs (simple ver) (src/graph/simple/bfs.hpp)
• bipartiteJudge (二部グラフ判定) (src/graph/simple/bipartiteJudge.hpp)
• connectedComponents (連結成分分解 simple ver) (src/graph/simple/connectedComponents.hpp)
• dijkstra (simple ver) (src/graph/simple/dijkstra.hpp)
• reachability (到達可能性) (src/graph/simple/reachability.hpp)
• topological_sort (トポロジカルソート) (src/graph/simple/topological_sort.hpp)
• wf (ワーシャルフロイド simple ver) (src/graph/simple/wf.hpp)

src/math

• Divisor(約数列挙) (src/math/Divisor.hpp)
• Euler Function(オイラー関数) (src/math/Euler-Function.hpp)
• Extend GCD (拡張ユークリッドの互除法) (src/math/Extend-GCD.hpp)
• Pascal's Triangle (ナイーブな二項係数テーブル) (src/math/Pascal-Triangle.hpp)
• Factorize(素因数分解) (src/math/factorize.hpp)
• gcdConvlution (添字gcd畳み込み・約数系の高速ゼータ/メビウス変換) (src/math/gcdConvolution.hpp)
• linearSieve (線形篩・素因数分解/約数列挙) (src/math/linearSieve.hpp)
• matrix (行列) (src/math/matrix.hpp)
• miller-rabin (素数判定法) (src/math/miller-rabin.hpp)
• mobiusFunction (メビウス関数値の列挙) (src/math/mobiusFunction.hpp)
• mod combinations (組み合わせの数 mod) (src/math/mod-combinations.hpp)
• modint (src/math/modint.hpp)
• primeSieve (エラトステネスの篩） (src/math/primeSieve.hpp)

src/string

• rollinghash (ロリハ) (src/string/rollinghash.hpp)

src/template

• accum1d (累積和) (src/template/accum1d.hpp)
• binary-seach-ld (浮動小数点数二分探索) (src/template/binary-search-ld.hpp)
• binary-seach (整数二分探索) (src/template/binary-search.hpp)
• input (標準入力) (src/template/input.hpp)
• makebuc (バケット) (src/template/makebuc.hpp)
• output (標準出力) (src/template/output.hpp)
• reversed (reverse) (src/template/reversed.hpp)
• sorted (ソート列を返す) (src/template/sorted.hpp)

src/utility/fenwick_tree

• fenwick tree add structure (src/utility/fenwick_tree/add.hpp)
• fenwick tree xor structure (src/utility/fenwick_tree/xor.hpp)

src/utility/monoid

• addMonoid (加法モノイド) (src/utility/monoid/addMonoid.hpp)
• maxMonoid (最大値モノイド) (src/utility/monoid/maxMonoid.hpp)
• minMonoid (最小値モノイド) (src/utility/monoid/minMonoid.hpp)
• rangeAddMonoid (区間和モノイド) (src/utility/monoid/rangeAddMonoid.hpp)
• xorMonoid (排他的論理和モノイド) (src/utility/monoid/xorMonoid.hpp)

src/utility/semiring

• max-plus-semiring (max+) (src/utility/semiring/max-plus-semiring.hpp)
• min-plus-semiring (min+) (src/utility/semiring/min-plus-semiring.hpp)
• normal-semiring (+x) (src/utility/semiring/normal-semiring.hpp)
• xor-and-semiring (^&) (src/utility/semiring/xor-and-semiring.hpp)

src/utility/sparseTable

• bitwiseAndStructure (Sparse Table) (src/utility/sparseTable/bitwiseAndStructure.hpp)
• bitwiseOrStructure (Sparse Table) (src/utility/sparseTable/bitwiseOrStructure.hpp)
• gcdStructure (Sparse Table) (src/utility/sparseTable/gcdStructure.hpp)
• maxStructure (Sparse Table) (src/utility/sparseTable/maxStructure.hpp)
• minStructure (Sparse Table) (src/utility/sparseTable/minStructure.hpp)

Verification Files

test

• test/01BFS.test.cpp
• test/ABC125-C.test.cpp
• test/ABC170-D.test.cpp
• test/ABC174-F.test.cpp
• test/ABC177-E.test.cpp
• test/ABC179-F.test.cpp
• test/ABC185-E.test.cpp
• test/ABC186-F.test.cpp
• test/ABC199-D.test.cpp
• test/ABC203-E.test.cpp
• test/ABC220-F.test.cpp
• test/ABC222-F.test.cpp
• test/ABC236-E.test.cpp
• test/ABC242-G.test.cpp
• test/ABC250-D.test.cpp
• test/ABC254-D.test.cpp
• test/ABC259-B.test.cpp
• test/ABC267-C.test.cpp
• test/ABC278-E.test.cpp
• test/ABC280-A.test.cpp
• test/ABC282-D.test.cpp
• test/ABC284-C.test.cpp
• test/ABC284f.test.cpp
• test/ABC285-D.test.cpp
• test/ABC289-B.test.cpp
• test/ABC289-D.test.cpp
• test/ABC289-G.test.cpp
• test/ABC291-F.test.cpp
• test/ABC292-C.test.cpp
• test/AGC005-B.test.cpp
• test/ALPC-J.test.cpp
• test/ALPC-L.test.cpp
• test/AOJ0519.test.cpp
• test/AOJ1595.test.cpp
• test/AOJCGL-2A.test.cpp
• test/AOJCGL-2B.test.cpp
• test/ARC033-C.test.cpp
• test/ARC075-E.test.cpp
• test/BFS.test.cpp
• test/CF856-D.test.cpp
• test/Dijkstra1.test.cpp
• test/Dijkstra2.test.cpp
• test/Dijkstra3.test.cpp
• test/EDPC-R.test.cpp
• test/EDPC-Z.test.cpp
• test/Functional_Graph.test.cpp
• test/LCS.test.cpp
• test/Pascal-Triangle.test.cpp
• test/RLE.test.cpp
• test/Read-Graph-AtCoder.test.cpp
• test/Read-Graph.test.cpp
• test/Read-Weighted-Graph.test.cpp
• test/accum1d.test.cpp
• test/accum1d2.test.cpp
• test/accum2d.test.cpp
• test/aoj_alds_6_D.test.cpp
• test/aoj_dpl_5_a.test.cpp
• test/aoj_itp1_3_d.test.cpp
• test/aoj_ntl_1_a.test.cpp
• test/aoj_ntl_1_d.test.cpp
• test/aoj_ntl_1_e.test.cpp
• test/binary-search.test.cpp
• test/ccw.test.cpp
• test/compression.test.cpp
• test/connectedComponents1.test.cpp
• test/count-inv.test.cpp
• test/disjointSetUnion-test1.test.cpp
• test/disjointSetUnion-test2.test.cpp
• test/disjointSetUnion-unitTest.test.cpp
• test/dualSegmentTree-AOJRAQ.test.cpp
• test/fenwick_tree.test.cpp
• test/fenwick_tree2.test.cpp
• test/gcdConvolution.test.cpp
• test/input1.test.cpp
• test/input2.test.cpp
• test/input3.test.cpp
• test/input4.test.cpp
• test/input5.test.cpp
• test/kadane.test.cpp
• test/lazySegmentTree-AOJ-RAQRSQ.test.cpp
• test/lazySegmentTree-AOJ-RAQRmQ.test.cpp
• test/lazySegmentTree-AOJ-RUQRSQ.test.cpp
• test/lazySegmentTree-AOJ-RUQRmQ.test.cpp
• test/lazySquareDecomp-AOJ-RAQRSQ.test.cpp
• test/lazySquareDecomp-AOJ-RAQRmQ.test.cpp
• test/lazySquareDecomp-AOJ-RUQRSQ.test.cpp
• test/lazySquareDecomp-AOJ-RUQRmQ.test.cpp
• test/makebuc.test.cpp
• test/matrix.test.cpp
• test/miller-rabin.test.cpp
• test/mo.test.cpp
• test/mobiusFunction.test.cpp
• test/mod-combinations1.test.cpp
• test/modint.test.cpp
• test/output1.test.cpp
• test/output2.test.cpp
• test/output3.test.cpp
• test/persistent-array.test.cpp
• test/potentialized_unionfind1.test.cpp
• test/potentialized_unionfind2.test.cpp
• test/potentialized_unionfind3.test.cpp
• test/practice90-037.test.cpp
• test/primeSieve.test.cpp
• test/projection.test.cpp
• test/range-edge-graph1.test.cpp
• test/range-edge-graph2.test.cpp
• test/reflection.test.cpp
• test/rerooting.test.cpp
• test/reversed.test.cpp
• test/rollinghash.test.cpp
• test/segmentTree-AOJ-RSQ.test.cpp
• test/segmentTree-AOJ-RmQ.test.cpp
• test/segmentTree-RXQ.test.cpp
• test/simple-bfs1.test.cpp
• test/simple-bfs2.test.cpp
• test/simple-bipartite-judge1.test.cpp
• test/simple-dijkstra1.test.cpp
• test/simple-dijkstra2.test.cpp
• test/simple-topological_sort.test.cpp
• test/simple-wf1.test.cpp
• test/sorted.test.cpp
• test/sparseTable.test.cpp
• test/squareDecomp-AOJ-RSQ.test.cpp
• test/squareDecomp-AOJ-RmQ.test.cpp
• test/squareDecomp-LC-RSQ.test.cpp