fix/aoj 2725 infinity

geometry/template.hpp

@@ -10,6 +10,7 @@
 #include <ostream>
 #include <utility>
 #include <vector>
+
 using Real = double;
 using Point = std::complex<Real>;
 const Real EPS = 1e-8, PI = std::acos(-1);

graph/flow/bipartite-flow.hpp

@@ -7,6 +7,7 @@
 #include <queue>
 #include <utility>
 #include <vector>
+
 /**
  * @brief Bipartite Flow(二部グラフのフロー)
  *

graph/flow/bipartite-matching.hpp

@@ -2,6 +2,7 @@
 
 #include <iostream>
 #include <vector>
+
 /**
  * @brief Bipartite-Matching(二部グラフの最大マッチング)
  *

graph/flow/dinic-capacity-scaling.hpp

@@ -6,6 +6,7 @@
 #include <queue>
 #include <type_traits>
 #include <vector>
+
 /**
  * @brief Dinic Capacity Scaling(最大流)
  *

graph/flow/dinic.hpp

@@ -5,6 +5,7 @@
 #include <limits>
 #include <queue>
 #include <vector>
+
 /**
  * @brief Dinic(最大流)
  *

graph/flow/ford-fulkerson.hpp

@@ -4,6 +4,7 @@
 #include <iostream>
 #include <limits>
 #include <vector>
+
 /**
  * @brief Ford Fulkerson(最大流)
  *

graph/flow/gabow-edmonds.hpp

@@ -3,6 +3,7 @@
 #include <queue>
 #include <utility>
 #include <vector>
+
 // https://qiita.com/Kutimoti_T/items/5b579773e0a24d650bdf
 
 /**

graph/flow/maxflow-lower-bound.hpp

@@ -4,6 +4,7 @@
 #include <iostream>
 #include <optional>
 #include <vector>
+
 template <typename flow_t, template <typename> class F>
 struct MaxFlowLowerBound {
   F<flow_t> flow;

graph/flow/primal-dual.hpp

@@ -7,6 +7,7 @@
 #include <queue>
 #include <utility>
 #include <vector>
+
 /**
  * @brief Primal Dual(最小費用流)
  *

graph/flow/push-relabel.hpp

@@ -5,6 +5,7 @@
 #include <numeric>
 #include <queue>
 #include <vector>
+
 class Stack {
  private:
   const int N, H;

graph/shortest-path/shortest-nonzero-path.hpp

@@ -7,6 +7,7 @@
 #include <tuple>
 #include <utility>
 #include <vector>
+
 /**
  * @brief Shortest Nonzero Path(群ラベル制約付き単一始点最短路)
  */

graph/tree/static-top-tree.hpp

@@ -5,6 +5,7 @@
 #include <utility>
 #include <variant>
 #include <vector>
