Add a lot more of my solutions.

I don't remember which ones doesn't pass though

CSES Problem Set/Grid Path Description.cpp

@@ -0,0 +1,145 @@
+/* Problem URL: https://cses.fi/problemset/task/1625 */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+char a[49];
+bool frame[7][7];
+
+int func(int i, int j, int pos)
+{
+    if (pos >= 48) {
+        return (i == 6 && j == 0);
+    }
+
+    if (i == 6 && j == 0) {
+        return 0;
+    }
+
+    if ((i == 0 || frame[i - 1][j]) && (i == 6 || frame[i + 1][j]) && (j != 0 && !frame[i][j - 1]) && (j != 6 && !frame[i][j + 1])) {
+        return 0;
+    }
+
+    if ((j == 0 || frame[i][j - 1]) && (j == 6 || frame[i][j + 1]) && (i != 0 && !frame[i - 1][j]) && (i != 6 && !frame[i + 1][j])) {
+        return 0;
+    }
+
+    frame[i][j] = true;
+
+    if (a[pos] == '?') {
+        int add[][4] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
+        int ans = 0;
+
+        repv(k, add) {
+            int id = i + k[0];
+            int jd = j + k[1];
+            
+            if (id >= 0 && id < 7 && jd >= 0 && jd < 7 && !frame[id][jd]) {
+                ans += func(id, jd, pos + 1);
+            }
+        }
+
+        frame[i][j] = false;
+        return ans;
+    }
+
+    int id = i;
+    int jd = j;
+    switch (a[pos]) {
+    case 'U':
+        id--;
+        break;
+    case 'D':
+        id++;
+        break;
+    case 'L':
+        jd--;
+        break;
+    case 'R':
+        jd++;
+    }
+
+    int ans = 0;
+    if (id >= 0 && id < 7 && jd >= 0 && jd < 7 && !frame[id][jd]) {
+        ans = func(id, jd, pos + 1);
+    }
+
+    frame[i][j] = false;
+    return ans;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    scanf("%s", a);
+
+    printf("%d\n", func(0, 0, 0));
+}