From 2a9b06c6a78c67ad744a51b76c8a8bf2e4b76d80 Mon Sep 17 00:00:00 2001
From: YT Zi <zi.ya@northeastern.edu>
Date: Mon, 19 May 2025 10:03:40 -0400
Subject: [PATCH] Fixed benchmark problems 10, 11, 48

---
 .../benchmarks/geometry/10_geometry_convex_hull/baseline.hpp  | 4 +++-
 .../geometry/11_geometry_convex_hull_perimeter/baseline.hpp   | 4 +++-
 .../cpp/benchmarks/sparse_la/48_sparse_la_sparse_axpy/cpu.cc  | 1 -
 3 files changed, 6 insertions(+), 3 deletions(-)

diff --git a/drivers/cpp/benchmarks/geometry/10_geometry_convex_hull/baseline.hpp b/drivers/cpp/benchmarks/geometry/10_geometry_convex_hull/baseline.hpp
index 2a7ac20..09cee35 100644
--- a/drivers/cpp/benchmarks/geometry/10_geometry_convex_hull/baseline.hpp
+++ b/drivers/cpp/benchmarks/geometry/10_geometry_convex_hull/baseline.hpp
@@ -29,6 +29,8 @@ void NO_INLINE correctConvexHull(std::vector<Point> const& points, std::vector<P
     std::vector<Point> lowerHull;
     upperHull.push_back(pointsSorted[0]);
     upperHull.push_back(pointsSorted[1]);
+    lowerHull.push_back(pointsSorted[pointsSorted.size() - 1]);
+    lowerHull.push_back(pointsSorted[pointsSorted.size() - 2]);
 
     for (size_t i = 2; i < pointsSorted.size(); i++) {
         while (upperHull.size() > 1
@@ -47,7 +49,7 @@ void NO_INLINE correctConvexHull(std::vector<Point> const& points, std::vector<P
         }
         lowerHull.push_back(pointsSorted[pointsSorted.size() - i - 1]);
     }
-    upperHull.insert(upperHull.end(), lowerHull.begin(), lowerHull.end());
+    upperHull.insert(upperHull.end(), lowerHull.begin()+1, lowerHull.end()-1);
 
     hull = upperHull;
     return;
diff --git a/drivers/cpp/benchmarks/geometry/11_geometry_convex_hull_perimeter/baseline.hpp b/drivers/cpp/benchmarks/geometry/11_geometry_convex_hull_perimeter/baseline.hpp
index f7fe014..45923b1 100644
--- a/drivers/cpp/benchmarks/geometry/11_geometry_convex_hull_perimeter/baseline.hpp
+++ b/drivers/cpp/benchmarks/geometry/11_geometry_convex_hull_perimeter/baseline.hpp
@@ -34,6 +34,8 @@ double NO_INLINE correctConvexHullPerimeter(std::vector<Point> const& points) {
     std::vector<Point> lowerHull;
     upperHull.push_back(pointsSorted[0]);
     upperHull.push_back(pointsSorted[1]);
+    lowerHull.push_back(pointsSorted[pointsSorted.size() - 1]);
+    lowerHull.push_back(pointsSorted[pointsSorted.size() - 2]);
 
     for (size_t i = 2; i < pointsSorted.size(); i++) {
         while (upperHull.size() > 1
@@ -52,7 +54,7 @@ double NO_INLINE correctConvexHullPerimeter(std::vector<Point> const& points) {
         }
         lowerHull.push_back(pointsSorted[pointsSorted.size() - i - 1]);
     }
-    upperHull.insert(upperHull.end(), lowerHull.begin(), lowerHull.end());
+    upperHull.insert(upperHull.end(), lowerHull.begin()+1, lowerHull.end()-1);
 
     double perimeter = 0;
     for (size_t i = 0; i < upperHull.size() - 1; i++) {
diff --git a/drivers/cpp/benchmarks/sparse_la/48_sparse_la_sparse_axpy/cpu.cc b/drivers/cpp/benchmarks/sparse_la/48_sparse_la_sparse_axpy/cpu.cc
index 45cb6a7..57718c0 100644
--- a/drivers/cpp/benchmarks/sparse_la/48_sparse_la_sparse_axpy/cpu.cc
+++ b/drivers/cpp/benchmarks/sparse_la/48_sparse_la_sparse_axpy/cpu.cc
@@ -122,7 +122,6 @@ bool validate(Context *ctx) {
         correctSparseAxpy(alpha, x, y, correct);
 
         // compute test result
-        test.clear();
         sparseAxpy(alpha, x, y, test);
         SYNC();