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);

verify/poly/linrec_single.test.cpp

@@ -14,7 +14,7 @@ using polyn = poly_t<base>;
 void solve() {
     int64_t d, k;
     cin >> d >> k;
-    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 Q = polyn(1) - polyn(c).mul_xk_inplace(1);

verify/poly/log.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).log_inplace(n).print(n);
 }

verify/poly/multieval.test.cpp

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

verify/poly/multieval_geo.test.cpp

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

verify/poly/pow.test.cpp

@@ -15,7 +15,7 @@ void solve() {
     int n;
     int64_t m;
     cin >> n >> m;
-    vector<base> a(n);
+    polyn::Vector a(n);
     copy_n(istream_iterator<base>(cin), n, begin(a));
     polyn(a).pow(m, n).print(n);
 }

verify/poly/prod_sequence.test.cpp

@@ -23,7 +23,7 @@ void solve() {
         int d;
         cin >> d;
         D += d;
-        vector<base> a(d + 1);
+        polyn::Vector a(d + 1);
         copy_n(istream_iterator<base>(cin), d + 1, begin(a));
         que.insert(polyn(a));
     }

verify/poly/roots.test.cpp

@@ -11,18 +11,18 @@ const int mod = 998244353;
 using base = modint<mod>;
 using polyn = poly_t<base>;
 
-void find_roots_impl(polyn const& p, vector<base> &res) {
+void find_roots_impl(polyn const& p, polyn::Vector &res) {
     if(p.deg() == 1) {
         res.push_back(-p[0] / p[1]);
     } else if(p.deg() > 1) {
-        auto A = polyn::gcd(polyn(vector<base>{(base)rng(), 1}).powmod((mod - 1) / 2, p) - base(1), polyn(p));
+        auto A = polyn::gcd(polyn(polyn::Vector{(base)rng(), 1}).powmod((mod - 1) / 2, p) - base(1), polyn(p));
         find_roots_impl(A, res);
         find_roots_impl(p / A, res);
     }
 }
 
 auto find_roots(polyn const& p) {
-    vector<base> res;
+    polyn::Vector res;
     if(p[0] == 0) {
         res.push_back(0);
     }
@@ -34,7 +34,7 @@ auto find_roots(polyn const& p) {
 void solve() {
     int n;
     cin >> n;
-    vector<base> f(n+1);
+    polyn::Vector f(n+1);
     copy_n(istream_iterator<base>(cin), n+1, begin(f));
     polyn res = find_roots(f);
     cout << res.deg() + 1 << "\n";

verify/poly/sampling.test.cpp

@@ -16,7 +16,7 @@ using polyn = poly_t<base>;
 void solve() {
     int n, m, c;
     cin >> n >> m >> c;
-    vector<base> a(n);
+    polyn::Vector a(n);
     copy_n(istream_iterator<base>(cin), n, begin(a));
     polyn A = polyn(a);
     polyn Q = polyn({1, -1}).pow(n, n + 1);

verify/poly/sqrt.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));
     auto res = polyn(a).sqrt(n);
     if(res) {

verify/poly/taylor.test.cpp

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