finished some flashcards and S1 from yesterday

Author: Github11200

Contests/DMOJ Contests/OTHS Coding Competition 3 (CCC)/S1.cpp

@@ -48,21 +48,25 @@ void the5thLaboratory()
     }
     else
     {
+      // Get the triangle distance
+      double distanceToPoint = hypot(abs(hidingSpotCoordinates.x - labCoordinates.x), abs(hidingSpotCoordinates.y - labCoordinates.y));
+
       // Go all the way down
       distance = abs(hidingSpotCoordinates.z - labCoordinates.z);
       time += distance / 4;
 
-      // Get the distance remaining
-      distance = hypot(abs(hidingSpotCoordinates.x - labCoordinates.x), abs(hidingSpotCoordinates.y - labCoordinates.y)) - (3 * time);
-
-      // Travel on flat ground
-      time += abs(distance) / 2;
+      double distanceCovered = time * 3;
+      if (distanceToPoint - distanceCovered > 0)
+      {
+        time += (distanceToPoint - distanceCovered) / 2;
+      }
     }
 
     if (minimumTime == -1)
       minimumTime = time;
     else
       minimumTime = min(minimumTime, time);
+    time = 0;
   }
 
   printf("%f\n", minimumTime);

Contests/DMOJ Contests/OTHS Coding Competition 3 (CCC)/S3

@@ -2,39 +2,11 @@
 
 using namespace std;
 
-void gates()
-{
-  int numberOfGates;
-  int numberOfPlanes;
-
-  scanf("%d", &numberOfGates);
-  scanf("%d", &numberOfPlanes);
-
-  vector<int> planes(numberOfPlanes);
-  set<int, greater<int>> gates;
-  for (int i = 0; i < numberOfPlanes; ++i)
-    scanf("%d", &planes[i]);
-  for (int i = 1; i <= numberOfGates; ++i)
-    gates.insert(i);
-
-  int numberOfPlanesAbleToDock = 0;
-  for (int i = 0; i < numberOfPlanes; ++i)
-  {
-    auto gate = gates.lower_bound(planes[i]);
-    if (gate == gates.end())
-      break;
-    gates.erase(*gate);
-    ++numberOfPlanesAbleToDock;
-  }
-
-  printf("%d\n", numberOfPlanesAbleToDock);
-}
-
 int subarraySumEqualsK(vector<int> &nums, int k)
 {
   unordered_map<int, int> previousSums;
   previousSums[0] = 1;
-  int prefixSum;
+  int prefixSum = 0;
   int numberOfSubarrays = 0;
 
   for (int i = 0; i < nums.size(); ++i)
@@ -53,6 +25,27 @@ int subarraySumEqualsK(vector<int> &nums, int k)
   return numberOfSubarrays;
 }
 
+bool wordBreak(string s, vector<string> wordDict)
+{
+  vector<bool> dp(s.size() + 1, false);
+  dp[dp.size() - 1] = true;
+
+  for (int i = s.size() - 1; i >= 0; --i)
+  {
+    for (int j = 0; j < wordDict.size(); ++j)
+    {
+      if (i + wordDict[j].size() <= s.size() && dp[i + wordDict[j].size()])
+      {
+        string curr = s.substr(i, wordDict[j].size());
+        if (curr == wordDict[j])
+          dp[i] = true;
+      }
+    }
+  }
+
+  return dp[0];
+}
+
 int deleteAndEarn(vector<int> &nums)
 {
   sort(nums.begin(), nums.end());
@@ -62,29 +55,48 @@ int deleteAndEarn(vector<int> &nums)
   for (int i = 0; i < nums.size(); ++i)
   {
     if (i == 0 || nums[i] != nums[i - 1])
+    {
       numsPrime.push_back(nums[i]);
-    ++counts[nums[i]];
+      counts[nums[i]] = 1;
+    }
+    else if (i > 0 && nums[i] == nums[i - 1])
+      ++counts[nums[i]];
   }
 
   vector<int> dp(numsPrime.size(), 0);
-  for (int i = 0; i < numsPrime.size(); ++i)
+  dp[0] = numsPrime[0] * counts[numsPrime[0]];
+  for (int i = 1; i < numsPrime.size(); ++i)
   {
     int value = numsPrime[i] * counts[numsPrime[i]];
-
-    if (i > 0 && numsPrime[i] - numsPrime[i - 1] > 1)
+    if (numsPrime[i] - numsPrime[i - 1] > 1)
       value += numsPrime[i - 1];
-    else if (i >= 2 && numsPrime[i] - numsPrime[i - 1] == 1)
-      value += dp[i - 2];
-    if (i > 0)
-      dp[i] = max(dp[i - 1], value);
     else
-      dp[i] = value;
+      value = max(value + (i >= 2 ? numsPrime[i - 2] : 0), numsPrime[i - 1]);
+    dp[i] = value;
   }
 
   return dp[dp.size() - 1];
 }
 
+void iterativePreOrderTraversal(TreeNode *root)
+{
+  stack<TreeNode *> nextNodes;
+  nextNodes.push(root);
+  while (!nextNodes.empty())
+  {
+    TreeNode *curr = nextNodes.top();
+    nextNodes.pop();
+    printf("%d ", curr->val);
+
+    if (curr->right != nullptr)
+      nextNodes.push(curr->right);
+    if (curr->left != nullptr)
+      nextNodes.push(curr->left);
+  }
+}
+
 int main()
 {
+  iterativePreOrderTraversal(createDefaultTree());
   return 0;
 }