Merge 1efc5e4 into 603d34f

OmeletWithoutEgg · Oct 1, 2023 · 6007ad6 · 6007ad6
2 parents 603d34f + 1efc5e4
commit 6007ad6
Show file tree

Hide file tree

Showing 65 changed files with 193 additions and 185 deletions.
diff --git a/codes/Basic/allocator.cpp → codes/Basic/oldfiles/allocator.cpp b/codes/Basic/allocator.cpp → codes/Basic/oldfiles/allocator.cpp
diff --git a/codes/Basic/debug_checker.py → codes/Basic/oldfiles/debug_checker.py b/codes/Basic/debug_checker.py → codes/Basic/oldfiles/debug_checker.py
diff --git a/codes/Basic/default.cpp → codes/Basic/oldfiles/default.cpp b/codes/Basic/default.cpp → codes/Basic/oldfiles/default.cpp
diff --git a/codes/Basic/random_generator.cpp → codes/Basic/oldfiles/random_generator.cpp b/codes/Basic/random_generator.cpp → codes/Basic/oldfiles/random_generator.cpp
diff --git a/...ta_Structure/binary_search_on_segtree.cpp → ...s/DataStructure/BinarySearchOnSegtree.cpp b/...ta_Structure/binary_search_on_segtree.cpp → ...s/DataStructure/BinarySearchOnSegtree.cpp
diff --git a/codes/Data_Structure/LCT.cpp → codes/DataStructure/LCT.cpp b/codes/Data_Structure/LCT.cpp → codes/DataStructure/LCT.cpp
diff --git a/codes/Data_Structure/LiChao.cpp → codes/DataStructure/LiChao.cpp b/codes/Data_Structure/LiChao.cpp → codes/DataStructure/LiChao.cpp
diff --git a/codes/Data_Structure/LinearBasis.cpp → codes/DataStructure/LinearBasis.cpp b/codes/Data_Structure/LinearBasis.cpp → codes/DataStructure/LinearBasis.cpp
diff --git a/codes/Data_Structure/Treap.cpp → codes/DataStructure/Treap.cpp b/codes/Data_Structure/Treap.cpp → codes/DataStructure/Treap.cpp
diff --git a/codes/Data_Structure/BigInt.cpp → codes/DataStructure/oldfiles/BigInt.cpp b/codes/Data_Structure/BigInt.cpp → codes/DataStructure/oldfiles/BigInt.cpp
diff --git a/codes/Data_Structure/DisjointSet.cpp → codes/DataStructure/oldfiles/DisjointSet.cpp b/codes/Data_Structure/DisjointSet.cpp → codes/DataStructure/oldfiles/DisjointSet.cpp
diff --git a/codes/Data_Structure/FenwickTree.cpp → codes/DataStructure/oldfiles/FenwickTree.cpp b/codes/Data_Structure/FenwickTree.cpp → codes/DataStructure/oldfiles/FenwickTree.cpp
diff --git a/codes/Data_Structure/MinMaxHeap.cpp → codes/DataStructure/oldfiles/MinMaxHeap.cpp b/codes/Data_Structure/MinMaxHeap.cpp → codes/DataStructure/oldfiles/MinMaxHeap.cpp
diff --git a/codes/Data_Structure/PairingHeap.cpp → codes/DataStructure/oldfiles/PairingHeap.cpp b/codes/Data_Structure/PairingHeap.cpp → codes/DataStructure/oldfiles/PairingHeap.cpp
diff --git a/codes/Data_Structure/SciFi.cpp → codes/DataStructure/oldfiles/SciFi.cpp b/codes/Data_Structure/SciFi.cpp → codes/DataStructure/oldfiles/SciFi.cpp
diff --git a/codes/Data_Structure/SkewHeap.cpp → codes/DataStructure/oldfiles/SkewHeap.cpp b/codes/Data_Structure/SkewHeap.cpp → codes/DataStructure/oldfiles/SkewHeap.cpp
diff --git a/codes/Data_Structure/SparseTable.cpp → codes/DataStructure/oldfiles/SparseTable.cpp b/codes/Data_Structure/SparseTable.cpp → codes/DataStructure/oldfiles/SparseTable.cpp
diff --git a/codes/Data_Structure/matrix.cpp → codes/DataStructure/oldfiles/matrix.cpp b/codes/Data_Structure/matrix.cpp → codes/DataStructure/oldfiles/matrix.cpp
diff --git a/codes/Data_Structure/ext_pbds.cpp → codes/DataStructure/pbds.cpp b/codes/Data_Structure/ext_pbds.cpp → codes/DataStructure/pbds.cpp
diff --git a/codes/Matching_and_Flow/Bi_Pair.cpp → codes/FlowAndMatching/BipartiteMatch.cpp b/codes/Matching_and_Flow/Bi_Pair.cpp → codes/FlowAndMatching/BipartiteMatch.cpp
diff --git a/codes/Matching_and_Flow/CapacityScaling.cpp → codes/FlowAndMatching/CapacityScaling.cpp b/codes/Matching_and_Flow/CapacityScaling.cpp → codes/FlowAndMatching/CapacityScaling.cpp
diff --git a/codes/Matching_and_Flow/CostFlow.cpp → codes/FlowAndMatching/CostFlow.cpp b/codes/Matching_and_Flow/CostFlow.cpp → codes/FlowAndMatching/CostFlow.cpp
diff --git a/codes/Matching_and_Flow/DijkstraCostFlow.cpp → codes/FlowAndMatching/DijkstraCostFlow.cpp b/codes/Matching_and_Flow/DijkstraCostFlow.cpp → codes/FlowAndMatching/DijkstraCostFlow.cpp
diff --git a/codes/Matching_and_Flow/Dinic.cpp → codes/FlowAndMatching/Dinic.cpp b/codes/Matching_and_Flow/Dinic.cpp → codes/FlowAndMatching/Dinic.cpp
diff --git a/codes/Matching_and_Flow/FlowModels.tex → codes/FlowAndMatching/FlowModels.tex b/codes/Matching_and_Flow/FlowModels.tex → codes/FlowAndMatching/FlowModels.tex
diff --git a/codes/Matching_and_Flow/GenVertexCover.cpp → codes/FlowAndMatching/GenVertexCover.cpp b/codes/Matching_and_Flow/GenVertexCover.cpp → codes/FlowAndMatching/GenVertexCover.cpp
diff --git a/codes/Matching_and_Flow/GeneralMatching.cpp → codes/FlowAndMatching/GeneralMatching.cpp b/codes/Matching_and_Flow/GeneralMatching.cpp → codes/FlowAndMatching/GeneralMatching.cpp
diff --git a/codes/Matching_and_Flow/GomoryHu.cpp → codes/FlowAndMatching/GomoryHu.cpp b/codes/Matching_and_Flow/GomoryHu.cpp → codes/FlowAndMatching/GomoryHu.cpp
diff --git a/codes/Matching_and_Flow/Bi_Pair_Fast.cpp → codes/FlowAndMatching/HopcroftKarp.cpp b/codes/Matching_and_Flow/Bi_Pair_Fast.cpp → codes/FlowAndMatching/HopcroftKarp.cpp
diff --git a/codes/Matching_and_Flow/KM.cpp → codes/FlowAndMatching/KM.cpp b/codes/Matching_and_Flow/KM.cpp → codes/FlowAndMatching/KM.cpp
diff --git a/.../Matching_and_Flow/MinCostCirculation.cpp → codes/FlowAndMatching/MinCostCirculation.cpp b/.../Matching_and_Flow/MinCostCirculation.cpp → codes/FlowAndMatching/MinCostCirculation.cpp
diff --git a/codes/Matching_and_Flow/SW.cpp → codes/FlowAndMatching/SW.cpp b/codes/Matching_and_Flow/SW.cpp → codes/FlowAndMatching/SW.cpp
diff --git a/...hing_and_Flow/WeightedGeneralMatching.cpp → ...owAndMatching/WeightedGeneralMatching.cpp b/...hing_and_Flow/WeightedGeneralMatching.cpp → ...owAndMatching/WeightedGeneralMatching.cpp
diff --git a/codes/Geometry/3d/ConvexHull.cpp b/codes/Geometry/3d/ConvexHull.cpp
@@ -6,11 +6,16 @@ struct P3 { lld x,y,z;
 struct Face { int a, b, c;
   Face(int ta,int tb,int tc):a(ta),b(tb),c(tc){} };
 P3 ver(P3 a, P3 b, P3 c) { return (b - a) * (c - a); }
-// plz ensure that first 4 points are not coplanar
 // all points coplanar case will WA
-vector<Face> convex_hull_3D(const vector<P3> &pt) {
+vector<Face> convex_hull_3D(vector<P3> pt) {
   int n = int(pt.size()); vector<Face> now;
   if (n <= 2) return {}; // be careful about edge case
+  // ensure first 4 points are not coplanar
+#define S(I, E...) swap(pt[I], *find_if(all(pt), \
+      [&](auto z) { return E; }))
+  S(1, pt[0] != z);
+  S(2, ver(z, pt[0], pt[1]) != (P3){0, 0, 0});
+  S(3, (z - pt[0]).dot(ver(pt[0], pt[1], pt[2])) != 0);
   vector<vector<int>> flag(n, vector<int>(n));
   now.emplace_back(0,1,2); now.emplace_back(2,1,0);
   for (int i = 3; i < n; i++) {
@@ -22,16 +27,16 @@ vector<Face> convex_hull_3D(const vector<P3> &pt) {
       int ff = (d > 0) - (d < 0);
       flag[f.a][f.b]=flag[f.b][f.c]=flag[f.c][f.a]=ff;
     }
-    for (const auto &f : now) {
-      const auto F = [&](int x, int y) {
-        if (flag[x][y] > 0 && flag[y][x] <= 0)
-          next.emplace_back(x, y, i);
-      };
-      F(f.a, f.b); F(f.b, f.c); F(f.c, f.a);
-    }
+    const auto F = [&](int x, int y) {
+      if (flag[x][y] > 0 && flag[y][x] <= 0)
+        next.emplace_back(x, y, i);
+    };
+    for (const auto &f : now)
+      F(f.a, f.b), F(f.b, f.c), F(f.c, f.a);
     now = next;
   }
   return now;
 }
