Your computer has a keyboard with three keys: 'a' key, Shift key, and Caps Lock key. The Caps Lock key has a light on it. Initially, the light on the Caps Lock key is off, and the screen shows an empty string. You can do the following three actions any number of times in any order: Spend X milliseconds to press only the 'a' key. If the light on the Caps Lock key is off, a is appended to the string on the screen; if it is on, A is. Spend Y milliseconds to press the 'a' key and Shift key simultaneously. If the light on the Caps Lock key is off, A is appended to the string on the screen; if it is on, a is. Spend Z milliseconds to press the Caps Lock key. If the light on the Caps Lock key is off, it turns on; if it is on, it turns off. Given a string S consisting of A and a, determine at least how many milliseconds you need to spend to make the string shown on the screen equal to S.c++代码

Here's a possible C++ implementation of the algorithm I described earlier:

#include <iostream>
#include <string>

using namespace std;

int main() {
    int X, Y, Z;
    string S;

    // read input
    cin >> X >> Y >> Z >> S;

    int time = 0;
    bool capsLockOn = false;
    string output = "";

    for (char c : S) {
        if (c == 'a') {
            if (capsLockOn) {
                output += 'A';
                time += Y;
            } else {
                output += 'a';
                time += X;
            }
        } else {
            if (capsLockOn) {
                output += 'a';
                time += Y;
            } else {
                output += 'A';
                time += X;
            }
        }
        capsLockOn = !capsLockOn;
    }

    // add time to toggle Caps Lock for each character
    time += Z * S.length();

    cout << time << endl;

    return 0;
}

Note that this implementation assumes valid input and does not perform any error checking or input validation.