Fixes

Author: adamant-pwn

cp-algo/linalg/frobenius.hpp

@@ -25,7 +25,7 @@ namespace cp_algo::linalg {
                     }
                     y.normalize();
                     if(vec<base>(y[std::slice(0, n, 1)]) == vec<base>(n)) {
-                        return polyn(std::vector<base>(begin(y) + n, end(y)));
+                        return polyn(polyn::Vector(begin(y) + n, end(y)));
                     } else {
                         basis_init.push_back(x);
                         basis.push_back(y);

verify/poly/convolution107.test.cpp

@@ -13,7 +13,7 @@ using base = modint<mod>;
 void solve() {
     int n, m;
     cin >> n >> m;
-    vector<base> a(n), b(m);
+    vector<base, cp_algo::big_alloc<base>> a(n), b(m);
     copy_n(istream_iterator<base>(cin), n, begin(a));
     copy_n(istream_iterator<base>(cin), m, begin(b));
     fft::mul(a, b);

verify/poly/div.test.cpp

@@ -13,7 +13,7 @@ using polyn = poly_t<base>;
 void solve() {
     int n, m;
     cin >> n >> m;
-    vector<base> a(n), b(m);
+    polyn::Vector a(n), b(m);
     copy_n(istream_iterator<base>(cin), n, begin(a));
     copy_n(istream_iterator<base>(cin), m, begin(b));
     auto [q, r] = polyn(a).divmod(b);

verify/poly/exp.test.cpp

@@ -14,7 +14,7 @@ using polyn = poly_t<base>;
 void solve() {
     int n;
     cin >> n;
-    vector<base> a(n);
+    polyn::Vector a(n);
     copy_n(istream_iterator<base>(cin), n, begin(a));
     polyn(a).exp_inplace(n).print(n);
 }

verify/poly/find_linrec.test.cpp

@@ -13,7 +13,7 @@ using polyn = poly_t<base>;
 void solve() {
     int n;
     cin >> n;
-    vector<base> a(n);
+    polyn::Vector a(n);
     copy_n(istream_iterator<base>(cin), n, begin(a));
     auto Q = polyn(a).min_rec(n);
     int d = Q.deg();

verify/poly/inter.test.cpp

@@ -13,7 +13,7 @@ using polyn = poly_t<base>;
 void solve() {
     int n;
     cin >> n;
-    vector<base> x(n), y(n);
+    polyn::Vector x(n), y(n);
     copy_n(istream_iterator<base>(cin), n, begin(x));
     copy_n(istream_iterator<base>(cin), n, begin(y));
     polyn::inter(x, y).print(n);

verify/poly/inter_geo.test.cpp

@@ -14,7 +14,7 @@ using polyn = poly_t<base>;
 void solve() {
     int n, a, r;
     cin >> n >> a >> r;
-    vector<base> y(n);
+    polyn::Vector y(n);
     copy_n(istream_iterator<base>(cin), n, begin(y));
     polyn(y).chirpz_inverse(r, n).mulx(base(a).inv()).print(n);
 }

verify/poly/inv.test.cpp

@@ -14,7 +14,7 @@ using polyn = poly_t<base>;
 void solve() {
     int n;
     cin >> n;
-    vector<base> a(n);
+    polyn::Vector a(n);
     copy_n(istream_iterator<base>(cin), n, begin(a));
     polyn(a).inv_inplace(n).print(n);
 }

verify/poly/inv_mod.test.cpp

@@ -13,7 +13,7 @@ using polyn = poly_t<base>;
 void solve() {
     int n, m;
     cin >> n >> m;
-    vector<base> a(n), b(m);
+    polyn::Vector a(n), b(m);
     copy_n(istream_iterator<base>(cin), n, begin(a));
     copy_n(istream_iterator<base>(cin), m, begin(b));
     auto res = polyn(a).inv_mod(polyn(b));

verify/poly/linrec_consecutive.test.cpp

@@ -15,7 +15,7 @@ void solve() {
     int d, M;
     int64_t k;
     cin >> d >> k >> M;
-    vector<base> a(d), c(d);
+    polyn::Vector a(d), c(d);
     copy_n(istream_iterator<base>(cin), d, begin(a));
     copy_n(istream_iterator<base>(cin), d, begin(c));
     polyn A = polyn(a);