-// delaunay: facets with negative z normal of
-// convexhull of (x, y, x^2 + y^2)
+// n^2 delaunay: facets with negative z normal of
+// convexhull of (x, y, x^2 + y^2), use a pseudo-point
+// (0, 0, inf) to avoid degenerate case
diff --git a/codes/Graph/virtual_tree.cpp → codes/Graph/VirtualTree.cpp b/codes/Graph/virtual_tree.cpp → codes/Graph/VirtualTree.cpp
diff --git a/codes/Graph/BCC_Edge.cpp → codes/Graph/oldfiles/BCC_Edge.cpp b/codes/Graph/BCC_Edge.cpp → codes/Graph/oldfiles/BCC_Edge.cpp
diff --git a/codes/Graph/BCC_Vertex.cpp → codes/Graph/oldfiles/BCC_Vertex.cpp b/codes/Graph/BCC_Vertex.cpp → codes/Graph/oldfiles/BCC_Vertex.cpp
diff --git a/codes/Graph/DiffConstraints.tex → codes/Graph/oldfiles/DiffConstraints.tex b/codes/Graph/DiffConstraints.tex → codes/Graph/oldfiles/DiffConstraints.tex
diff --git a/codes/Graph/EulerCircuit.cpp → codes/Graph/oldfiles/EulerCircuit.cpp b/codes/Graph/EulerCircuit.cpp → codes/Graph/oldfiles/EulerCircuit.cpp
diff --git a/codes/Graph/Kosaraju.cpp → codes/Graph/oldfiles/Kosaraju.cpp b/codes/Graph/Kosaraju.cpp → codes/Graph/oldfiles/Kosaraju.cpp
diff --git a/codes/Graph/MinSteinerTree.cpp → codes/Graph/oldfiles/MinSteinerTree.cpp b/codes/Graph/MinSteinerTree.cpp → codes/Graph/oldfiles/MinSteinerTree.cpp
diff --git a/codes/Graph/MoTree.cpp → codes/Graph/oldfiles/MoTree.cpp b/codes/Graph/MoTree.cpp → codes/Graph/oldfiles/MoTree.cpp
diff --git a/codes/Math/ChineseRemainder.tex → codes/Math/oldfiles/ChineseRemainder.tex b/codes/Math/ChineseRemainder.tex → codes/Math/oldfiles/ChineseRemainder.tex
diff --git a/codes/Math/GaussElimination.cpp → codes/Math/oldfiles/GaussElimination.cpp b/codes/Math/GaussElimination.cpp → codes/Math/oldfiles/GaussElimination.cpp
diff --git a/codes/Math/euler_phi.cpp → codes/Math/oldfiles/euler_phi.cpp b/codes/Math/euler_phi.cpp → codes/Math/oldfiles/euler_phi.cpp
diff --git a/codes/Math/primes.tex → codes/Math/oldfiles/primes.tex b/codes/Math/primes.tex → codes/Math/oldfiles/primes.tex
diff --git a/codes/Math/debruijn.cpp → codes/Misc/DeBruijn.cpp b/codes/Math/debruijn.cpp → codes/Misc/DeBruijn.cpp
diff --git a/codes/Graph/ManhattanMST.cpp → codes/Misc/ManhattanMST.cpp b/codes/Graph/ManhattanMST.cpp → codes/Misc/ManhattanMST.cpp
@@ -1,20 +1,15 @@
-typedef Point<int> P;
 vector<array<int, 3>> manhattanMST(vector<P> ps) {
-  vi id(sz(ps));
-  iota(all(id), 0);
+  vector<int> id(ps.size()); iota(all(id), 0);
   vector<array<int, 3>> edges;
-  rep(k, 0, 4) {
+  for (int k = 0; k < 4; k++) {
     sort(all(id), [&](int i, int j) {
-      return (ps[i] - ps[j]).x < (ps[j] - ps[i]).y;
-    });
+      return (ps[i] - ps[j]).x < (ps[j] - ps[i]).y; });
     map<int, int> sweep;
     for (int i : id) {
       for (auto it = sweep.lower_bound(-ps[i].y);
            it != sweep.end(); sweep.erase(it++)) {
-        int j = it->second;
-        P d = ps[i] - ps[j];
-        if (d.y > d.x) break;
-        edges.push_back({d.y + d.x, i, j});
+        if (P d = ps[i] - ps[it->second]; d.y > d.x) break;
+        else edges.push_back({d.y + d.x, i, it->second});
       }
       sweep[-ps[i].y] = i;
     }
@@ -23,4 +18,4 @@ vector<array<int, 3>> manhattanMST(vector<P> ps) {
       else swap(p.x, p.y);
   }
   return edges; // [{w, i, j}, ...]
-}
+} // test @ yosupo judge
diff --git a/codes/Misc/tree_knapsack.cpp → codes/Misc/TreeKnapsack.cpp b/codes/Misc/tree_knapsack.cpp → codes/Misc/TreeKnapsack.cpp
diff --git a/codes/Misc/Aliens.cpp → codes/Misc/oldfiles/Aliens.cpp b/codes/Misc/Aliens.cpp → codes/Misc/oldfiles/Aliens.cpp
diff --git a/codes/Misc/CactusMatching.cpp → codes/Misc/oldfiles/CactusMatching.cpp b/codes/Misc/CactusMatching.cpp → codes/Misc/oldfiles/CactusMatching.cpp
diff --git a/codes/Misc/DLX.cpp → codes/Misc/oldfiles/DLX.cpp b/codes/Misc/DLX.cpp → codes/Misc/oldfiles/DLX.cpp
diff --git a/codes/Misc/DPcondition.tex → codes/Misc/oldfiles/DPcondition.tex b/codes/Misc/DPcondition.tex → codes/Misc/oldfiles/DPcondition.tex
diff --git a/codes/Misc/EmptyRect.cpp → codes/Misc/oldfiles/EmptyRect.cpp b/codes/Misc/EmptyRect.cpp → codes/Misc/oldfiles/EmptyRect.cpp
diff --git a/codes/Misc/Hilbert.cpp → codes/Misc/oldfiles/Hilbert.cpp b/codes/Misc/Hilbert.cpp → codes/Misc/oldfiles/Hilbert.cpp
diff --git a/codes/String/palindromic_tree.cpp → codes/String/PalindromicTree.cpp b/codes/String/palindromic_tree.cpp → codes/String/PalindromicTree.cpp
diff --git a/codes/String/Suffix_Array.cpp → codes/String/SAIS.cpp b/codes/String/Suffix_Array.cpp → codes/String/SAIS.cpp
diff --git a/codes/String/smallest_rotation.cpp → codes/String/SmallestRotation.cpp b/codes/String/smallest_rotation.cpp → codes/String/SmallestRotation.cpp
diff --git a/codes/String/Z_Value.cpp → codes/String/ZValue.cpp b/codes/String/Z_Value.cpp → codes/String/ZValue.cpp
diff --git a/codes/String/Aho_Corasick.cpp → codes/String/oldfiles/Aho_Corasick.cpp b/codes/String/Aho_Corasick.cpp → codes/String/oldfiles/Aho_Corasick.cpp
diff --git a/codes/String/SAM.cpp → codes/String/oldfiles/SAM.cpp b/codes/String/SAM.cpp → codes/String/oldfiles/SAM.cpp
diff --git a/docs/Data_Structure.md → docs/DataStructure.md b/docs/Data_Structure.md → docs/DataStructure.md
diff --git a/docs/Data_Structure/LinearBasis.cpp.md → docs/DataStructure/LinearBasis.cpp.md b/docs/Data_Structure/LinearBasis.cpp.md → docs/DataStructure/LinearBasis.cpp.md
diff --git a/...Matching_and_Flow/DijkstraCostFlow.cpp.md → docs/FlowAndMatching/DijkstraCostFlow.cpp.md b/...Matching_and_Flow/DijkstraCostFlow.cpp.md → docs/FlowAndMatching/DijkstraCostFlow.cpp.md