long maximumSweetness(vector<int> redCandies, vector<int> blueCandies, vector<int> greenCandies) {
    long long res = 0;
    int last = 0;

    int n = redCandies.size();

    for (int i = 0; i < n; i++) {
        if (last == 0) {
            if (redCandies[i] >= blueCandies[i] && redCandies[i] >= greenCandies[i]) {
                res += redCandies[i];
                last = 1;
            } else if (blueCandies[i] >= redCandies[i] && blueCandies[i] >= greenCandies[i]) {
                res += blueCandies[i];
                last = 2;
            } else if (greenCandies[i] >= redCandies[i] && greenCandies[i] >= blueCandies[i]) {
                res += greenCandies[i];
                last = 3;
            }
        } else if (last == 1) {
            if (blueCandies[i] >= redCandies[i] && blueCandies[i] >= greenCandies[i]) {
                res += blueCandies[i];
                last = 2;
            } else if (greenCandies[i] >= redCandies[i] && greenCandies[i] >= blueCandies[i]) {
                res += greenCandies[i];
                last = 3;
            }
        } else if (last == 2) {
            if (redCandies[i] >= blueCandies[i] && redCandies[i] >= greenCandies[i]) {
                res += redCandies[i];
                last = 1;
            } else if (greenCandies[i] >= redCandies[i] && greenCandies[i] >= blueCandies[i]) {
                res += greenCandies[i];
                last = 3;
            }
        } else if (last == 3) {
            if (redCandies[i] >= blueCandies[i] && redCandies[i] >= greenCandies[i]) {
                res += redCandies[i];
                last = 1;
            } else if (blueCandies[i] >= redCandies[i] && blueCandies[i] >= greenCandies[i]) {
                res += blueCandies[i];
                last = 2;
            }
        }
    }

    return res;
}