At each step, we try all activities not equal to last and recursively calculate the total points.

We store intermediate results in a 2D vector dp to avoid recalculating them.

Code

#include <bits/stdc++.h>
using namespace std;

// Recursive function to calculate the maximum points for the ninja training
int f(int day, int last, vector<vector<int>> &points, vector<vector<int>> &dp) {
    // If the result for this day and last activity is already calculated, return it
    if (dp[day][last] != -1) return dp[day][last];

    // Base case: When we reach the first day (day == 0)
    if (day == 0) {
        int maxi = 0;
        // Calculate the maximum points for the first day by choosing an activity
        // different from the last one
        for (int i = 0; i <= 2; i++) {
            if (i != last)
                maxi = max(maxi, points[0][i]);
        }
        // Store the result in dp array and return it
        return dp[day][last] = maxi;
    }

    int maxi = 0;
    // Iterate through the activities for the current day
    for (int i = 0; i <= 2; i++) {
        if (i != last) {
            // Calculate the po