compro-library

Library Files

lib/00-util

• FastIO (lib/00-util/FastIO.cpp)
• ModInt (lib/00-util/ModInt.cpp)
• NBase - N進数 (lib/00-util/NBase.cpp)
• RangeIndex - 区間index (lib/00-util/RangeIndex.cpp)
• Rational - 有理数 (lib/00-util/Rational.cpp)
• RuntimeModInt - 実行時ModInt (lib/00-util/RuntimeModInt.cpp)
• Zarts - 座標圧縮 (lib/00-util/Zarts.cpp)
• ZobristHash - Zobrist Hashing (lib/00-util/ZobristHash.cpp)

lib/10-segment-tree

• DualSegmentTree - 非再帰抽象化双対セグメント木 (lib/10-segment-tree/DualSegmentTree.cpp)
• DynamicSegmentTree - 非再帰抽象化動的セグメント木 (lib/10-segment-tree/DynamicSegmentTree.cpp)
• LazySegmentTree - 非再帰抽象化遅延評価セグメント木 (lib/10-segment-tree/LazySegmentTree.cpp)
• RangeIntegerFrequencyQuerySqrtTree - 区間interger頻度クエリ用平方分割木 (lib/10-segment-tree/RangeIntegerFrequencyQuerySqrtTree.cpp)
• RangeSetQuerySqrtTree - 区間setクエリ用平方分割木 (lib/10-segment-tree/RangeSetQuerySqrtTree.cpp)
• SegmentTree - 非再帰抽象化セグメント木 (lib/10-segment-tree/SegmentTree.cpp)
• SegmentTree2D - 非再帰抽象化セグメント木2D (lib/10-segment-tree/SegmentTree2D.cpp)
• SegmentTreeBeats (lib/10-segment-tree/SegmentTreeBeats.cpp)
• SortableSegmentTree - ソート可能抽象化セグメント木 (lib/10-segment-tree/SortableSegmentTree.cpp)

lib/11-binary-indexed-tree

• BinaryIndexedTree - BIT (lib/11-binary-indexed-tree/BinaryIndexedTree.cpp)
• BinaryIndexedTreeOffline2D - オフライン2次元BIT (lib/11-binary-indexed-tree/BinaryIndexedTreeOffline2D.cpp)
• DynamicBinaryIndexedTree - 動的BIT (lib/11-binary-indexed-tree/DynamicBinaryIndexedTree.cpp)

lib/12-binary-search-tree

• BinaryTrie (lib/12-binary-search-tree/BinaryTrie.cpp)
• LazyRandomizedBinarySearchTreeSequence - 遅延評価ランダム平衡二分探索木列 (lib/12-binary-search-tree/LazyRandomizedBinarySearchTreeSequence.cpp)
• LazySplayTreeSequence - 遅延評価SplayTree列 (lib/12-binary-search-tree/LazySplayTreeSequence.cpp)
• RandomizedBinarySearchTreeSequence - ランダム平衡二分探索木列 (lib/12-binary-search-tree/RandomizedBinarySearchTreeSequence.cpp)
• RandomizedBinarySearchTree - ランダム平衡二分探索木set (lib/12-binary-search-tree/RandomizedBinarySearchTreeSet.cpp)
• SimpleBinaryTrie (lib/12-binary-search-tree/SimpleBinaryTrie.cpp)
• WordSizeTreeSet - 64分木 (lib/12-binary-search-tree/WordSizeTreeSet.cpp)

lib/13-static-range-query

• DisjointSparseTable (lib/13-static-range-query/DisjointSparseTable.cpp)
• LongestIncreasingSubsequence - LIS (lib/13-static-range-query/LongestIncreasingSubsequence.cpp)
• SlideMost - スライド最小値/最大値 (lib/13-static-range-query/SlideMost.cpp)
• SparseTable (lib/13-static-range-query/SparseTable.cpp)
• StaticRangeInversionQuery - 静的区間転倒数クエリ (lib/13-static-range-query/StaticRangeInversionQuery.cpp)
• StaticRangeMexQuery - 静的区間mexクエリ (lib/13-static-range-query/StaticRangeMexQuery.cpp)
• StaticRangeModeQuery - 静的区間最頻値クエリ (lib/13-static-range-query/StaticRangeModeQuery.cpp)
• StaticRangePairQuery - 静的区間pairクエリ (lib/13-static-range-query/StaticRangePairQuery.cpp)
• StaticRangeSetQuery - 静的区間setクエリ (lib/13-static-range-query/StaticRangeSetQuery.cpp)
• StaticRangeSortQuery - 静的区間sortクエリ (lib/13-static-range-query/StaticRangeSortQuery.cpp)
• WaveletMatrix (lib/13-static-range-query/WaveletMatrix.cpp)

