Fixes

Author: adamant-pwn

cp-algo/structures/eertree.hpp

@@ -63,7 +63,7 @@ namespace cp_algo::structures {
             print(std::identity{});
         }
     private:
-        big_vector<std::forward_list<int>> to;
+        big_vector<big_forward_list<int>> to;
         big_vector<int> len, link, par;
         big_string s;
         int n = 1, sz = 2, last = 0;

cp-algo/tree/diameter.hpp

@@ -43,7 +43,7 @@ namespace cp_algo::graph {
             return s.length + t.length;
         } else {
             auto collect = [&](up_path v) {
-                std::basic_string<edge_index> path;
+                big_basic_string<edge_index> path;
                 while(v.length) {
                     edge_index ep = (*parents)[v.start];
                     path.push_back(ep);

cp-algo/util/big_alloc.hpp

@@ -1,6 +1,7 @@
 #ifndef CP_ALGO_UTIL_big_alloc_HPP
 #define CP_ALGO_UTIL_big_alloc_HPP
 
+#include <set>
 #include <map>
 #include <deque>
 #include <stack>
@@ -10,6 +11,7 @@
 #include <cstddef>
 #include <iostream>
 #include <generator>
+#include <forward_list>
 
 // Single macro to detect POSIX platforms (Linux, Unix, macOS)
 #if defined(__linux__) || defined(__unix__) || (defined(__APPLE__) && defined(__MACH__))
@@ -67,21 +69,18 @@ namespace cp_algo {
         }
     };
 
-    template<typename T>
-    using big_vector = std::vector<T, big_alloc<T>>;
-    template<typename T>
-    using big_basic_string = std::basic_string<T, std::char_traits<T>, big_alloc<T>>;
-    template<typename T>
-    using big_deque = std::deque<T, big_alloc<T>>;
+    template<typename T> using big_vector = std::vector<T, big_alloc<T>>;
+    template<typename T> using big_basic_string = std::basic_string<T, std::char_traits<T>, big_alloc<T>>;
+    template<typename T> using big_deque = std::deque<T, big_alloc<T>>;
+    template<typename T> using big_stack = std::stack<T, big_deque<T>>;
+    template<typename T> using big_queue = std::queue<T, big_deque<T>>;
+    template<typename T> using big_priority_queue = std::priority_queue<T, big_vector<T>>;
+    template<typename T> using big_forward_list = std::forward_list<T, big_alloc<T>>;
+    using big_string = big_basic_string<char>;
     template<typename Key, typename Value, typename Compare = std::less<Key>>
     using big_map = std::map<Key, Value, Compare, big_alloc<std::pair<const Key, Value>>>;
-    using big_string = big_basic_string<char>;
-    template<typename T>
-    using big_stack = std::stack<T, big_deque<T>>;
-    template<typename T>
-    using big_queue = std::queue<T, big_deque<T>>;
-    template<typename T>
-    using big_priority_queue = std::priority_queue<T, big_vector<T>>;
+    template<typename T, typename Compare = std::less<T>>
+    using big_multiset = std::multiset<T, Compare, big_alloc<T>>;
     template<typename Ref, typename V = void>
     using big_generator = std::generator<Ref, V, big_alloc<std::byte>>;
 }
@@ -91,4 +90,5 @@ namespace std::ranges {
     template<typename Ref, typename V>
     elements_of(cp_algo::big_generator<Ref, V>&&) -> elements_of<cp_algo::big_generator<Ref, V>&&, cp_algo::big_alloc<std::byte>>;
 }
+
 #endif // CP_ALGO_UTIL_big_alloc_HPP

verify/number_theory/factorize.test.cpp

@@ -11,7 +11,7 @@ using namespace cp_algo::math;
 void solve() {
     int64_t m;
     cin >> m;
-    auto res = to<vector>(factorize(m));
+    auto res = to<cp_algo::big_vector<int64_t>>(factorize(m));
     ranges::sort(res);
     cout << size(res) << " ";
     ranges::copy(res, ostream_iterator<int64_t>(cout, " "));

verify/poly/prod_sequence.test.cpp

@@ -16,7 +16,7 @@ void solve() {
     int N;
     cin >> N;
     cp_algo::big_vector<polyn> polys(N);
-    multiset<polyn, decltype([](polyn const& a, polyn const& b){
+    cp_algo::big_multiset<polyn, decltype([](polyn const& a, polyn const& b){
         return a.deg() < b.deg();
     })> que = {polyn(1)};
     int D = 0;

verify/string/eertree.test.cpp

@@ -19,7 +19,7 @@ int yosupo(int v) {
 }
 
 void solve() {
-    string s;
+    cp_algo::big_string s;
     cin >> s;
     eertree me(size(s));
     cp_algo::big_vector<int> lasts;