removed "vi"

Codigos/Estruturas de Dados/Ordered Set/ordered_set.cpp

@@ -3,4 +3,4 @@
 
 using namespace __gnu_pbds;
 
-typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
+template<typename T> typedef tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

Codigos/Estruturas de Dados/Sparse Table/sparse_table.cpp

@@ -1,8 +1,8 @@
 struct SparseTable {
     int n, e;
-    vector<vi> st;
-    SparseTable(vi &v) : n(v.size()), e(floor(log2(n))) {
-        st.assign(e + 1, vi(n));
+    vector<vector<int>> st;
+    SparseTable(vector<int> &v) : n(v.size()), e(floor(log2(n))) {
+        st.assign(e + 1, vector<int>(n));
         for (int i = 0; i < n; i++) { st[0][i] = v[i]; }
         for (int i = 1; i <= e; i++) {
             for (int j = 0; j + (1 << i) <= n; j++) { st[i][j] = min(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]); }

Codigos/Grafos/Matching/hungarian.cpp

@@ -2,12 +2,12 @@ const ll INF = 1e18 + 18;
 
 vector<pair<int, int>> result;
 
-ll hungarian(int n, int m, vector<vi> &A) {
-    vi u(n + 1), v(m + 1), p(m + 1), way(m + 1);
+ll hungarian(int n, int m, vector<vector<int>> &A) {
+    vector<int> u(n + 1), v(m + 1), p(m + 1), way(m + 1);
     for (int i = 1; i <= n; i++) {
         p[0] = i;
         int j0 = 0;
-        vi minv(m + 1, INF);
+        vector<int> minv(m + 1, INF);
         vector<char> used(m + 1, false);
         do {
             used[j0] = true;