Remove avx2 target, use -march=native

adamant-pwn · adamant-pwn · commit 6ae8a20b16e2 · 2024-05-29T19:22:41.000+02:00
diff --git a/.verify-helper/config.toml b/.verify-helper/config.toml
@@ -1,3 +1,3 @@
 [[languages.cpp.environments]]
 CXX = "g++"
-CXXFLAGS = ["-std=c++20", "-Wall", "-Wextra", "-O2", "-mavx2"]
+CXXFLAGS = ["-std=c++20", "-Wall", "-Wextra", "-O2", "-march=native"]
diff --git a/verify/combi/binom.test.cpp b/verify/combi/binom.test.cpp
@@ -1,7 +1,7 @@
 // @brief Binomial Coefficient (Prime Mod)
 #define PROBLEM "https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #define CP_ALGO_MAXN 1e7
 #include "cp-algo/math/modint.hpp"
 #include "cp-algo/math/combinatorics.hpp"
diff --git a/verify/data_structures/bitpack/det_mod_2.test.cpp b/verify/data_structures/bitpack/det_mod_2.test.cpp
@@ -2,7 +2,7 @@
 // @brief Determinant of Matrix (Mod 2)
 #define PROBLEM "https://judge.yosupo.jp/problem/matrix_det_mod_2"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/data_structures/bitpack.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/data_structures/bitpack/prod_mod_2.test.cpp b/verify/data_structures/bitpack/prod_mod_2.test.cpp
@@ -2,7 +2,7 @@
 // @brief Matrix Product (Mod 2)
 #define PROBLEM "https://judge.yosupo.jp/problem/matrix_product_mod_2"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/data_structures/bitpack.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/geometry/arg.test.cpp b/verify/geometry/arg.test.cpp
@@ -1,7 +1,7 @@
 // @brief Sort Points by Argument
 #define PROBLEM "https://judge.yosupo.jp/problem/sort_points_by_argument"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/geometry/point.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/geometry/hull.test.cpp b/verify/geometry/hull.test.cpp
@@ -1,7 +1,7 @@
 // @brief Static Convex Hull
 #define PROBLEM "https://judge.yosupo.jp/problem/static_convex_hull"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/geometry/point.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/linalg/characteristic.test.cpp b/verify/linalg/characteristic.test.cpp
@@ -1,7 +1,7 @@
 // @brief Characteristic Polynomial
 #define PROBLEM "https://judge.yosupo.jp/problem/characteristic_polynomial"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #define CP_ALGO_MAXN 1 << 12
 #include "cp-algo/linalg/frobenius.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/linalg/det.test.cpp b/verify/linalg/det.test.cpp
@@ -1,7 +1,7 @@
 // @brief Matrix Determinant
 #define PROBLEM "https://judge.yosupo.jp/problem/matrix_det"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/linalg/inv.test.cpp b/verify/linalg/inv.test.cpp
@@ -1,7 +1,7 @@
 // @brief Inverse Matrix
 #define PROBLEM "https://judge.yosupo.jp/problem/inverse_matrix"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/linalg/pow.test.cpp b/verify/linalg/pow.test.cpp
@@ -1,7 +1,7 @@
 // @brief Pow of Matrix
 #define PROBLEM "https://judge.yosupo.jp/problem/pow_of_matrix"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/linalg/pow_fast.test.cpp b/verify/linalg/pow_fast.test.cpp
@@ -1,7 +1,7 @@
 // @brief Pow of Matrix (Frobenius)
 #define PROBLEM "https://judge.yosupo.jp/problem/pow_of_matrix"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #define CP_ALGO_MAXN 1 << 12
 #include "cp-algo/linalg/frobenius.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/linalg/prod.test.cpp b/verify/linalg/prod.test.cpp
@@ -1,7 +1,7 @@
 // @brief Matrix Product
 #define PROBLEM "https://judge.yosupo.jp/problem/matrix_product"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/linalg/prod_dynamic_modint.test.cpp b/verify/linalg/prod_dynamic_modint.test.cpp
@@ -1,7 +1,7 @@
 // @brief Matrix Product (dynamic modint)
 #define PROBLEM "https://judge.yosupo.jp/problem/matrix_product"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/linalg/rank.test.cpp b/verify/linalg/rank.test.cpp
@@ -1,7 +1,7 @@
 // @brief Rank of Matrix
 #define PROBLEM "https://judge.yosupo.jp/problem/matrix_rank"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/linalg/system.test.cpp b/verify/linalg/system.test.cpp
@@ -1,7 +1,7 @@
 // @brief System of Linear Equations
 #define PROBLEM "https://judge.yosupo.jp/problem/system_of_linear_equations"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/number_theory/discrete_log.test.cpp b/verify/number_theory/discrete_log.test.cpp
@@ -1,7 +1,7 @@
 // @brief Discrete Logarithm
 #define PROBLEM "https://judge.yosupo.jp/problem/discrete_logarithm_mod"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/math/number_theory.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/number_theory/factorize.test.cpp b/verify/number_theory/factorize.test.cpp
@@ -1,7 +1,7 @@
 // @brief Factorize
 #define PROBLEM "https://judge.yosupo.jp/problem/factorize"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/math/number_theory.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/number_theory/modsqrt.test.cpp b/verify/number_theory/modsqrt.test.cpp
@@ -1,7 +1,7 @@
 // @brief Sqrt Mod
 #define PROBLEM "https://judge.yosupo.jp/problem/sqrt_mod"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/math/number_theory.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/number_theory/primality.test.cpp b/verify/number_theory/primality.test.cpp
@@ -1,7 +1,7 @@
 // @brief Primality Test
 #define PROBLEM "https://judge.yosupo.jp/problem/primality_test"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/math/number_theory.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/number_theory/primitive_root.test.cpp b/verify/number_theory/primitive_root.test.cpp
@@ -1,7 +1,7 @@
 // @brief Primitive Root
 #define PROBLEM "https://judge.yosupo.jp/problem/primitive_root"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/math/number_theory.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/poly/convolution107.test.cpp b/verify/poly/convolution107.test.cpp
@@ -1,5 +1,7 @@
 // @brief Convolution mod $10^9+7$
 #define PROBLEM "https://judge.yosupo.jp/problem/convolution_mod_1000000007"
+#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC target("tune=native")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/poly/taylor.test.cpp b/verify/poly/taylor.test.cpp
@@ -1,7 +1,7 @@
 // @brief Polynomial Taylor Shift
 #define PROBLEM "https://judge.yosupo.jp/problem/polynomial_taylor_shift"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/poly/wildcard.test.cpp b/verify/poly/wildcard.test.cpp
@@ -1,7 +1,7 @@
 // @brief Wildcard Pattern Matching
 #define PROBLEM "https://judge.yosupo.jp/problem/wildcard_pattern_matching"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("avx2,tune=native")
+#pragma GCC target("tune=native")
 #define CP_ALGO_MAXN 1 << 19
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