lib/15-queue

• DoubleEndedPriorityQuere - 両端priority queue (lib/15-queue/DoubleEndedPriorityQuere.cpp)
• PersistentQueue - 永続queue (lib/15-queue/PersistentQueue.cpp)
• RadixHeap - 非負整数heap (lib/15-queue/RadixHeap.cpp)
• SwagDeque (lib/15-queue/SwagDeque.cpp)
• SwagQueue (lib/15-queue/SwagQueue.cpp)

lib/16-convex-hull-trick

• ConvexHullTrick - 非単調CHT (lib/16-convex-hull-trick/ConvexHullTrick.cpp)
• ConvexHullTrickMonotone - 単調CHT (lib/16-convex-hull-trick/ConvexHullTrickMonotone.cpp)
• ConvexHullTrickSegmentTree - 非単調CHTセグメント木 (lib/16-convex-hull-trick/ConvexHullTrickSegmentTree.cpp)
• LiChaoTree (lib/16-convex-hull-trick/LiChaoTree.cpp)

lib/17-rectangle

• IntersectRectangle - 長方形の交差のカウント (lib/17-rectangle/IntersectRectangle.cpp)
• MaximumRectangle - 最大長方形 (lib/17-rectangle/MaximumRectangle.cpp)

lib/30-math

• Combination - 二項係数 (lib/30-math/Combination.cpp)
• CombinationMod - mod上の二項係数・階乗 (lib/30-math/CombinationMod.cpp)
• Eratosthenes - エラトステネスの篩 (lib/30-math/Eratosthenes.cpp)
• FloorSum - 直線領域の格子点数 (lib/30-math/FloorSum.cpp)
• Garner - 中国剰余定理 (lib/30-math/Garner.cpp)
• Matrix - 行列演算 (lib/30-math/Matrix.cpp)
• MontmortNumber - 完全順列,撹乱順列の個数 (lib/30-math/MontmortNumber.cpp)
• Polynomial - 多項式補間 (lib/30-math/Polynomial.cpp)
• Prime - 高速素因数分解・ミラーラビン素数判定・Gcd・Lcm (lib/30-math/Prime.cpp)
• PrimitiveRoot - 原始根 (lib/30-math/PrimitiveRoot.cpp)
• Quotient - 商の集合 (lib/30-math/Quotient.cpp)

lib/31-convolution

• DivisorZetaMoebiusTransform - 約数のゼータ・メビウス変換 (gcd/lcm畳み込み) (lib/31-convolution/DivisorZetaMoebiusTransform.cpp)
• NumberTheoreticalTransform - 数論変換 (lib/31-convolution/NumberTheoreticalTransform.cpp)

lib/32-polynomial

• FormalPowerSeries - 形式的冪級数 (lib/32-polynomial/FormalPowerSeries.cpp)

lib/40-graph

• Dijkstra - 多次元ダイクストラ (lib/40-graph/Dijkstra.cpp)
• DinicMaxFlow - Dinicフロー (lib/40-graph/DinicMaxFlow.cpp)
• Graph (lib/40-graph/Graph.cpp)
• MinimumDirectedClosedCircuit - 有向グラフの最小閉路検出 (lib/40-graph/MinimumDirectedClosedCircuit.cpp)
• MinimumUndirectedClosedCircuit - 無向グラフの最小閉路検出 (lib/40-graph/MinimumUndirectedClosedCircuit.cpp)
• PrimalDualMinCostFlow - 最短路反復の最小費用流 (lib/40-graph/PrimalDualMinCostFlow.cpp)
• StaticTree - 木 (lib/40-graph/StaticTree.cpp)
• StronglyConnectedComponents - 強連結成分分解 (lib/40-graph/StronglyConnectedComponents.cpp)

lib/41-union-find-tree

• PotentializedUnionFindTree - ポテンシャル付きUnionFind木 (lib/41-union-find-tree/PotentializedUnionFindTree.cpp)
• UndoUnionFindTree - Undoつき Union Find Tree (lib/41-union-find-tree/UndoUnionFindTree.cpp)
• UnionFindTree - Union Find Tree (lib/41-union-find-tree/UnionFindTree.cpp)

lib/50-string

• LevenshteinDistance - 編集距離 (lib/50-string/LevenshteinDistance.cpp)
• LongestCommonSubsequence - LCS (lib/50-string/LongestCommonSubsequence.cpp)
• Zalgorithm (lib/50-string/Zalgorithm.cpp)

lib/70-geometory

