contest(weekly-contest-276): add solutions

Signed-off-by: Matej Focko <mfocko@redhat.com>
2024-11-09 15:59:06 +01:00 · 2022-01-19 21:08:27 +01:00 · 2022-01-19 21:08:27 +01:00 · 5d50c507d8
commit 5d50c507d8
parent 9fa39e8873
4 changed files with 196 additions and 0 deletions
--- a/contest/weekly-contest-276/divide-a-string-into-groups-of-size-k.cpp
+++ b/contest/weekly-contest-276/divide-a-string-into-groups-of-size-k.cpp
@ -0,0 +1,23 @@
+#include <string>
+#include <vector>
+
+using std::string;
+using std::vector;
+
+class Solution {
+  public:
+    vector<string> divideString(string s, int k, char fill) {
+        vector<string> result;
+
+        for (int i = 0; i < s.size(); i += k) {
+            result.push_back(s.substr(i, k));
+        }
+
+        auto size_of_last = result.back().size();
+        if (size_of_last < k) {
+            result.back().append(k - size_of_last, fill);
+        }
+
+        return result;
+    }
+};
--- a/contest/weekly-contest-276/maximum-running-time-of-n-computers.cpp
+++ b/contest/weekly-contest-276/maximum-running-time-of-n-computers.cpp
@ -0,0 +1,89 @@
+#include <algorithm>
+#include <cassert>
+#include <numeric>
+#include <vector>
+
+using std::vector;
+
+class Solution {
+  public:
+    long long maxRunTime(int n, vector<int> &batteries) {
+        vector<int> bats{batteries};
+
+        std::sort(bats.begin(), bats.end());
+        long long total = std::accumulate(bats.begin(), bats.end(), 0L);
+
+        long long k;
+        for (k = 0; bats.back() > total / (n - k); k++) {
+            total -= bats.back();
+            bats.pop_back();
+        }
+        return total / (n - k);
+    }
+};
+
+int main() {
+    Solution s;
+    vector<int> batteries;
+
+    batteries = {3, 3, 3};
+    assert(s.maxRunTime(2, batteries) == 4);
+
+    batteries = {1, 1, 1, 1};
+    assert(s.maxRunTime(2, batteries) == 2);
+
+    batteries = {10, 10, 3, 5};
+    assert(s.maxRunTime(3, batteries) == 8);
+
+    batteries = {
+        6251, 4133, 9898, 1536, 5475, 6340, 7430, 4413, 2558, 3941, 6934, 7326,
+        7948, 7736, 1408, 5752, 836,  4511, 7684, 3939, 1376, 2305, 2090, 8419,
+        3813, 4430, 890,  4120, 3415, 9706, 879,  158,  2239, 5462, 5773, 5285,
+        5540, 305,  2211, 691,  4335, 5912, 3542, 5229, 996,  2609, 2173, 87,
+        5683, 2946, 1456, 9590, 3625, 1807, 6909, 1328, 1548, 8182, 1690, 7440,
+        8310, 8502, 320,  2654, 2254, 1306, 7696, 7187, 3977, 3270, 2989, 1629,
+        5725, 7937, 5317, 9763, 9238, 3712, 1925, 2,    1463, 6309, 4997, 7786,
+        1811, 7579, 3290, 8355, 63,   5010, 3574, 5364, 748,  1877, 106,  1735,
+        7809, 5060, 9677, 4831, 1524, 9663, 6557, 9399, 5976, 801,  8800, 4297,
+        9636, 4828, 3972, 6946, 6170, 9984, 5710, 3318, 4156, 7838, 6856, 2866,
+        5900, 4623, 5228, 8063, 2514, 9149, 3509, 4033, 854,  2884, 7160, 8195,
+        1936, 8134, 4277, 9442, 5263, 555,  5515, 2341, 2820, 3095, 2974, 7648,
+        9116, 6886, 8545, 4055, 2398, 2425, 4861, 2114, 9280, 5045, 3678, 6569,
+        7948, 1912, 7856, 6831, 4286, 1645, 9654, 5552, 880,  1864, 6386, 6616,
+        3961, 7427, 8649, 2323, 8084, 7334, 8256, 6187, 2244, 9738, 6869, 5888,
+        3862, 886,  1419, 2067, 15,   428,  4732, 2098, 7710, 5586, 1972, 5388,
+        5171, 9239, 4810, 2461, 3639, 8120, 5296, 9522, 3475, 5703, 2358, 1957,
+        9823, 6561, 3690, 1856, 8202, 1343, 1868, 5851, 3177, 7036, 4901, 4891,
+        4640, 5927, 7610, 9204, 3538, 7508, 411,  3814, 7545, 7094, 6841, 3125,
+        2884, 2205, 8271, 9920, 2322, 20,   8850, 1747, 3317, 2873, 558,  7201,
+        6688, 9097, 9399, 2096, 5846, 9502, 5028, 2907, 1667, 4049, 5810, 5850,
+        4628, 4511, 2415, 1194, 6477, 9198, 6645, 1281, 3920, 7117, 3301, 1892,
+        4402, 8180, 2915, 3548, 211,  5855, 2190, 6552, 5992, 7280, 1291, 4064,
+        6139, 9585, 6729, 3481, 5274, 2498, 9484, 3486, 863,  1913, 2921, 4733,
+        544,  62,   5139, 4408, 6174, 9175, 1119, 7858, 6215, 2901, 4862, 4020,
+        7371, 2778, 3086, 6559, 9187, 7591, 6007, 8762, 3577, 8984, 6653, 4975,
+        3939, 1385, 4076, 6350, 3248, 3102, 8331, 194,  9552, 409,  1527, 6387,
+        8477, 5410, 3223, 1168, 6578, 4004, 3442, 1767, 5979, 8644, 4893, 8495,
+        5152, 5450, 2221, 7171, 8308, 6288, 8536, 5671, 6642, 6999, 4134, 5572,
+        3639, 884,  9915, 7104, 8288, 994,  9765, 9467, 627,  2549, 2237, 713,
+        9487, 9727, 569,  5755, 2975, 5248, 894,  3083, 7820, 7696, 4780, 952,
+        9787, 6791, 1939, 682,  2917, 6001, 1781, 2712, 5098, 2002, 5641, 9202,
+        7651, 4817, 7685, 3900, 8720, 7808, 8628, 2196, 4155, 3357, 7890, 1361,
+        7537, 6157, 7107, 2972, 5548, 2297, 9888, 6257, 2596, 9319, 850,  2181,
+        2284, 6877, 9344, 1177, 2238, 5140, 6476, 6289, 2673, 3266, 5291, 3098,
+        541,  81,   8251, 8235, 8118, 8717, 2289, 4159, 2926, 478,  9137, 3921,
+        2591, 669,  8164, 6245, 5742, 6076, 3839, 4243, 4656, 2448, 1168, 4481,
+        3734, 2909, 4499, 1479, 4204, 3693, 5440, 2921, 4044, 9615, 7430, 2716,
+        7520, 3354, 3683, 6058, 4212, 4940, 5645, 5101, 9339, 2422, 3201, 813,
+        2753, 8796, 5485, 1080, 4433, 3875, 831,  33,   1689, 6643, 5753, 7352,
+        1670, 2525, 3606, 34,   5768, 5256, 531,  427,  4931, 8174, 8413, 6014,
+        3464, 3793, 6932, 3943, 7916, 3954, 1452, 4165, 4047, 2844, 9685, 6882,
+        9535, 4995, 7836, 5296, 1140, 2403, 7723, 4388, 4791, 4967, 3788, 3694,
+        9258, 370,  7174, 8340, 9182, 7522, 7852, 242,  1429, 5904, 7794, 7736,
+        2421, 3885, 819,  3136, 8815, 5737, 2043, 6398, 9528, 9011, 5056, 7761,
+        6120, 9561, 6053, 8264, 1648, 4598, 3448, 2563, 4717, 9078, 5032, 1163,
+        7788, 2227, 4478, 4172};
+    assert(s.maxRunTime(13, batteries) == 207113);
+
+    return 0;
+}
--- a/contest/weekly-contest-276/minimum-moves-to-reach-target-score.cpp
+++ b/contest/weekly-contest-276/minimum-moves-to-reach-target-score.cpp
@ -0,0 +1,33 @@
+#include <cassert>
+
+class Solution {
+  public:
+    int minMoves(int target, int maxDoubles) {
+        int moves;
+        for (moves = 0; target > 1 && maxDoubles > 0; moves++) {
+            if (target % 2 == 0) {
+                maxDoubles--;
+                target /= 2;
+            } else {
+                target--;
+            }
+        }
+
+        // remaining increments
+        moves += target - 1;
+
+        return moves;
+    }
+};
+
+int main() {
+    Solution s;
+
+    assert(s.minMoves(5, 0) == 4);
+    assert(s.minMoves(19, 2) == 7);
+    assert(s.minMoves(10, 4) == 4);
+    assert(s.minMoves(766972377, 92));
+    assert(s.minMoves(1000000000, 5));
+
+    return 0;
+}
--- a/contest/weekly-contest-276/solving-questions-with-brainpower.cpp
+++ b/contest/weekly-contest-276/solving-questions-with-brainpower.cpp
@ -0,0 +1,51 @@
+#include <cassert>
+#include <functional>
+#include <vector>
+
+using std::vector;
+
+class Solution {
+    struct Question {
+        long long answered;
+        long long skipped;
+
+        long long get() const { return std::max(answered, skipped); }
+    };
+
+    long long getWithOffset(vector<Question> &questions, int offset) {
+        auto i = questions.size() - offset - 1;
+        if (i < 0 || i >= questions.size()) {
+            return 0;
+        }
+
+        return questions[i].get();
+    }
+
+  public:
+    long long mostPoints(vector<vector<int>> &questions) {
+        vector<Question> stack;
+
+        std::for_each(questions.rbegin(), questions.rend(), [&](auto &q_in) {
+            Question q;
+            q.answered = q_in[0] + getWithOffset(stack, q_in[1]);
+            q.skipped = getWithOffset(stack, 0);
+
+            stack.push_back(q);
+        });
+
+        return stack.back().get();
+    }
+};
+
+int main() {
+    Solution s;
+    vector<vector<int>> questions;
+
+    questions = {{3, 2}, {4, 3}, {4, 4}, {2, 5}};
+    assert(s.mostPoints(questions) == 5);
+
+    questions = {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {5, 5}};
+    assert(s.mostPoints(questions) == 7);
+
+    return 0;
+}