Minimize Time to Type a String Using a Limited Keyboard

This problem explores the optimization of typing a string using a restricted keyboard with only three keys: 'a', Shift, and Caps Lock. The challenge lies in determining the minimal time required to achieve the desired string while considering the toggling behavior of the Caps Lock key.

Problem Statement:

You have a computer keyboard equipped with three keys: 'a', Shift, and Caps Lock. Initially, the Caps Lock light is off, and the screen displays an empty string. You can perform the following actions any number of times in any order:

Press 'a': Spend X milliseconds. If Caps Lock is off, append 'a' to the screen; if Caps Lock is on, append 'A'.
Press 'a' and Shift: Spend Y milliseconds. If Caps Lock is off, append 'A' to the screen; if Caps Lock is on, append 'a'.
Press Caps Lock: Spend Z milliseconds. Toggle the Caps Lock light (off to on, or on to off).

Given a string S composed of 'A' and 'a', determine the minimum number of milliseconds required to display the string S on the screen.

Solution:

The provided C++ code implements a solution to this problem. It iterates through each character of the target string S, calculating the time needed to type each character based on the current state of the Caps Lock key. The code also optimizes for scenarios where toggling Caps Lock (using Z milliseconds) might be faster than using a specific key combination (X or Y).

C++ Code:

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int X, Y, Z;
    string S;
    cin >> X >> Y >> Z >> S;
    int len = S.length();
    int ans = 0;
    bool capsLock = false;
    for(int i = 0; i < len; i++) {
        if(S[i] == 'a') {
            if(capsLock) ans += Y;
            else ans += X;
        } else {
            if(capsLock) ans += X;
            else ans += Y;
        }
        capsLock = !capsLock;
    }
    if(Z < X && Z < Y) {
        if(capsLock) ans += Z + X;
        else ans += Z;
    }
    cout << ans << endl;
    return 0;
}

This code efficiently calculates the minimum time required to type the string S by intelligently handling the Caps Lock state and minimizing the total time spent. It's a straightforward yet effective solution to the problem.

Minimize Time to Type a String Using a Limited Keyboard