1371

Author: mkmark

leetcode/1371/0.in

@@ -0,0 +1 @@
+"eleetminicoworoep"

leetcode/1371/main.cpp

@@ -0,0 +1,39 @@
+/*
+author: [email protected]
+*/
+
+#include <bits/stdc++.h>
+#include "../../lib/LeetCodeInputTemplate.hpp"
+#include "solution-2.cpp"
+using namespace std;
+
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+int main()
+{
+    LeetCodeInput li("0.in");
+
+    auto l0 = li.get<string>(0);
+
+    chrono::steady_clock::time_point begin = chrono::steady_clock::now();
+    Solution solution;
+    auto output = solution.findTheLongestSubstring(l0);
+    chrono::steady_clock::time_point end = chrono::steady_clock::now();
+    cout << "Time difference = " << chrono::duration_cast<chrono::microseconds> (end - begin).count() << "µs" << endl;
+
+    cout << output << endl;
+
+    // for (int i: output){
+    //     cout << i << ' ';
+    // }
+
+    // for (auto i: output){
+    //     for (int j: i){
+    //         cout << j << ' ';
+    //     }
+    //     cout << '\n';
+    // }
+
+    return 0;
+}

leetcode/1371/solution-2.cpp

@@ -0,0 +1,60 @@
+/*
+author: [email protected]
+time: O()
+space: O()
+
+Runtime: 40 ms, faster than 100.00% of C++ online submissions for Find the Longest Substring Containing Vowels in Even Counts.
+Memory Usage: 16.2 MB, less than 60.64% of C++ online submissions for Find the Longest Substring Containing Vowels in Even Counts.
+*/
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define all(x) begin(x), end(x)
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+class Solution {
+public:
+    int findTheLongestSubstring(string s) {
+        int n = size(s);
+        int pos_by_val[32];
+        fill_n(pos_by_val, 32, -2);
+        pos_by_val[0] = -1;
+        int status = 0;
+        int ans = 0;
+        for (int i=0; i<n; ++i){
+            switch (s[i]){
+                case 'a':
+                    status ^= 1;
+                    break;
+                case 'e':
+                    status ^= 2;
+                    break;
+                case 'i':
+                    status ^= 4;
+                    break;
+                case 'o':
+                    status ^= 8;
+                    break;
+                case 'u':
+                    status ^= 16; 
+                    break;
+            }
+            if (pos_by_val[status] == -2){
+                pos_by_val[status] = i;
+            } else {
+                ans = max(ans, i-pos_by_val[status]);
+            }
+        }
+        return ans;
+    }
+};
+
+const static auto initialize = [] {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+    return nullptr;
+}();

leetcode/1371/solution.cpp

@@ -0,0 +1,44 @@
+/*
+author: [email protected]
+time: O()
+space: O()
+
+Runtime: 450 ms, faster than 6.64% of C++ online submissions for Find the Longest Substring Containing Vowels in Even Counts.
+Memory Usage: 93.9 MB, less than 5.26% of C++ online submissions for Find the Longest Substring Containing Vowels in Even Counts.
+*/
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define all(x) begin(x), end(x)
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+class Solution {
+public:
+    int findTheLongestSubstring(string s) {
+        int n = size(s);
+        unordered_map<int, int> pos_by_val;
+        int status = 0;
+        int ans = 0;
+        pos_by_val.emplace(0, -1);
+        for (int i=0; i<n; ++i){
+            if (s[i] == 'a' || s[i] == 'e' || s[i] == 'i' || s[i] == 'o' || s[i] == 'u'){
+                status ^= (1<<(s[i]-'a'));
+            }
+            auto res = pos_by_val.emplace(status, i);
+            if (!res.second){
+                ans = max(ans, i-(*res.first).second);
+            }
+        }
+        return ans;
+    }
+};
+
+const static auto initialize = [] {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+    return nullptr;
+}();