feat: new problem formatted

rod-cutting/src/TLE.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+vector<int> bestCut;
+
+int solve(int n, vector<int> &prices)
+{
+    if (n == 0) return 0;
+
+    bestCut[n] = n;
+    int currentMax = prices[n];
+    for (int i = n / 2; i >= 1; i--)
+    {
+        int bestForRemaining = solve(n - i, prices);
+        if (currentMax < prices[i] + bestForRemaining)
+        {
+            currentMax = prices[i] + bestForRemaining;
+            bestCut[n] = i;
+        }
+    }
+    return currentMax;
+}
+
+int main()
+{
+    int n;
+    cin >> n;
+    bestCut.resize(n + 1);
+    bestCut[0] = -1;
+    vector<int> prices(n + 1);
+    for (int i = 1; i <= n; i++)
+    {
+        cin >> prices[i];
+    }
+
+    auto s = solve(n, prices);
+    cout << s << endl;
+    int size = n;
+    while (size != 0)
+    {
+        if (size != n) cout << " ";
+        cout << bestCut[size];
+        size = size - bestCut[size];
+    }
+    cout << endl;
+
+    return 0;
+}

rod-cutting/src/ac.cpp

@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+vector<int> bestCut;
+int memo[1001];
+
+int solve(int n, vector<int> &prices)
+{
+   if (n == 0)
+      return 0;
+   if (memo[n] != -1)
+      return memo[n];
+
+   bestCut[n] = n;
+   int currentMax = prices[n];
+   for (int i = n / 2; i >= 1; i--)
+   {
+      int bestForRemaining = solve(n - i, prices);
+      if (currentMax < prices[i] + bestForRemaining)
+      {
+         currentMax = prices[i] + bestForRemaining;
+         bestCut[n] = i;
+      }
+   }
+   return memo[n] = currentMax;
+}
+
+int main()
+{
+   int n;
+   cin >> n;
+   bestCut.resize(n + 1);
+   vector<int> prices(n + 1);
+   memset(memo, -1, sizeof(memo));
+   for (int i = 1; i <= n; i++)
+   {
+      cin >> prices[i];
+   }
+
+   auto s = solve(n, prices);
+   cout << s << endl;
+   int size = n;
+   while (size != 0)
+   {
+      if (size != n)
+         cout << " ";
+      cout << bestCut[size];
+      size = size - bestCut[size];
+   }
+   cout << endl;
+
+   return 0;
+}

rod-cutting/src/checker.cpp

@@ -0,0 +1,42 @@
+#include "testlib.h"
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int readAns(InStream &stream, vector<int> &prices, int size) {
+    int revenue = stream.readInt();
+    vector<int> pieces;
+    int totalSize = 0, totalPrice = 0;
+    while (!stream.seekEof()) {
+        pieces.push_back(stream.readInt(1, size));
+        totalSize += pieces.back();
+        totalPrice += prices[pieces.back()];
+    }
+
+    quitif(totalSize != size, _wa, "Pieces sizes dont add up to the given piece size");
+    quitif(totalPrice != revenue, _wa, "Pieces prices dont add up to the revenue given");
+
+    return revenue;
+}
+
+int main(int argc, char* argv[]) {
+    setName("compare two signed int%d's", 8 * int(sizeof(int)));
+    registerTestlibCmd(argc, argv);
+
+    int n = inf.readInt();
+    vector<int> prices(n + 1);
+    for (int i = 1; i <= n; i++) {
+        prices[i] = inf.readInt();
+    }
+
+    int ja = readAns(ans, prices, n);
+    int pa = readAns(ouf, prices, n);
+
+    if (ja > pa)
+        quitf(_wa, "Expected (%i) found (%i)", ja, pa);
+
+    if (ja < pa)
+        quitf(_fail, "Participant gave a better answer. PA - (%i), JA - (%i)", pa, ja);
+
+    quitf(_ok, "OK");
+}

rod-cutting/src/generator.cpp

