Weekly Contest 266

Author: MaskRay

count-vowel-substrings-of-a-string.cc

@@ -0,0 +1,23 @@
+// Count Vowel Substrings of a String
+#define FOR(i, a, b) for (long i = (a); i < (b); i++)
+#define REP(i, n) for (long i = 0; i < (n); i++)
+
+class Solution {
+public:
+  int countVowelSubstrings(string a) {
+    int n = a.size(), ans = 0;
+    REP(i, n) {
+      int c = 0;
+      FOR(j, i, n) {
+        if (a[j]=='a') c|=1;
+        else if (a[j]=='e') c|=2;
+        else if (a[j]=='i') c|=4;
+        else if (a[j]=='o') c|=8;
+        else if (a[j]=='u') c|=16;
+        else break;
+        if (c==31) ans++;
+      }
+    }
+    return ans;
+  }
+};

maximum-path-quality-of-a-graph.cc

@@ -0,0 +1,32 @@
+// Maximum Path Quality of a Graph
+using pii = pair<int, int>;
+
+class Solution {
+  vector<vector<pii>> es;
+  vector<int> values, cnt;
+  int ans = 0;
+public:
+  void dfs(int tim, int u, int val) {
+    if (!cnt[u]++)
+      val += values[u];
+    if (u == 0)
+      ans = max(ans, val);
+    for (auto [v, w]: es[u])
+      if (tim >= w)
+        dfs(tim-w, v, val);
+    if (!--cnt[u])
+      val -= values[u];
+  }
+  int maximalPathQuality(vector<int>& values, vector<vector<int>>& edges, int maxTime) {
+    int n = values.size();
+    this->values = move(values);
+    es.resize(n);
+    cnt.resize(n);
+    for (auto &e: edges) {
+      es[e[0]].emplace_back(e[1], e[2]);
+      es[e[1]].emplace_back(e[0], e[2]);
+    }
+    dfs(maxTime, 0, 0);
+    return ans;
+  }
+};

minimized-maximum-of-products-distributed-to-any-store.cc

@@ -0,0 +1,17 @@
+// Minimized Maximum of Products Distributed to Any Store
+#define ALL(x) (x).begin(), (x).end()
+
+class Solution {
+public:
+  int minimizedMaximum(int n, vector<int>& a) {
+    long l = 1, h = *max_element(ALL(a));
+    while (l < h) {
+      long m = l+h >> 1, c = 0;
+      for (long x: a)
+        c += (x+m-1)/m;
+      if (c > n) l = m+1;
+      else h = m;
+    }
+    return l;
+  }
+};

vowels-of-all-substrings.cc

@@ -0,0 +1,11 @@
+// Vowels of All Substrings
+class Solution {
+public:
+  long long countVowels(string a) {
+    long n = a.size(), ans = 0;
+    for (long i = 0; i < n; i++)
+      if (strchr("aeiou", a[i]))
+        ans += (i+1)*(n-i);
+    return ans;
+  }
+};