Update

Author: adamant-pwn

cp-algo/geometry/closest_pair.hpp

@@ -21,7 +21,7 @@ namespace cp_algo::geometry {
                 }
             }
         }
-        std::map<point, big_vector<size_t>> neigs;
+        big_map<point, big_vector<size_t>> neigs;
         md = (int64_t)ceil(sqrt((double)md));
         for(size_t i = 0; i < n; i++) {
             neigs[r[i] / md].push_back(i);

cp-algo/graph/shortest_path.hpp

@@ -20,7 +20,7 @@ namespace cp_algo::graph {
                 return dist > other.dist;
             }
         };
-        std::priority_queue<que_t> pq;
+        big_priority_queue<que_t> pq;
 
         dijkstra_context(int n) : shortest_path_context(n) {}
 
@@ -73,7 +73,7 @@ namespace cp_algo::graph {
             edge_index e;
             node_index v;
         };
-        big_vector<std::basic_string<traverse_edge>> dependents;
+        big_vector<big_basic_string<traverse_edge>> dependents;
 
         deep_spfa_context(int n) : spfa_context(n), dependents(n) {}
 

cp-algo/number_theory/two_squares.hpp

@@ -39,7 +39,7 @@ namespace cp_algo::math {
             return {0};
         }
         auto primes = factorize(n);
-        std::map<Int, int> cnt;
+        big_map<Int, int> cnt;
         for(auto p: primes) {
             cnt[p]++;
         }

cp-algo/util/big_alloc.hpp

@@ -79,5 +79,7 @@ namespace cp_algo {
     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>>;
 }
 #endif // CP_ALGO_UTIL_big_alloc_HPP