• Argument - 偏角 (lib/70-geometory/Argument.cpp)
• Distance - 距離 (lib/70-geometory/Distance.cpp)
• KdTree - 2次元頂点分類木 (lib/70-geometory/KdTree.cpp)
• RationalLine - 有理数直線 (lib/70-geometory/RationalLine.cpp)

lib/98-needless

• IntegerRangeFrequencyQueryTree - integer専用区間freq (lib/98-needless/IntegerRangeFrequencyQueryTree.cpp)
• RangeFrequencyQueryTree - 区間freqクエリ用Tree (lib/98-needless/RangeFrequencyQueryTree.cpp)

lib/99-operator/abel

• AbelPrefixGcdPointUpdate (lib/99-operator/abel/AbelPrefixGcdPointUpdate.cpp)
• AbelPrefixSumPointAdd (lib/99-operator/abel/AbelPrefixSumPointAdd.cpp)

lib/99-operator/monoid

• MonoidRangeCompositePointUpdate - [区間一次関数, 点更新] (lib/99-operator/monoid/MonoidRangeCompositePointUpdate.cpp)
• MonoidRangeGcdPointUpdate - [区間gcd, 点更新] (lib/99-operator/monoid/MonoidRangeGcdPointUpdate.cpp)
• MonoidRangeMinPointUpdate - [区間min, 点更新] (lib/99-operator/monoid/MonoidRangeMinPointUpdate.cpp)
• MonoidRangeMulPointUpdate - [区間積, 一点更新] (lib/99-operator/monoid/MonoidRangeMulPointUpdate.cpp)
• MonoidRangeSumPointAdd - [区間和, 一点加算] (lib/99-operator/monoid/MonoidRangeSumPointAdd.cpp)

lib/99-operator/monoid-lazy

• MonoidRangeFoldEulerTourSumRangeOperateAdd - fold:区間オイラーツアー和, operate:区間加算 (lib/99-operator/monoid-lazy/MonoidRangeFoldEulerTourSumRangeOperateAdd.cpp)
• MonoidRangeFoldMinRangeOperateAdd - fold:区間min, operate:区間加算 (lib/99-operator/monoid-lazy/MonoidRangeFoldMinRangeOperateAdd.cpp)
• MonoidRangeFoldMinRangeOperateArithmeticUpdate - fold:区間min, operate:区間等差数列更新] (lib/99-operator/monoid-lazy/MonoidRangeFoldMinRangeOperateArithmeticUpdate.cpp)
• MonoidRangeFoldMinRangeOperateUpdate - fold:区間min, operate:区間更新 (lib/99-operator/monoid-lazy/MonoidRangeFoldMinRangeOperateUpdate.cpp)
• MonoidRangeSumRangeAdd - fold:区間和, opearate:区間加算 (lib/99-operator/monoid-lazy/MonoidRangeFoldSumRangeOperateAdd.cpp)
• MonoidRangeFoldSumRangeOperateAffine - fold:区間和, operate:区間アフィン変換 (lib/99-operator/monoid-lazy/MonoidRangeFoldSumRangeOperateAffine.cpp)
• MonoidRangeFoldSumRangeOperateUpdate - fold:区間sum, operate:区間更新 (lib/99-operator/monoid-lazy/MonoidRangeFoldSumRangeOperateUpdate.cpp)
• MonoidRangeSumRangeUpdate - [区間和, 区間更新] (lib/99-operator/monoid-lazy/MonoidRangeSumRangeUpdate.cpp)

lib/99-operator/operator

• lib/99-operator/operator/ValueMax.cpp
• lib/99-operator/operator/ValueMin.cpp

non-verified

• non-verified/BinaryColumnEchelonFormalize.cpp
• non-verified/BipartiteMatching.cpp
• non-verified/Chinese_Remainder_Theorem.cpp
• non-verified/CircleIntersection.cpp
• non-verified/Ford_Fulkerson.cpp
• non-verified/Line_Intersection_Judge.cpp
• non-verified/LowLink.cpp
• non-verified/MaximumSubarray.cpp
• non-verified/Maximum_Segment_Sum.cpp
• non-verified/Mo.cpp
• non-verified/Parser.cpp
• non-verified/Partition_Number.cpp
• non-verified/Permutation_Mod.cpp
• non-verified/Rarts.cpp
• non-verified/RollingHash.cpp
• non-verified/SmallestEnclosingDisc.cpp
• non-verified/Union_Find_Tree_Persistence.cpp
• non-verified/XorShift.cpp

snippet

• snippet/main.go

snippet/model

• snippet/model/file_node.go

Verification Files

test/binary-indexed-tree

