Weekly Contest 238

Author: MaskRay

find-xor-sum-of-all-pairs-bitwise-and.rs

@@ -0,0 +1,6 @@
+impl Solution {
+    pub fn get_xor_sum(arr1: Vec<i32>, arr2: Vec<i32>) -> i32 {
+        use std::ops::BitXor;
+        arr1.iter().fold(0, BitXor::bitxor) & arr2.iter().fold(0, BitXor::bitxor)
+    }
+}

frequency-of-the-most-frequent-element.cc

@@ -0,0 +1,20 @@
+// Frequency of the Most Frequent Element
+#define FOR(i, a, b) for (remove_cv<remove_reference<decltype(b)>::type>::type i = (a); i < (b); i++)
+#define REP(i, n) FOR(i, 0, n)
+
+class Solution {
+public:
+  int maxFrequency(vector<int>& a, int k) {
+    long n = a.size(), j = 0, ans = 0;
+    sort(a.begin(), a.end());
+    vector<long> b(n+1);
+    REP(i, n)
+      b[i+1] = b[i]+a[i];
+    REP(i, n) {
+      while ((i-j)*a[i]-(b[i]-b[j]) > k)
+        j++;
+      ans = max(ans, i-j+1);
+    }
+    return ans;
+  }
+};

longest-substring-of-all-vowels-in-order.cc

@@ -0,0 +1,49 @@
+// Longest Substring Of All Vowels in Order
+class Solution {
+public:
+  int longestBeautifulSubstring(string a) {
+    int n = a.size(), ans = 0;
+    for (int i = 0; i < n; )
+      if (a[i] != 'a')
+        i++;
+      else {
+        int j = i; while (++i < n && a[i] == 'a');
+        if (a[i] != 'e') continue; while (++i < n && a[i] == 'e');
+        if (a[i] != 'i') continue; while (++i < n && a[i] == 'i');
+        if (a[i] != 'o') continue; while (++i < n && a[i] == 'o');
+        if (a[i] != 'u') continue; while (++i < n && a[i] == 'u');
+        ans = max(ans, i-j);
+      }
+    return ans;
+  }
+};
+
+///
+
+#define FOR(i, a, b) for (remove_cv<remove_reference<decltype(b)>::type>::type i = (a); i < (b); i++)
+#define REP(i, n) FOR(i, 0, n)
+
+class Solution {
+public:
+  int longestBeautifulSubstring(string word) {
+    int n = word.size(), y = -1;
+    vector<int> b(n);
+    REP(i, n) {
+      if (i && word[i] == word[i-1])
+        b[i] = y;
+      else
+        b[i] = y = i-1;
+    }
+    int ans = 0;
+    REP(i, n)
+      if (word[i] == 'u') {
+        int j = b[i]; if (j < 0 || word[j] != 'o') continue;
+        j = b[j]; if (j < 0 || word[j] != 'i') continue;
+        j = b[j]; if (j < 0 || word[j] != 'e') continue;
+        j = b[j]; if (j < 0 || word[j] != 'a') continue;
+        ans = max(ans, i-b[j]);
+      }
+    return ans;
+  }
+};
+

maximum-building-height.cc

@@ -0,0 +1,23 @@
+// Maximum Building Height
+class Solution {
+public:
+  int maxBuilding(int n, vector<vector<int>>& res) {
+    vector<pair<int, int>> a;
+    a.emplace_back(1, 0);
+    for (auto &x: res)
+      a.emplace_back(x[0], x[1]);
+    a.emplace_back(n, n-a.back().first+a.back().second);
+    sort(a.begin(), a.end());
+    int m = a.size(), ans = 0;
+    for (int i = 0; i < m-1; i++) {
+      int d = a[i+1].first-a[i].first;
+      a[i+1].second = min(a[i+1].second, a[i].second+d);
+    }
+    for (int i = m; --i; ) {
+      int d = a[i].first-a[i-1].first;
+      a[i-1].second = min(a[i-1].second, a[i].second+d);
+      ans = max(ans, a[i-1].second+a[i].second+d >> 1);
+    }
+    return ans;
+  }
+};

single-threaded-cpu.rs

@@ -0,0 +1,28 @@
+impl Solution {
+    pub fn get_order(tasks: Vec<Vec<i32>>) -> Vec<i32> {
+        use std::collections::BinaryHeap;
+        use std::cmp::Reverse;
+        let n = tasks.len();
+        let mut tasks: Vec<(i32, i32, usize)> = tasks
+            .into_iter().enumerate().map(|(i,a)| (a[0], a[1], i)).collect();
+        tasks.sort_by_key(|v| v.0);
+
+        let mut q: BinaryHeap<Reverse<(i32, usize)>> = BinaryHeap::new();
+        let mut ans = Vec::new();
+        let mut tick = 0;
+        let mut i = 0;
+        while ans.len() != n {
+            if i < n && tasks[i].0 <= tick {
+                q.push(Reverse((tasks[i].1, tasks[i].2)));
+                i += 1;
+            } else if !q.is_empty() {
+                let x = q.pop().unwrap().0;
+                ans.push(x.1 as i32);
+                tick += x.0;
+            } else {
+                tick = tasks[i].0;
+            }
+        }
+        ans
+    }
+}

sum-of-digits-in-base-k.cc

@@ -0,0 +1,10 @@
+// Sum of Digits in Base K
+class Solution {
+public:
+  int sumBase(int n, int k) {
+    int s = 0;
+    do s += n%k;
+    while (n /= k);
+    return s;
+  }
+};