@@ -0,0 +1,125 @@
+#include "testlib.h"
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int MIN_N = 1;
+const int MAX_N = 1e3;
+const int MIN_NI = 1;
+const int MAX_NI = 1e4;
+
+const int rnd_test_n = 40;
+
+template <typename T>
+void append(vector<T> &dest, const vector<T> &orig)
+{
+    dest.insert(dest.end(), orig.begin(), orig.end());
+}
+
+string output_tc(const vector<int> &nums)
+{
+    ostringstream oss;
+    oss << nums.size() << endl;
+    for (int i = 0; i < nums.size(); i++)
+    {
+        if (i != 0)
+            oss << " ";
+        oss << nums[i];
+    }
+    oss << endl;
+    return oss.str();
+}
+
+vector<string> generate_sample_tests()
+{
+    vector<string> tests;
+    tests.push_back(output_tc({1, 5, 8, 9, 10, 17, 17, 20}));
+    tests.push_back(output_tc({1, 2, 3, 5}));
+    tests.push_back(output_tc({3, 5, 8, 9, 10, 17, 17, 20}));
+    return tests;
+}
+
+vector<string> generate_manual_tests()
+{
+    vector<string> tests;
+    tests.push_back(output_tc({MIN_NI, MIN_NI, MIN_NI, MIN_NI}));
+    return tests;
+}
+
+string rnd_test(int i)
+{
+    int min_n = MIN_N;
+    int max_n = MAX_N;
+
+    if (i < rnd_test_n / 3)
+    {
+        max_n = MAX_N / 3;
+    }
+    else if (i < rnd_test_n / 2)
+    {
+        max_n = MAX_N / 2;
+    }
+
+    int n = rnd.next(min_n, max_n);
+    vector<int> nums(n);
+    for (int i = 0; i < n; i++)
+    {
+        nums[i] = rnd.next(MIN_NI, MAX_NI);
+    }
+    return (output_tc(nums));
+}
+
+vector<string> generate_random_tests()
+{
+    vector<string> tests;
+    for (int i = 0; i < rnd_test_n; i++)
+    {
+        tests.push_back(rnd_test(i));
+    }
+    return tests;
+}
+
+string extreme_test_1()
+{
+    vector<int> nums(MAX_N);
+    for (int i = 0; i < MAX_N; i++)
+    {
+        nums[i] = MIN_NI;
+    }
+    return (output_tc(nums));
+}
+
+string extreme_test_2()
+{
+    vector<int> nums(MAX_N);
+    for (int i = 0; i < MAX_N; i++)
+    {
+        nums[i] = MAX_NI;
+    }
+    return (output_tc(nums));
+}
+
+vector<string> generate_extreme_tests()
+{
+    vector<string> tests;
+    tests.push_back(extreme_test_1());
+    tests.push_back(extreme_test_2());
+    return tests;
+}
+
+int main(int argc, char *argv[])
+{
+    registerGen(argc, argv, 1);
+    vector<string> tests;
+    size_t test = 0;
+    append(tests, generate_sample_tests());
+    append(tests, generate_manual_tests());
+    append(tests, generate_random_tests());
+    append(tests, generate_extreme_tests());
+    for (const auto &t : tests)
+    {
+        startTest(++test);
+        cout << t;
+    }
+    return 0;
+}

rod-cutting/src/script.sh

@@ -0,0 +1 @@
+generator

rod-cutting/src/validator.cpp

@@ -0,0 +1,18 @@
+#include "testlib.h"
+#include <bits/stdc++.h>
+
+using namespace std;
+
+
+int main(int argc, char* argv[]) {
+    registerValidation(argc, argv);
+    int n = inf.readInt(1, 1000);
+    inf.readEoln();
+    for (int i = 0; i < n; i++) {
+        if (i != 0) inf.readSpace();
+        inf.readInt(1, 10000);
+    }
+    inf.readEoln();
+    inf.readEof();
+    return 0;
+}