did some flashcards and I'm working on a mock CCC problem

Author: Github11200

Solutions/DMOJ Solutions/S3/optimalSplitPoint

@@ -0,0 +1,83 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+/*******************************************************************************************
+  Link:
+  Points:
+  Original solution:
+*******************************************************************************************/
+
+void optimalSplitPoint()
+{
+  int N;
+  scanf("%d", &N);
+
+  vector<int> a(N);
+  int leftSum = 0;
+  int rightSum = 0;
+  for (int i = 0; i < N; ++i)
+  {
+    int temp;
+    scanf("%d", &temp);
+    a[i] = temp;
+
+    if (i == 0)
+      leftSum += temp;
+    if (i >= 1)
+      rightSum += temp;
+  }
+
+  int bestSplit = INT_MAX;
+  int bestSplitIndex = 0;
+  int bestSwapIndex = -1;
+
+  // sort(rightCounts.begin(), rightCounts.end());
+  for (int i = 1; i < N - 1; ++i)
+  {
+    rightSum -= a[i];
+    int diff = abs(leftSum - rightSum);
+    if (diff < bestSplit)
+    {
+      bestSplit = diff;
+      bestSplitIndex = i + 1;
+    }
+
+    if (leftSum == rightSum)
+    {
+      printf("%d %d\n", i + 1, bestSwapIndex);
+      return;
+    }
+    // We want to shift element from right array to left array
+    else if (leftSum < rightSum)
+    {
+      diff = abs((leftSum + a[i + 1]) - (rightSum - a[i + 1]));
+      if (diff < bestSplit)
+      {
+        bestSplit = diff;
+        bestSplitIndex = i + 1;
+        bestSwapIndex = i + 2;
+      }
+    }
+    else
+    {
+      diff = abs((leftSum + a[i - 1]) - (rightSum - a[i - 1]));
+      if (diff < bestSplit)
+      {
+        bestSplit = diff;
+        bestSplitIndex = i + 1;
+        bestSwapIndex = i - 2;
+      }
+    }
+
+    leftSum += a[i];
+  }
+
+  printf("%d %d\n", bestSplitIndex, bestSwapIndex);
+}
+
+int main()
+{
+  optimalSplitPoint();
+  return 0;
+}

Solutions/DMOJ Solutions/S3/optimalSplitPoint.cpp

@@ -2,32 +2,47 @@
 
 using namespace std;
 
-vector<int> nextGreaterElement1(vector<int> &nums1, vector<int> &nums2)
+string addBinary(string a, string b)
 {
-  unordered_map<int, int> nums1Hash;
-  for (int i = 0; i < nums1.size(); ++i)
-    nums1Hash[i] = i;
+  int i = a.size() - 1;
+  int j = b.size() - 1;
+  int carry = 0;
 
-  stack<int> descendingNums;
-  vector<int> res(nums1.size(), -1);
-  for (int i = 0; i < nums2.size(); ++i)
+  string c = "";
+  while (i >= 0 || j >= 0 || carry != 0)
   {
-    while (!descendingNums.empty() && nums2[i] > descendingNums.top())
+    if (i >= 0 && a[i] == '1')
+      ++carry;
+    if (j >= 0 && b[j] == '1')
+      ++carry;
+
+    c = to_string(carry % 2) + c;
+    carry /= 2;
+    --i;
+    --j;
+  }
+  return c;
+}
+
+int decodeWays(string s)
+{
+  vector<int> dp(s.size() + 1, 1);
+  for (int i = s.size() - 1; i >= 0; --i)
+  {
+    if (s[i] == '0')
     {
-      res[nums1Hash[descendingNums.top()]] = nums2[i];
-      descendingNums.pop();
+      dp[i] = 0;
+      continue;
     }
-    if (nums1Hash.count(nums2[i]) > 0)
-      descendingNums.push(nums2[i]);
+    dp[i] = dp[i + 1];
+    if (i < s.size() - 1 && (s[i] == '1' || (s[i] == '2' && int(s[i + 1]) <= 54)))
+      dp[i] += dp[i + 2];
   }
-
-  return res;
+  return dp[0];
 }
 
 int main()
 {
-  vector<int> nums1({4, 1, 2});
-  vector<int> nums2({1, 3, 4, 2});
-  displayVector(nextGreaterElement1(nums1, nums2));
+  cout << decodeWays("11106");
   return 0;
 }