fix

adamant-pwn · adamant-pwn · commit 4a98daec9a34 · 2025-05-22T14:15:11.000+02:00
diff --git a/.github/workflows/verify.yml b/.github/workflows/verify.yml
@@ -34,6 +34,11 @@ jobs:
           cache-pip: true
 
       # Initialize your own environment for resolving.
+      - name: Use GCC 14.2
+        run: |
+          sudo update-alternatives --install /usr/bin/g++ g++ /usr/bin/g++-14 100
+          sudo update-alternatives --install /usr/bin/gcc gcc /usr/bin/gcc-14 100
+          g++ --version
       - name: oj-resolve
         uses: competitive-verifier/actions/oj-resolve@v2
         with:
diff --git a/cp-algo/math/common.hpp b/cp-algo/math/common.hpp
@@ -2,6 +2,7 @@
 #define CP_ALGO_MATH_COMMON_HPP
 #include <functional>
 #include <cstdint>
+#include <cassert>
 namespace cp_algo::math {
 #ifdef CP_ALGO_MAXN
     const int maxn = CP_ALGO_MAXN;
diff --git a/verify/combi/binom.test.cpp b/verify/combi/binom.test.cpp
@@ -1,5 +1,5 @@
 // @brief Binomial Coefficient (Prime Mod)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod
+#define PROBLEM "https://judge.yosupo.jp/problem/binomial_coefficient_prime_mod"
 #pragma GCC optimize("Ofast,unroll-loops")
 #define CP_ALGO_MAXN 1e7
 #include "cp-algo/number_theory/modint.hpp"
diff --git a/verify/geometry/arg.test.cpp b/verify/geometry/arg.test.cpp
@@ -1,5 +1,5 @@
 // @brief Sort Points by Argument
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sort_points_by_argument
+#define PROBLEM "https://judge.yosupo.jp/problem/sort_points_by_argument"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/geometry/point.hpp"
diff --git a/verify/geometry/closest_pair.test.cpp b/verify/geometry/closest_pair.test.cpp
@@ -1,5 +1,5 @@
 // @brief Closest Pair of Points
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/closest_pair
+#define PROBLEM "https://judge.yosupo.jp/problem/closest_pair"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/geometry/closest_pair.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/geometry/hull.test.cpp b/verify/geometry/hull.test.cpp
@@ -1,5 +1,5 @@
 // @brief Static Convex Hull
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/static_convex_hull
+#define PROBLEM "https://judge.yosupo.jp/problem/static_convex_hull"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/geometry/convex_hull.hpp"
diff --git a/verify/graph/cycle_directed.test.cpp b/verify/graph/cycle_directed.test.cpp
@@ -1,9 +1,9 @@
 // @brief Cycle Detection (Directed)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/cycle_detection
+#define PROBLEM "https://judge.yosupo.jp/problem/cycle_detection"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("tune=native")
-#include "cp-algo/graph/cycle.hpp"
 #include <bits/stdc++.h>
+#include "blazingio/blazingio.min.hpp"
+#include "cp-algo/graph/cycle.hpp"
 
 using namespace std;
 using namespace cp_algo::graph;
diff --git a/verify/graph/cycle_undirected.test.cpp b/verify/graph/cycle_undirected.test.cpp
@@ -1,5 +1,5 @@
 // @brief Cycle Detection (Undirected)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/cycle_detection_undirected
+#define PROBLEM "https://judge.yosupo.jp/problem/cycle_detection_undirected"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/graph/cycle.hpp"
diff --git a/verify/graph/euler_directed.test.cpp b/verify/graph/euler_directed.test.cpp
@@ -1,5 +1,5 @@
 // @brief Eulerian Trail (Directed)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/eulerian_trail_directed
+#define PROBLEM "https://judge.yosupo.jp/problem/eulerian_trail_directed"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/graph/euler.hpp"
diff --git a/verify/graph/euler_undirected.test.cpp b/verify/graph/euler_undirected.test.cpp
@@ -1,5 +1,5 @@
 // @brief Eulerian Trail (Undirected)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/eulerian_trail_undirected
+#define PROBLEM "https://judge.yosupo.jp/problem/eulerian_trail_undirected"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/graph/euler.hpp"
diff --git a/verify/graph/mst.test.cpp b/verify/graph/mst.test.cpp
@@ -1,5 +1,5 @@
 // @brief Minimum Spanning Tree
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/minimum_spanning_tree
+#define PROBLEM "https://judge.yosupo.jp/problem/minimum_spanning_tree"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/graph/mst.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/graph/shortest_path.test.cpp b/verify/graph/shortest_path.test.cpp
@@ -1,5 +1,5 @@
 // @brief Shortest Path
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/shortest_path
+#define PROBLEM "https://judge.yosupo.jp/problem/shortest_path"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/graph/shortest_path.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/linalg/euler_circs.test.cpp b/verify/linalg/euler_circs.test.cpp
@@ -1,10 +1,10 @@
 // @brief Counting Eulerian Circuits
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/counting_eulerian_circuits
+#define PROBLEM "https://judge.yosupo.jp/problem/counting_eulerian_circuits"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("tune=native")
+#include <bits/stdc++.h>
+#include "blazingio/blazingio.min.hpp"
 #include "cp-algo/math/combinatorics.hpp"
 #include "cp-algo/linalg/matrix.hpp"
-#include <bits/stdc++.h>
 
 using namespace std;
 using namespace cp_algo::math;
diff --git a/verify/linalg/pow.test.cpp b/verify/linalg/pow.test.cpp
@@ -1,5 +1,5 @@
 // @brief Pow of Matrix
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/pow_of_matrix
+#define PROBLEM "https://judge.yosupo.jp/problem/pow_of_matrix"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"
diff --git a/verify/linalg/prod_dynamic_modint.test.cpp b/verify/linalg/prod_dynamic_modint.test.cpp
@@ -1,5 +1,5 @@
 // @brief Matrix Product (dynamic modint)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/matrix_product
+#define PROBLEM "https://judge.yosupo.jp/problem/matrix_product"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"
diff --git a/verify/linalg/spanning_directed.test.cpp b/verify/linalg/spanning_directed.test.cpp
@@ -1,9 +1,10 @@
 // @brief Counting Spanning Trees (Directed)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/counting_spanning_tree_directed
+#define PROBLEM "https://judge.yosupo.jp/problem/counting_spanning_tree_directed"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("tune=native")
-#include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>
+#include "blazingio/blazingio.min.hpp"
+#include "cp-algo/math/combinatorics.hpp"
+#include "cp-algo/linalg/matrix.hpp"
 
 using namespace std;
 using namespace cp_algo::math;
diff --git a/verify/linalg/spanning_undirected.test.cpp b/verify/linalg/spanning_undirected.test.cpp
@@ -1,9 +1,10 @@
 // @brief Counting Spanning Trees (Undirected)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/counting_spanning_tree_undirected
+#define PROBLEM "https://judge.yosupo.jp/problem/counting_spanning_tree_undirected"
 #pragma GCC optimize("Ofast,unroll-loops")
-#pragma GCC target("tune=native")
-#include "cp-algo/linalg/matrix.hpp"
 #include <bits/stdc++.h>
+#include "blazingio/blazingio.min.hpp"
+#include "cp-algo/math/combinatorics.hpp"
+#include "cp-algo/linalg/matrix.hpp"
 
 using namespace std;
 using namespace cp_algo::math;
diff --git a/verify/linalg/tutte.test.cpp b/verify/linalg/tutte.test.cpp
@@ -1,5 +1,5 @@
 // @brief Matching on General Graph (Tutte matrix)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/general_matching
+#define PROBLEM "https://judge.yosupo.jp/problem/general_matching"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/linalg/matrix.hpp"
diff --git a/verify/number_theory/discrete_log.test.cpp b/verify/number_theory/discrete_log.test.cpp
@@ -1,5 +1,5 @@
 // @brief Discrete Logarithm
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/discrete_logarithm_mod
+#define PROBLEM "https://judge.yosupo.jp/problem/discrete_logarithm_mod"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/number_theory/discrete_log.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/number_theory/factorize.test.cpp b/verify/number_theory/factorize.test.cpp
@@ -1,5 +1,5 @@
 // @brief Factorize
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/factorize
+#define PROBLEM "https://judge.yosupo.jp/problem/factorize"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/number_theory/factorize.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/number_theory/modsqrt.test.cpp b/verify/number_theory/modsqrt.test.cpp
@@ -1,5 +1,5 @@
 // @brief Sqrt Mod
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sqrt_mod
+#define PROBLEM "https://judge.yosupo.jp/problem/sqrt_mod"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/number_theory/discrete_sqrt.hpp"
diff --git a/verify/number_theory/primality.test.cpp b/verify/number_theory/primality.test.cpp
@@ -1,5 +1,5 @@
 // @brief Primality Test
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/primality_test
+#define PROBLEM "https://judge.yosupo.jp/problem/primality_test"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/number_theory/primality.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/number_theory/primitive_root.test.cpp b/verify/number_theory/primitive_root.test.cpp
@@ -1,5 +1,5 @@
 // @brief Primitive Root
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/primitive_root
+#define PROBLEM "https://judge.yosupo.jp/problem/primitive_root"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/number_theory/euler.hpp"
diff --git a/verify/number_theory/two_squares.test.cpp b/verify/number_theory/two_squares.test.cpp
@@ -1,5 +1,5 @@
 // @brief Represent A Number As Two Square Sum
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/two_square_sum
+#define PROBLEM "https://judge.yosupo.jp/problem/two_square_sum"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/number_theory/two_squares.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/poly/bell.test.cpp b/verify/poly/bell.test.cpp
@@ -1,5 +1,5 @@
 // @brief Bell Number
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/bell_number
+#define PROBLEM "https://judge.yosupo.jp/problem/bell_number"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/poly/convolution107.test.cpp b/verify/poly/convolution107.test.cpp
@@ -1,5 +1,5 @@
 // @brief Convolution mod $10^9+7$
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/convolution_mod_1000000007
+#define PROBLEM "https://judge.yosupo.jp/problem/convolution_mod_large"
 #pragma GCC optimize("Ofast,unroll-loops")
 #define CP_ALGO_CHECKPOINT
 #include <bits/stdc++.h>
diff --git a/verify/poly/div.test.cpp b/verify/poly/div.test.cpp
@@ -1,5 +1,5 @@
 // @brief Division of Polynomials
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/division_of_polynomials
+#define PROBLEM "https://judge.yosupo.jp/problem/division_of_polynomials"
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/poly/exp.test.cpp b/verify/poly/exp.test.cpp
@@ -1,5 +1,5 @@
 // @brief Exp of Power Series
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/exp_of_formal_power_series
+#define PROBLEM "https://judge.yosupo.jp/problem/exp_of_formal_power_series"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/poly/find_linrec.test.cpp b/verify/poly/find_linrec.test.cpp
@@ -1,5 +1,5 @@
 // @brief Find Linear Recurrence
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/find_linear_recurrence
+#define PROBLEM "https://judge.yosupo.jp/problem/find_linear_recurrence"
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/poly/inter_geo.test.cpp b/verify/poly/inter_geo.test.cpp
@@ -1,5 +1,5 @@
 // @brief Polynomial Interpolation (Geometric Sequence)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/polynomial_interpolation_on_geometric_sequence
+#define PROBLEM "https://judge.yosupo.jp/problem/polynomial_interpolation_on_geometric_sequence"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/poly/inv_mod.test.cpp b/verify/poly/inv_mod.test.cpp
@@ -1,5 +1,5 @@
 // @brief Inv of Polynomials
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/inv_of_polynomials
+#define PROBLEM "https://judge.yosupo.jp/problem/inv_of_polynomials"
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
 
diff --git a/verify/poly/linrec_consecutive.test.cpp b/verify/poly/linrec_consecutive.test.cpp
@@ -1,5 +1,5 @@
 // @brief Consecutive Terms of Linear Recursion
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/consecutive_terms_of_linear_recurrent_sequence
+#define PROBLEM "https://judge.yosupo.jp/problem/consecutive_terms_of_linear_recurrent_sequence"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/poly/linrec_single.test.cpp b/verify/poly/linrec_single.test.cpp
@@ -1,5 +1,5 @@
 // @brief Kth term of Linearly Recurrent Sequence
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/kth_term_of_linearly_recurrent_sequence
+#define PROBLEM "https://judge.yosupo.jp/problem/kth_term_of_linearly_recurrent_sequence"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/poly/log.test.cpp b/verify/poly/log.test.cpp
@@ -1,5 +1,5 @@
 // @brief Log of Power Series
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/log_of_formal_power_series
+#define PROBLEM "https://judge.yosupo.jp/problem/log_of_formal_power_series"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/poly/multieval.test.cpp b/verify/poly/multieval.test.cpp
@@ -1,5 +1,5 @@
 // @brief Multipoint Evaluation
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/multipoint_evaluation
+#define PROBLEM "https://judge.yosupo.jp/problem/multipoint_evaluation"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/poly/multieval_geo.test.cpp b/verify/poly/multieval_geo.test.cpp
@@ -1,5 +1,5 @@
 // @brief Multipoint Evaluation (Geometric Sequence)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/multipoint_evaluation_on_geometric_sequence
+#define PROBLEM "https://judge.yosupo.jp/problem/multipoint_evaluation_on_geometric_sequence"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/poly/pow.test.cpp b/verify/poly/pow.test.cpp
@@ -1,5 +1,5 @@
 // @brief Pow of Power Series
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/pow_of_formal_power_series
+#define PROBLEM "https://judge.yosupo.jp/problem/pow_of_formal_power_series"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/poly/sampling.test.cpp b/verify/poly/sampling.test.cpp
@@ -1,5 +1,5 @@
 // @brief Shift of Sampling Points of Polynomial
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/shift_of_sampling_points_of_polynomial
+#define PROBLEM "https://judge.yosupo.jp/problem/shift_of_sampling_points_of_polynomial"
 #define CP_ALGO_MAXN 1 << 20
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/math/poly.hpp"
diff --git a/verify/poly/sqrt.test.cpp b/verify/poly/sqrt.test.cpp
@@ -1,5 +1,5 @@
 // @brief Sqrt of Power Series
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sqrt_of_formal_power_series
+#define PROBLEM "https://judge.yosupo.jp/problem/sqrt_of_formal_power_series"
 #include "cp-algo/math/poly.hpp"
 #include "cp-algo/number_theory/modint.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/poly/taylor.test.cpp b/verify/poly/taylor.test.cpp
@@ -1,5 +1,5 @@
 // @brief Polynomial Taylor Shift
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/polynomial_taylor_shift
+#define PROBLEM "https://judge.yosupo.jp/problem/polynomial_taylor_shift"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/math/poly.hpp"
diff --git a/verify/poly/wildcard.test.cpp b/verify/poly/wildcard.test.cpp
@@ -1,5 +1,5 @@
 // @brief Wildcard Pattern Matching
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/wildcard_pattern_matching
+#define PROBLEM "https://judge.yosupo.jp/problem/wildcard_pattern_matching"
 #pragma GCC optimize("Ofast,unroll-loops")
 #define CP_ALGO_CHECKPOINT
 #include "cp-algo/math/cvector.hpp"
diff --git a/verify/string/eertree.test.cpp b/verify/string/eertree.test.cpp
@@ -1,5 +1,5 @@
 // @brief Eertree
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/eertree
+#define PROBLEM "https://judge.yosupo.jp/problem/eertree"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/structures/eertree.hpp"
diff --git a/verify/structures/bitpack/det_mod_2.test.cpp b/verify/structures/bitpack/det_mod_2.test.cpp
@@ -1,6 +1,6 @@
 
 // @brief Determinant of Matrix (Mod 2)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/matrix_det_mod_2
+#define PROBLEM "https://judge.yosupo.jp/problem/matrix_det_mod_2"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/structures/bitpack.hpp"
diff --git a/verify/structures/bitpack/inv_mod_2.test.cpp b/verify/structures/bitpack/inv_mod_2.test.cpp
@@ -1,5 +1,5 @@
 // @brief Inverse Matrix (Mod 2)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/inverse_matrix_mod_2
+#define PROBLEM "https://judge.yosupo.jp/problem/inverse_matrix_mod_2"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/structures/bitpack.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/structures/bitpack/prod_mod_2.test.cpp b/verify/structures/bitpack/prod_mod_2.test.cpp
@@ -1,6 +1,6 @@
 
 // @brief Matrix Product (Mod 2)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/matrix_product_mod_2
+#define PROBLEM "https://judge.yosupo.jp/problem/matrix_product_mod_2"
 #pragma GCC optimize("Ofast,unroll-loops")
 #pragma GCC target("tune=native")
 #include "cp-algo/structures/bitpack.hpp"
diff --git a/verify/structures/bitpack/system_mod_2.test.cpp b/verify/structures/bitpack/system_mod_2.test.cpp
@@ -1,5 +1,5 @@
 // @brief System of Linear Equations (Mod 2)
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/system_of_linear_equations_mod_2
+#define PROBLEM "https://judge.yosupo.jp/problem/system_of_linear_equations_mod_2"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/structures/bitpack.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/structures/fenwick/lis.test.cpp b/verify/structures/fenwick/lis.test.cpp
@@ -1,5 +1,5 @@
 // @brief Longest Increasing Subsequence
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/longest_increasing_subsequence
+#define PROBLEM "https://judge.yosupo.jp/problem/longest_increasing_subsequence"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/structures/fenwick.hpp"
 #include "cp-algo/util/compress_coords.hpp"
diff --git a/verify/structures/fenwick/ordered_set.test.cpp b/verify/structures/fenwick/ordered_set.test.cpp
@@ -1,5 +1,5 @@
 // @brief Ordered Set
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/ordered_set
+#define PROBLEM "https://judge.yosupo.jp/problem/ordered_set"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/structures/fenwick_set.hpp"
 #include "cp-algo/util/compress_coords.hpp"
diff --git a/verify/structures/fenwick/point_add_range_sum.test.cpp b/verify/structures/fenwick/point_add_range_sum.test.cpp
@@ -1,5 +1,5 @@
 // @brief Point Add Range Sum
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/point_add_range_sum
+#define PROBLEM "https://judge.yosupo.jp/problem/point_add_range_sum"
 #pragma GCC optimize("Ofast,unroll-loops")
 #include "cp-algo/structures/fenwick.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/structures/segtree/range_affine_range_sum.test.cpp b/verify/structures/segtree/range_affine_range_sum.test.cpp
@@ -1,5 +1,5 @@
 // @brief Range Affine Range Sum
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/range_affine_range_sum
+#define PROBLEM "https://judge.yosupo.jp/problem/range_affine_range_sum"
 #include "cp-algo/structures/segtree/metas/affine.hpp"
 #include "cp-algo/structures/segtree.hpp"
 #include "cp-algo/number_theory/modint.hpp"
diff --git a/verify/structures/segtree/range_chmin_chmax_add_range_sum.test.cpp b/verify/structures/segtree/range_chmin_chmax_add_range_sum.test.cpp
@@ -1,5 +1,5 @@
 // @brief Range Chmin Chmax Add Range Sum
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum
+#define PROBLEM "https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum"
 #include "cp-algo/structures/segtree/metas/chmin_chmax_add.hpp"
 #include "cp-algo/structures/segtree.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/structures/treap/cartesian_tree.test.cpp b/verify/structures/treap/cartesian_tree.test.cpp
@@ -1,5 +1,5 @@
 // @brief Build Cartesian Tree
-// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/cartesian_tree
+#define PROBLEM "https://judge.yosupo.jp/problem/cartesian_tree"
 #include "cp-algo/structures/treap/metas/base.hpp"
 #include "cp-algo/structures/treap.hpp"
 #include <bits/stdc++.h>
diff --git a/verify/structures/treap/dynamic_sequence_range_affine_range_sum.test.cpp b/verify/structures/treap/dynamic_sequence_range_affine_range_sum.test.cpp
diff --git a/verify/structures/treap/range_reverse_range_sum.test.cpp b/verify/structures/treap/range_reverse_range_sum.test.cpp
