120.cpp

#include "Jutil.h"
using namespace std;

#define KNRM "\x1B[0m"
#define KRED "\x1B[31m"
#define KGRN "\x1B[32m"

struct Res {
    int sum;
    vector<int> path;
};
class Solution {
   public:
    int minimumTotal(vector<vector<int>>& t) {
        int n = t.size();
        for (int i = n - 2; i >= 0; i--) {
            int m = t[i].size();
            for (int j = 0; j < m; j++) {
                t[i][j] += min(t[i + 1][j], t[i + 1][j + 1]);
            }
        }
        return t[0][0];
    }
    Res minimumTotal2(vector<vector<int>>& t) {
        int n = t.size();
        for (int i = n - 2; i >= 0; i--) {
            for (int j = 0; j <= i; j++) {
                if (t[i + 1][j] > t[i + 1][j + 1]) {
                    t[i][j] += t[i + 1][j + 1];
                    t[i + 1][j] = INT32_MAX;
                } else {
                    t[i][j] += t[i + 1][j];
                    t[i + 1][j] = INT32_MIN;
                }
            }
        }
        vector<int> path(n);
        path[0] = 0;
        int k = 0;
        for (int i = 1; i < n; i++) {
            if (t[i][k] == INT32_MAX) {
                path[i] = ++k;
            } else {
                path[i] = k;
            }
        }
        return {t[0][0], path};
    }
};

int main() {
    string problemName = "120";
    auto begin = jtimer();
    Solution sol;
    ifstream file_in("testcases/" + problemName + "_in.txt");
    ifstream file_out("testcases/" + problemName + "_out.txt");
    bool allPass = true;
    int caseCount = 0;
    int passCount = 0;
    string line_in;
    string line_out;
    while (getline(file_in, line_in)) {
        auto triangle = jread_vector2d(line_in);
        auto res = sol.minimumTotal2(triangle);
        getline(file_out, line_out);
        auto ans = jread_int(line_out);
        printf("Case %d", ++caseCount);
        if (res.sum == ans) {
            passCount++;
            printf(" %s(PASS)", KGRN);
        } else {
            printf(" %s(WRONG)", KRED);
            allPass = false;
        }
        printf("\n%s", KNRM);
        jprint(res.sum, "res.sum");
        jprint(res.path, "res.path");
        jprint(ans, "ans");
        printf("\n");
    }
    if (allPass) {
        printf("%sALL CORRECT [%d/%d]\n%s", KGRN, passCount, caseCount, KNRM);
    } else {
        printf("%sWRONG ANSWER [%d/%d]\n%s", KRED, passCount, caseCount, KNRM);
    }
    auto end = jtimer();
    jprint_time(begin, end);
    return 0;
}