POJ 2895

#include <iostream>
#include <string>
#define MAXN 27
using namespace std;

short map[MAXN];
short cul[MAXN];

int main()
{
    //freopen("acm.acm","r",stdin);
    int test;
    int time;
    int wait;
    string s;
    map[0] = 1;
    map[1] = 1;
    map[2] = 1;

    map[3] = 2;
    map[4] = 2;
    map[5] = 2;

    map[6] = 3;
    map[7] = 3;
    map[8] = 3;

    map[9] = 4;
    map[10] = 4;
    map[11] = 4;

    map[12] = 5;
    map[13] = 5;
    map[14] = 5;

    map[15] = 6;
    map[16] = 6;
    map[17] = 6;
    map[18] = 6;

    map[19] = 7;
    map[20] = 7;
    map[21] = 7;

    map[22] = 8;
    map[23] = 8;
    map[24] = 8;
    map[25] = 8;

//    cul[0] = 1;
    cul[1] = 1;
    cul[2] = 2;
    cul[3] = 3;

    cul[4] = 1;
    cul[5] = 2;
    cul[6] = 3;

    cul[7] = 1;
    cul[8] = 2;
    cul[9] = 3;

    cul[10] = 1;
    cul[11] = 2;
    cul[12] = 3;

    cul[13] = 1;
    cul[14] = 2;
    cul[15] = 3;

    cul[16] = 1;
    cul[17] = 2;
    cul[18] = 3;
    cul[19] = 4;

    cul[20] = 1;
    cul[21] = 2;
    cul[22] = 3;

    cul[23] = 1;
    cul[24] = 2;
    cul[25] = 3;
    cul[26] = 4;
    cin>>test;
    while(test --)
    {
        cin>>time>>wait;
        getchar();
        getline(cin,s);
    //    cout<<s<<endl;
        int sum = 0;
        int i;
        for(i = 0; i < s.length(); ++ i)
        {
            if(s[i] == ' ')
            {
                sum += time;
            }
            else if(i != 0 && map[s[i-1] - 'A'] != ' ' && map[s[i]-'A'] == map[s[i-1]-'A'])
            {
                sum += wait;
                sum += cul[s[i]-'A'+1]*time;
            }
            else
            {
                sum += cul[s[i]-'A'+1]*time;
            }
        }
        cout<<sum<<endl;
    }
}