+
 template <typename G>
 struct StaticTopTree {
   enum OpType { Vertex, AddVertex, AddEdge, Rake, Compress };

math/combinatorics/vectorize-mod-int.hpp

@@ -3,6 +3,7 @@
 #include <immintrin.h>
 
 #include <cstdint>
+
 #pragma GCC target("avx2")
 
 struct alignas(32) VectorizeModInt {

math/fps/bell.hpp

@@ -1,6 +1,7 @@
 #pragma once
 
 #include <cmath>
+
 /**
  * @brief Bell(ベル数)
  *

math/fps/berlekamp-massey.hpp

@@ -1,6 +1,7 @@
 #pragma once
 
 #include <iterator>
+
 /**
  * @brief Berlekamp Massey
  */

math/fps/coeff-of-rational-function.hpp

@@ -1,6 +1,7 @@
 #pragma once
 
 #include <cstdint>
+
 /**
  * @brief Coeff of Rational Function
  *

math/fps/count-subset-sum.hpp

@@ -2,6 +2,7 @@
 
 #include <cmath>
 #include <vector>
+
 /**
  * @brief Count Subset Sum
  */

math/fps/eulerian.hpp

@@ -2,6 +2,7 @@
 
 #include <cmath>
 #include <vector>
+
 /**
  * @brief Eulerian(オイラー数)
  */

math/fps/sparse-matrix.hpp

@@ -7,6 +7,7 @@
 #include <vector>
 
 #include "formal-power-series.hpp"
+
 template <typename T>
 using FPSGraph = std::vector<std::vector<std::pair<int, T> > >;
 

math/fps/stirling-second.hpp

@@ -1,6 +1,7 @@
 #pragma once
 
 #include <cmath>
+
 /**
  * @brief Stirling Second(第二種スターリング数)
  */

math/fps/subproduct-tree.hpp

@@ -1,6 +1,7 @@
 #pragma once
 
 #include <vector>
+
 /**
  * @brief Subproduct Tree
  */

string/palindromic-tree.hpp

@@ -3,6 +3,7 @@
 #include <map>
 #include <string>
 #include <vector>
+
 /**
  * @brief Palindromic Tree(回文木)
  * @see https://math314.hateblo.jp/entry/2016/12/19/005919

string/suffix-array.hpp

@@ -8,6 +8,7 @@
 #include <string>
 #include <utility>
 #include <vector>
+
 /**
  * @brief Suffix Array(接尾辞配列)
  */

structure/bbst/lazy-red-black-tree.hpp

@@ -8,6 +8,7 @@
 #include <vector>
 
 #include "../../other/vector-pool.hpp"
+
 /**
  * @brief Lazy-Red-Black-Tree(遅延伝搬赤黒木)
  *

structure/bbst/lazy-reversible-splay-tree.hpp

@@ -5,6 +5,7 @@
 #include <tuple>
 #include <utility>
 #include <vector>
+
 /**
  * @brief Lazy-Reversible-Splay-Tree(遅延伝搬反転可能Splay木)
  */

structure/bbst/lazy-weight-balanced-tree.hpp

@@ -8,6 +8,7 @@
 #include <vector>
 
 #include "../../other/vector-pool.hpp"
+
 /**
  * @brief Lazy-Weight-Balanced-Tree(遅延伝搬重み平衡木)
  */

structure/bbst/persistent-lazy-red-black-tree.hpp

@@ -3,6 +3,7 @@
 #include <cstddef>
 
 #include "lazy-red-black-tree.hpp"
+
 template <typename Monoid, typename OperatorMonoid, typename F, typename G,
           typename H, std::size_t FULL = 1000>
 struct PersistentLazyRedBlackTree

structure/bbst/persistent-lazy-weight-balanced-tree.hpp

@@ -3,6 +3,7 @@
 #include <cstddef>
 
 #include "lazy-weight-balanced-tree.hpp"
+
 /**
  * @brief Persistent-Lazy-Weight-Balanced-Tree(永続遅延伝搬重み平衡木)
  */

structure/bbst/persistent-red-black-tree.hpp

@@ -3,6 +3,7 @@
 #include <cstddef>
 
 #include "red-black-tree.hpp"
+
 template <typename Monoid, typename F, std::size_t FULL = 1000>
 struct PersistentRedBlackTree : RedBlackTree<Monoid, F> {
   using RBT = RedBlackTree<Monoid, F>;

structure/bbst/persistent-weight-balanced-tree.hpp

@@ -3,6 +3,7 @@
 #include <cstddef>
 
 #include "weight-balanced-tree.hpp"
+
 /**
  * @brief Persistent-Weight-Balanced-Tree(永続重み平衡木)
  */

structure/bbst/randomized-binary-search-tree-lazy.hpp

@@ -6,6 +6,7 @@
 #include <string>
 #include <utility>
 #include <vector>
+
 template <class Monoid, class OperatorMonoid = Monoid>
 struct RandomizedBinarySearchTree {
   using F = std::function<Monoid(Monoid, Monoid)>;

structure/bbst/randomized-binary-search-tree-set.hpp

@@ -3,6 +3,7 @@
 #include <algorithm>
 
 #include "randomized-binary-search-tree.hpp"
+
 template <class T>
 struct OrderedMultiSet : RandomizedBinarySearchTree<T> {
   using RBST = RandomizedBinarySearchTree<T>;

structure/bbst/randomized-binary-search-tree.hpp

@@ -7,6 +7,7 @@
 #include <tuple>
 #include <utility>
 #include <vector>
+
 template <typename T>
 class RandomizedBinarySearchTree {
   using F = std::function<T(T, T)>;

structure/bbst/red-black-tree.hpp

@@ -8,6 +8,7 @@
 #include <vector>
 
 #include "../../other/vector-pool.hpp"
+
 /**
  * @brief Red-Black-Tree(赤黒木)
  *

structure/bbst/reversible-splay-tree.hpp

@@ -5,6 +5,7 @@
 #include <tuple>
 #include <utility>
 #include <vector>
+
 /**
  * @brief Reversible-Splay-Tree(反転可能Splay木)
  */

structure/bbst/weight-balanced-tree.hpp

@@ -8,6 +8,7 @@
 #include <vector>
 
 #include "../../other/vector-pool.hpp"
+
 /**
  * @brief Weight-Balanced-Tree(重み平衡木)
  */

structure/convex-hull-trick/convex-hull-trick-add-monotone.hpp

@@ -4,6 +4,7 @@
 #include <cstdlib>
 #include <deque>
 #include <utility>
+
 template <typename T, bool isMin>
 struct ConvexHullTrickAddMonotone {
 #define F first

structure/convex-hull-trick/dynamic-li-chao-tree.hpp

@@ -2,6 +2,7 @@
 
 #include <algorithm>
 #include <utility>
+
 /**
  * @brief Dynamic-Li-Chao-Tree
  *

structure/convex-hull-trick/li-chao-tree.hpp

@@ -4,6 +4,7 @@
 #include <iterator>
 #include <utility>
 #include <vector>
+
 template <typename T>
 struct LiChaoTree {
   struct Line {

structure/convex-hull-trick/persistent-dynamic-li-chao-tree.hpp

@@ -2,6 +2,7 @@
 
 #include <algorithm>
 #include <utility>
+
 template <typename T, T x_low, T x_high, T id>
 struct PersistentDynamicLiChaoTree {
   struct Line {

structure/dynamic-tree/dynamic-tree-builder-for-edge.hpp

@@ -3,6 +3,7 @@
 #include <cassert>
 #include <utility>
 #include <vector>
+
 template <template <typename> typename DynamicTree, typename TreeDPInfo>
 struct DynamicTreeBuilderForEdge : DynamicTree<TreeDPInfo> {
  private:

structure/dynamic-tree/dynamic-tree-builder-for-vertex.hpp

@@ -3,6 +3,7 @@
 #include <cassert>
 #include <utility>
 #include <vector>
+
 template <template <typename> typename DynamicTree, typename TreeDPInfo>
 struct DynamicTreeBuilderForVertex : DynamicTree<TreeDPInfo> {
  private:

structure/dynamic-tree/lazy-link-cut-tree.hpp

@@ -3,6 +3,7 @@
 #include <stdexcept>
 #include <utility>
 #include <vector>
+
 template <typename TreeDPInfo>
 struct LazyLinkCutTree {
   using Lazy = typename TreeDPInfo::Lazy;

structure/dynamic-tree/lazy-top-tree.hpp

@@ -3,6 +3,7 @@
 #include <stdexcept>
 #include <utility>
 #include <vector>
+
 template <typename TreeDPInfo>
 struct LazySplayTreeForDashedEdge {
   using Lazy = typename TreeDPInfo::Lazy;

structure/dynamic-tree/link-cut-tree-for-subtree.hpp

@@ -3,6 +3,7 @@
 #include <stdexcept>
 #include <utility>
 #include <vector>
+
 template <typename TreeDPInfo>
 struct LinkCutTreeForSubtree {
   using Point = typename TreeDPInfo::Point;

structure/dynamic-tree/link-cut-tree.hpp

@@ -3,6 +3,7 @@
 #include <stdexcept>
 #include <utility>
 #include <vector>
+
 template <typename TreeDPInfo>
 struct LinkCutTree {
   using Path = typename TreeDPInfo::Path;

structure/dynamic-tree/top-tree.hpp

@@ -3,6 +3,7 @@
 #include <stdexcept>
 #include <utility>
 #include <vector>
+
 template <typename TreeDPInfo>
 struct SplayTreeForDashedEdge {
   using Point = typename TreeDPInfo::Point;

structure/heap/fibonacchi-heap.hpp

@@ -4,6 +4,7 @@
 #include <cstddef>
 #include <utility>
 #include <vector>
+
 /**
  * @brief Fibonacchi-Heap(フィボナッチヒープ)
  * @see https://www.cs.princeton.edu/~wayne/teaching/fibonacci-heap.pdf

structure/others/generalized-slope-trick.hpp

@@ -6,6 +6,7 @@
 #include <limits>
 #include <tuple>
 #include <utility>
+
 /**
  * @brief Generalized-Slope-Trick
  *

structure/segment-tree/range-linear-add-range-min-segment-tree.hpp

@@ -4,6 +4,7 @@
 #include <cstddef>
 #include <utility>
 #include <vector>
+
 template <typename T, typename T2, typename T3>
 struct RangeLinearAddRangeMinSegmentTree {
  private: