More fixes

Author: adamant-pwn

cp-algo/graph/base.hpp

@@ -13,7 +13,7 @@ namespace cp_algo::graph {
         graph(int n, int v0 = 0): v0(v0), adj(n) {}
 
         void add_edge(node_index u, edge_t e) {
-            adj.push(u, size(edges));
+            adj.push(u, (edge_index)size(edges));
             edges.push_back(e);
             if constexpr (undirected) {
                 adj.push(e.to, size(edges));
@@ -51,7 +51,7 @@ namespace cp_algo::graph {
         }
         auto const& incidence_lists() const {return adj;}
         edge_t const& edge(edge_index e) const {return edges[e];}
-        node_index n() const {return adj.size();}
+        node_index n() const {return (node_index)adj.size();}
         edge_index m() const {return size(edges) / 2;}
     private:
         node_index v0;

cp-algo/structures/stack_union.hpp

@@ -9,7 +9,7 @@ namespace cp_algo::structures {
 
         void push(int v, datatype const& vdata) {
             next.push_back(head[v]);
-            head[v] = std::size(next) - 1;
+            head[v] = (int)std::size(next) - 1;
             data.push_back(vdata);
         }
         template<typename... Args>

cp-algo/structures/treap.hpp

@@ -8,7 +8,7 @@ namespace cp_algo::structures::treap {
     struct node {
         using treap = node*;
         meta _meta;
-        int prior = random::rng();
+        int prior = (int)random::rng();
         size_t size = 1;
         treap children[2] = {nullptr, nullptr};
         enum subtree {L, R};