feat: new statement files. Generator generated. New TLE solution

longest-common-subsequence/src/TLE.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int solve(string &s1, string &s2, int i = 0, int j = 0)
+{
+    if (i == s1.size() || j == s2.size())
+        return 0;
+
+    if (s1[i] == s2[j])
+    {
+        return (solve(s1, s2, i + 1, j + 1) + 1);
+    }
+    return max(solve(s1, s2, i, j + 1), solve(s1, s2, i + 1, j));
+}
+
+int main()
+{
+    int n, m;
+    cin >> n >> m;
+    string s1, s2;
+    cin >> s1 >> s2;
+
+    cout << solve(s1, s2) << endl;
+
+    return 0;
+}

longest-common-subsequence/src/ac.cpp

@@ -16,6 +16,7 @@ int solve(string &s1, string &s2, int i = 0, int j = 0)
 }
 
 int main(){
+   int n, m; cin >> n >> m;
    string s1, s2; cin >> s1 >> s2;
    memset(memo, -1, sizeof(memo));
 

longest-common-subsequence/src/generator.cpp

@@ -14,6 +14,7 @@ template <typename T> void append(vector<T> &dest, const vector<T> &orig) {
 
 string output_tc(const string &x, const string &y) {
 	ostringstream oss;
+    oss << x.size() << " " << y.size() << endl;
     oss << x << " " << y << endl;
 	return oss.str();
 }

longest-common-subsequence/src/validator.cpp

@@ -6,9 +6,13 @@ using namespace std;
 
 int main(int argc, char* argv[]) {
     registerValidation(argc, argv);
-    inf.readToken("[a-z]{1, 1000}", "s1");
+    int n = inf.readInt(1, 1000, "n");
     inf.readSpace();
-    inf.readToken("[a-z]{1, 1000}", "s2");
+    int m = inf.readInt(1, 1000, "m");
+    inf.readEoln();
+    inf.readToken("[a-z]{" + to_string(n) + "}", "s1");
+    inf.readSpace();
+    inf.readToken("[a-z]{" + to_string(m) + "}", "s2");
     inf.readEoln();
     inf.readEof();
     return 0;