2116

Author: mkmark

leetcode/2116/0.in

@@ -0,0 +1,8 @@
+"))()))"
+"010100"
+0   1  0
+-1  1  0
+-1  
+-2
+-2
+-2

leetcode/2116/249.in

@@ -0,0 +1,2 @@
+"()()))()())(((()((()((()((()()()))(()()((()((()()(((()())))))()((()(()(())((()()((())))))))(())(())))()()()((()())())(()()))((((((())()())())))))())((((()())(())(())()()()(()(()((()))((((()((()((()())(())((((())(())))(()((((())))((()(((((()()))))((((()))))())()))))())"
+"0111000100000011110100010110101001110111010111110111111011101000100000011101010000110110001100100100100011000001110101101110011000000011111000111111111001011101100000100111010111010000001100011101000110101011001000100100111110110110100101010111111001000010000010010010"

leetcode/2116/89.in

@@ -0,0 +1,2 @@
+"())(()(()(())()())(())((())(()())((())))))(((((((())(()))))("
+"100011110110011011010111100111011101111110000101001101001111"

leetcode/2116/main.cpp

@@ -0,0 +1,42 @@
+/*
+author: [email protected]
+*/
+
+#include <bits/stdc++.h>
+
+#include "../../lib/LeetCodeInputTemplate.hpp"
+#include "solution.cpp"
+using namespace std;
+
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+int main() {
+  LeetCodeInput li("249.in");
+
+  auto l0 = li.get<string>(0);
+  auto l1 = li.get<string>(1);
+
+  chrono::steady_clock::time_point begin = chrono::steady_clock::now();
+  Solution solution;
+  auto output = solution.canBeValid(l0, l1);
+  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/2116/solution.cpp

@@ -0,0 +1,88 @@
+/*
+author: [email protected]
+time: O(n)
+space: O(1)
+
+Runtime
+42 ms
+Beats
+99.80%
+Memory
+22.1 MB
+Beats
+95.56%
+*/
+
+#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:
+  bool canBeValid(string& s, string& locked) {
+    int n = size(s);
+    if (n % 2 == 1) return false;
+
+    int state = 0;
+    int flex = 0;
+    int diff = 0;
+
+    for (int i = 0; i < n; ++i) {
+      if (locked[i] == '1') {
+        if (s[i] == '(') {
+          ++state;
+        } else {
+          --state;
+          if (state == -1) {
+            if (flex == 0) {
+              return false;
+            } else {
+              ++state;
+              --flex;
+            }
+          }
+        }
+      } else {
+        ++flex;
+      }
+    }
+
+    if (state > flex) return false;
+
+    state = 0;
+    flex = 0;
+
+    for (int i = n - 1; i >= 0; --i) {
+      if (locked[i] == '1') {
+        if (s[i] == ')') {
+          ++state;
+        } else {
+          --state;
+          if (state == -1) {
+            if (flex == 0) {
+              return false;
+            } else {
+              ++state;
+              --flex;
+            }
+          }
+        }
+      } else {
+        ++flex;
+      }
+    }
+
+    return true;
+  }
+};
+
+const static auto initialize = [] {
+  std::ios::sync_with_stdio(false);
+  std::cin.tie(nullptr);
+  std::cout.tie(nullptr);
+  return nullptr;
+}();