revert back to vector

Author: lrvideckis

tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_bcc.test.cpp

@@ -6,13 +6,13 @@ int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
   cin >> n >> m;
-  vector<basic_string<int>> adj(n);
-  for (int i = 0; i < n; i++) adj[i] += i;
+  vector<vector<int>> adj(n);
+  for (int i = 0; i < n; i++) adj[i].push_back(i);
   for (int i = 0; i < m; i++) {
     int u, v;
     cin >> u >> v;
-    adj[u] += v;
-    adj[v] += u;
+    adj[u].push_back(v);
+    adj[v].push_back(u);
   }
   vi cnt(n);
   bcc_callback(adj, [&](const vi& nodes) {

tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_two_edge_cc.test.cpp

@@ -6,13 +6,13 @@ int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
   cin >> n >> m;
-  vector<basic_string<int>> adj(n);
-  for (int i = 0; i < n; i++) adj[i] += i;
+  vector<vi> adj(n);
+  for (int i = 0; i < n; i++) adj[i].push_back(i);
   for (int i = 0; i < m; i++) {
     int u, v;
     cin >> u >> v;
-    adj[u] += v;
-    adj[v] += u;
+    adj[u].push_back(v);
+    adj[v].push_back(u);
   }
   vector<pii> bridges;
   bcc_callback(adj, [&](const vi& nodes) {

tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_bcc.test.cpp

@@ -6,13 +6,13 @@ int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
   cin >> n >> m;
-  vector<basic_string<int>> adj(n);
-  for (int i = 0; i < n; i++) adj[i] += i;
+  vector<vector<int>> adj(n);
+  for (int i = 0; i < n; i++) adj[i].push_back(i);
   for (int i = 0; i < m; i++) {
     int u, v;
     cin >> u >> v;
-    adj[u] += v;
-    adj[v] += u;
+    adj[u].push_back(v);
+    adj[v].push_back(u);
   }
   vector<bool> vis(n, 0);
   vector<vector<int>> all_bccs;

tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp

@@ -7,12 +7,12 @@ int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
   cin >> n >> m;
-  vector<basic_string<int>> adj(n);
+  vector<vi> adj(n);
   for (int i = 0; i < m; i++) {
     int u, v;
     cin >> u >> v;
-    adj[u] += v;
-    adj[v] += u;
+    adj[u].push_back(v);
+    adj[v].push_back(u);
   }
   UF uf(n);
   vector<bool> seen(n);
@@ -30,8 +30,8 @@ int main() {
     }
     for (int v : nodes) uf.join(v, nodes[0]);
   });
-  vector<basic_string<int>> two_edge_ccs(n);
-  rep(i, 0, n) two_edge_ccs[uf.find(i)] += i;
+  vector<vi> two_edge_ccs(n);
+  rep(i, 0, n) two_edge_ccs[uf.find(i)].push_back(i);
   int cnt_ccs = 0;
   rep(i, 0, n) cnt_ccs += (!empty(two_edge_ccs[i]));
   cout << cnt_ccs << '\n';

tests/library_checker_aizu_tests/trees/edge_cd_reroot_dp.test.cpp

@@ -14,7 +14,7 @@ int main() {
     cin >> a[i];
     res[i] = a[i];
   }
-  vector<basic_string<int>> adj(n);
+  vector<vi> adj(n);
   vector<mint> b(n - 1), c(n - 1);
   vector<pair<int, int>> par(n, {-1, -1});
   vector<vector<int>> base_adj(n);
@@ -47,7 +47,7 @@ int main() {
   };
   { edge_cd(base_adj, edge_cd_asserts); }
   edge_cd(adj,
-    [&](const vector<basic_string<int>>& cd_adj, int cent,
+    [&](const vector<vi>& cd_adj, int cent,
       int split) -> void {
       array<vector<array<mint, 3>>, 2> all_backwards;
       array<mint, 2> sum_forward = {0, 0};