Fix potential underflows due to unsigned integers

Author: SuprDewd

code/data-structures/convex_hull_trick.cpp

@@ -11,7 +11,7 @@ struct convex_hull_trick {
       swap(h[n-2], h[n-1]);
       h.pop_back(); } }
   double get_min(double x) {
-    int lo = 0, hi = size(h) - 2, res = -1;
+    int lo = 0, hi = (int)size(h) - 2, res = -1;
     while (lo <= hi) {
       int mid = lo + (hi - lo) / 2;
       if (intersect(mid) <= x) res = mid, lo = mid + 1;

code/data-structures/kd_tree.cpp

@@ -42,7 +42,7 @@ template <int K> struct kd_tree {
   node *root;
   // kd_tree() : root(NULL) { }
   kd_tree(vector<pt> pts) {
-    root = construct(pts, 0, size(pts) - 1, 0); }
+    root = construct(pts, 0, (int)size(pts) - 1, 0); }
   node* construct(vector<pt> &pts, int from, int to, int c) {
     if (from > to) return NULL;
     int mid = from + (to - from) / 2;

code/graph/blossom.cpp

@@ -55,15 +55,15 @@ vi find_augmenting_path(const vector<vi> &adj,const vi &m){
             rep(i,0,size(p)) p[i] = root[p[i]];
             return p; }
           if (!p[0] || (m[c] != -1 && p[t+1] != par[m[c]]))
-            reverse(p.begin(), p.end()), t = size(p)-t-1;
+            reverse(p.begin(), p.end()), t=(int)size(p)-t-1;
           rep(i,0,t) q.push_back(root[p[i]]);
           iter(it,adj[root[p[t-1]]]) {
             if (par[*it] != (s = 0)) continue;
             a.push_back(c), reverse(a.begin(), a.end());
             iter(jt,b) a.push_back(*jt);
             while (a[s] != *it) s++;
-            if ((height[*it] & 1) ^ (s < size(a) - size(b)))
-              reverse(a.begin(), a.end()), s = size(a)-s-1;
+            if((height[*it]&1)^(s<(int)size(a)-(int)size(b)))
+              reverse(a.begin(),a.end()), s=(int)size(a)-s-1;
             while(a[s]!=c)q.push_back(a[s]),s=(s+1)%size(a);
             q.push_back(c);
             rep(i,t+1,size(p)) q.push_back(root[p[i]]);

code/graph/dinic.cpp

@@ -10,8 +10,8 @@ struct flow_network {
     memset(head = new int[n], -1, n*sizeof(int)); }
   void reset() { e = e_store; }
   void add_edge(int u, int v, int uv, int vu=0) {
-    e.push_back(edge(v, uv, head[u])); head[u] = size(e)-1;
-    e.push_back(edge(u, vu, head[v])); head[v] = size(e)-1; }
+    e.push_back(edge(v,uv,head[u])); head[u]=(int)size(e)-1;
+    e.push_back(edge(u,vu,head[v])); head[v]=(int)size(e)-1;}
   int augment(int v, int t, int f) {
     if (v == t) return f;
     for (int &i = curh[v], ret; i != -1; i = e[i].nxt)

code/graph/edmonds_karps.cpp

@@ -9,8 +9,8 @@ struct flow_network {
     memset(head = new int[n], -1, n*sizeof(int)); }
   void reset() { e = e_store; }
   void add_edge(int u, int v, int uv, int vu=0) {
-    e.push_back(edge(v, uv, head[u])); head[u] = size(e)-1;
-    e.push_back(edge(u, vu, head[v])); head[v] = size(e)-1; }
+    e.push_back(edge(v,uv,head[u])); head[u]=(int)size(e)-1;
+    e.push_back(edge(u,vu,head[v])); head[v]=(int)size(e)-1;}
   int max_flow(int s, int t, bool res=true) {
     e_store = e;
     int l, r, v, f = 0;

code/graph/edmonds_karps_mcmf.cpp

@@ -11,9 +11,9 @@ struct flow_network {
   void reset() { e = e_store; }
   void add_edge(int u, int v, int cost, int uv, int vu=0) {
     e.push_back(edge(v, uv, cost, head[u]));
-    head[u] = size(e)-1;
+    head[u] = (int)size(e)-1;
     e.push_back(edge(u, vu, -cost, head[v]));
-    head[v] = size(e)-1; }
+    head[v] = (int)size(e)-1; }
   ii min_cost_max_flow(int s, int t, bool res=true) {
     e_store = e;
     memset(pot, 0, n*sizeof(int));

code/graph/hld.cpp

@@ -34,7 +34,7 @@ struct HLD {
     vi uat, vat; int res = -1;
     while (u != -1) uat.push_back(u), u = parent[head[u]];
     while (v != -1) vat.push_back(v), v = parent[head[v]];
-    u = size(uat) - 1, v = size(vat) - 1;
+    u = (int)size(uat) - 1, v = (int)size(vat) - 1;
     while (u >= 0 && v >= 0 && head[uat[u]] == head[vat[v]])
       res = (loc[uat[u]] < loc[vat[v]] ? uat[u] : vat[v]),
       u--, v--;

code/graph/hld.test.cpp

@@ -33,7 +33,7 @@ struct HLD_naive {
     vi uat, vat; int res = -1;
     while (u != -1) uat.push_back(u), u = parent[u].first;
     while (v != -1) vat.push_back(v), v = parent[v].first;
-    u = size(uat) - 1, v = size(vat) - 1;
+    u = (int)size(uat) - 1, v = (int)size(vat) - 1;
     while (u >= 0 && v >= 0 && uat[u] == vat[v])
       res = uat[u], u--, v--;
     return res;
@@ -205,7 +205,7 @@ void test() {
       {
         if (n > 1)
         {
-          int i = randint(0, size(edges) - 1);
+          int i = randint(0, (int)size(edges) - 1);
           int u = edges[i].first,
             v = edges[i].second;
 

code/mathematics/primepi.cpp

@@ -7,8 +7,8 @@ unordered_map<ll,ll> primepi(ll n) {
   vi ps = prime_sieve(st);
   ps.push_back(st+1);
   rep(i,0,3) dp[i] = new ll[2*st];
-  ll *pre = new ll[size(ps)-1];
-  rep(i,0,size(ps)-1)
+  ll *pre = new ll[(int)size(ps)-1];
+  rep(i,0,(int)size(ps)-1)
     pre[i] = f(ps[i]) + (i == 0 ? f(1) : pre[i-1]);
 #define L(i) ((i)<st?(i)+1:n/(2*st-(i)))
 #define I(l) ((l)<st?(l)-1:2*st-n/(l))

code/other/two_sat.cpp

@@ -21,7 +21,7 @@ struct TwoSat {
       br |= !V[*v].val; }
     res = br - 3;
     if (V[u].num == V[u].lo) rep(i,res+1,2) {
-      for (int j = size(S)-1; ; j--) {
+      for (int j = (int)size(S)-1; ; j--) {
         int v = S[j];
         if (i) {
           if (!put(v-n, res)) return 0;