• test/binary-indexed-tree/BinaryIndexedTree-rsqraq.test.cpp
• test/binary-indexed-tree/BinaryIndexedTreeOffline2D-1.test.cpp
• test/binary-indexed-tree/BinaryIndexedTreeOffline2D-2.test.cpp
• test/binary-indexed-tree/DynamicBinaryIndexedTree-rsqraq.test.cpp

test/binary-search-tree

• test/binary-search-tree/BinaryTrie-set-xor-min.test.cpp
• test/binary-search-tree/LazyRandomizedBinarySearchTreeSequence-insert-erase.test.cpp
• test/binary-search-tree/LazyRandomizedBinarySearchTreeSequence-reverse.test.cpp
• test/binary-search-tree/LazyRandomizedBinarySearchTreeSequence-reverse2.test.cpp
• test/binary-search-tree/LazyRandomizedBinarySearchTreeSequence-rsqrafq.test.cpp
• test/binary-search-tree/LazyRandomizedBinarySearchTreeSequence-rsqraq.test.cpp
• test/binary-search-tree/LazySplayTreeSequence-insert-erase.test.cpp
• test/binary-search-tree/LazySplayTreeSequence-reverse.test.cpp
• test/binary-search-tree/LazySplayTreeSequence-reverse2.test.cpp
• test/binary-search-tree/LazySplayTreeSequence-rmq.test.cpp
• test/binary-search-tree/LazySplayTreeSequence-rsqrafq.test.cpp
• test/binary-search-tree/RandomizedBinarySearchTreeSequence-insert-erase.test.cpp
• test/binary-search-tree/RandomizedBinarySearchTreeSequence-rmq.test.cpp
• test/binary-search-tree/RandomizedBinarySearchTreeSet-get.test.cpp
• test/binary-search-tree/RandomizedBinarySearchTreeSet-med.test.cpp
• test/binary-search-tree/RandomizedBinarySearchTreeSet-pair.test.cpp
• test/binary-search-tree/WordSizeTreeSet.test.cpp

test/convex-hull-trick

• test/convex-hull-trick/ConvexHullTrick-max.test.cpp
• test/convex-hull-trick/ConvexHullTrick-min.test.cpp
• test/convex-hull-trick/ConvexHullTrick-no-monotone.test.cpp
• test/convex-hull-trick/ConvexHullTrickMonotone-max.test.cpp
• test/convex-hull-trick/ConvexHullTrickMonotone-min.test.cpp
• test/convex-hull-trick/LiChaoTree-line.test.cpp
• test/convex-hull-trick/LiChaoTree-segment.test.cpp

test/convolution

• test/convolution/DivisorZetaMoebiusTransform-gcd-convolution.test.cpp
• test/convolution/DivisorZetaMoebiusTransform-lcm-convolution.test.cpp
• test/convolution/NumberTheoreticalTransform-conv-1000000007-1.test.cpp
• test/convolution/NumberTheoreticalTransform-conv-998244353-1.test.cpp
• test/convolution/NumberTheoreticalTransform-conv-998244353-2.test.cpp
• test/convolution/NumberTheoreticalTransform-conv-fft.test.cpp

test

• test/example.test.cpp

test/geometory

• test/geometory/Argument-sort-by-atan2l.test.cpp
• test/geometory/Distance-line.test.cpp
• test/geometory/KdTree.test.cpp

test/graph

• test/graph/Dijkstra-restore.test.cpp
• test/graph/Dijkstra.test.cpp
• test/graph/DinicMaxFlow-1.test.cpp
• test/graph/DinicMaxFlow-2.test.cpp
• test/graph/MinimumDirectedClosedCircuit.test.cpp
• test/graph/MinimumUndirectedClosedCircuit.test.cpp
• test/graph/PrimalDualMinCostFlow.test.cpp
• test/graph/StronglyConnectedComponents-1.test.cpp
• test/graph/StronglyConnectedComponents-2.test.cpp
• test/graph/StronglyConnectedComponents-2sat.test.cpp
• test/graph/Tree-diameter.test.cpp
• test/graph/Tree-eulertour.test.cpp
• test/graph/Tree-hld-path.test.cpp
• test/graph/Tree-hld-vertex-1.test.cpp
• test/graph/Tree-hld-vertex-2.test.cpp
• test/graph/Tree-hld-vertex-3.test.cpp
• test/graph/Tree-lca-idx.test.cpp
• test/graph/Tree-lca.test.cpp
• test/graph/Tree-parent.test.cpp
• test/graph/Tree-rerooting.test.cpp
• test/graph/Tree-size.test.cpp

test/math

