speedup

Author: lrvideckis

library/math/matrix_related/xor_basis_unordered.hpp

@@ -12,7 +12,7 @@
 //! @time O(32) or O(64)
 //! @space O(32) or O(64)
 template<class T> struct basis {
-  vector<T> b;
+  basic_string<T> b;
   T shrink(T v) {
     for (T x : b) v = min(v, v ^ x);
     return v;

library/math/matrix_related/xor_basis_unordered_intersection.hpp

@@ -6,8 +6,8 @@
 template<class T>
 basis<T> intersection(const basis<T>& u,
   const basis<T>& v) {
-  vector<array<T, 2>> w(sz(u.b));
-  rep(i, 0, sz(w)) w[i] = {u.b[i], u.b[i]};
+  basic_string<array<T, 2>> w;
+  for (T e : u.b) w.push_back({e, e});
   basis<T> res;
   for (T e : v.b) {
     T s = 0;

tests/library_checker_aizu_tests/strings/longest_common_substring.test.cpp

@@ -12,15 +12,15 @@ int main() {
   pair<int, int> substr_s = {0, 0}, substr_t = {0, 0};
   for (int i = 0; i < sz(sf_a.lcp); i++) {
     if (both[sf_a.sa[i]] == '$' ||
-        both[sf_a.sa[i + 1]] == '$')
+      both[sf_a.sa[i + 1]] == '$')
       continue;
     bool before_in_s = (sf_a.sa[i] < sz(s));
     bool after_in_s = (sf_a.sa[i + 1] < sz(s));
     if (before_in_s ^ after_in_s) {
       if (sf_a.lcp[i] > substr_s.second - substr_s.first) {
         substr_s = {sf_a.sa[i], sf_a.sa[i] + sf_a.lcp[i]};
         substr_t = {
-            sf_a.sa[i + 1], sf_a.sa[i + 1] + sf_a.lcp[i]};
+          sf_a.sa[i + 1], sf_a.sa[i + 1] + sf_a.lcp[i]};
         if (after_in_s) swap(substr_s, substr_t);
         substr_t.first -= int(sz(s)) + 1;
         substr_t.second -= int(sz(s)) + 1;