• test/math/CombinationMod-binom.test.cpp
• test/math/CombinationMod-factorial.test.cpp
• test/math/Eratosthenes.test.cpp
• test/math/FloorSum.test.cpp
• test/math/Garner.test.cpp
• test/math/Matrix-det.test.cpp
• test/math/Matrix-pow.test.cpp
• test/math/MontmortNumber.test.cpp
• test/math/Prime-divisor-1.test.cpp
• test/math/Prime-miller-rabin-1.test.cpp
• test/math/Prime-miller-rabin-2.test.cpp
• test/math/Prime-rho-discrete-logarithm.test.cpp
• test/math/Prime-rho.test.cpp
• test/math/Quotient.test.cpp

test/needless

• test/needless/IntegerRangeFrequencyQueryTree-range-freq.test.cpp
• test/needless/RangeFrequencyQueryTree-range-freq.test.cpp

test/polynomial

• test/polynomial/FormalPowerSeries-exp.test.cpp
• test/polynomial/FormalPowerSeries-interpolation.test.cpp
• test/polynomial/FormalPowerSeries-inv.test.cpp
• test/polynomial/FormalPowerSeries-log.test.cpp
• test/polynomial/FormalPowerSeries-multi-eval.test.cpp
• test/polynomial/FormalPowerSeries-nth.test.cpp
• test/polynomial/FormalPowerSeries-pow.test.cpp

test/queue

• test/queue/DoubleEndedPriorityQuere.test.cpp
• test/queue/PerisitentQueue.test.cpp
• test/queue/RadixHeap-32bit.test.cpp
• test/queue/RadixHeap-64bit.test.cpp
• test/queue/SwagDeque-deque-composite.test.cpp
• test/queue/SwagDeque-queue-composite.test.cpp
• test/queue/SwagQueue-composite.test.cpp
• test/queue/SwagQueue-gcd.test.cpp

test/rectangle

• test/rectangle/MaximumRectangle-1.test.cpp
• test/rectangle/MaximumRectangle-2.test.cpp

test/segment-tree

• test/segment-tree/DualSegmentTree-pcq.test.cpp
• test/segment-tree/DynamicSegmentTree-rcq-1.test.cpp
• test/segment-tree/DynamicSegmentTree-rsq-1.test.cpp
• test/segment-tree/DynamicSegmentTree-rsq-2.test.cpp
• test/segment-tree/DynamicSegmentTree-rsq-3.test.cpp
• test/segment-tree/LazySegmentTree-rmqraq.test.cpp
• test/segment-tree/LazySegmentTree-rsqruq.test.cpp
• test/segment-tree/RangeIntegerFrequencyQuerySqrtTree-range-freq.test.cpp
• test/segment-tree/SegmentTree-prefix-binary-search.test.cpp
• test/segment-tree/SegmentTree-rcq.test.cpp
• test/segment-tree/SegmentTree-rmq.test.cpp
• test/segment-tree/SegmentTree-rsq.test.cpp
• test/segment-tree/SegmentTree-suffix-binary-search.test.cpp
• test/segment-tree/SegmentTree2D-rsq.test.cpp
• test/segment-tree/SegmentTreeBeats-1.test.cpp
• test/segment-tree/SegmentTreeBeats-2.test.cpp
• test/segment-tree/SortableSegmentTree-rcq.test.cpp

test/static-range-query

• test/static-range-query/DisjointSparseTable.test.cpp
• test/static-range-query/LongestIncreasingSubsequence-index.test.cpp
• test/static-range-query/LongestIncreasingSubsequence-size.test.cpp
• test/static-range-query/SlideMost.test.cpp
• test/static-range-query/SparseTable.test.cpp
• test/static-range-query/StaticRangeInversionQuery.test.cpp
• test/static-range-query/WaveletMatrix-range-freq.test.cpp
• test/static-range-query/WaveletMatrix-range-kth-1.test.cpp
• test/static-range-query/WaveletMatrix-range-kth-2.test.cpp

test/string

• test/string/LevenshteinDistance-1.test.cpp
• test/string/LevenshteinDistance-2.test.cpp
• test/string/LongestCommonSubsequence.test.cpp
• test/string/Zalgorithm.test.cpp

test/union-find-tree

• test/union-find-tree/PotentializedUnionFindTree.test.cpp
• test/union-find-tree/UndoUnionFindTree.test.cpp
• test/union-find-tree/UnionFindTree.test.cpp

test/util

• test/util/FastIO-int128.test.cpp
• test/util/FastIO-int64.test.cpp
• test/util/ModInt.test.cpp
• test/util/NBase.test.cpp
• test/util/RangeIndex.test.cpp
• test/util/RuntimeModInt.test.cpp
• test/util/Zarts.test.cpp