POJ 2895

开发者悦嘉技术 2022年11月21日

0 收藏 971 点赞 2,669 浏览 835 个字

 #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[] = ;
     map[] = ;
     map[] = ;     map[] = ;
     map[] = ;
     map[] = ;     map[] = ;
     map[] = ;
     map[] = ;     map[] = ;
     map[] = ;
     map[] = ;     map[] = ;
     map[] = ;
     map[] = ;     map[] = ;
     map[] = ;
     map[] = ;
     map[] = ;     map[] = ;
     map[] = ;
     map[] = ;     map[] = ;
     map[] = ;
     map[] = ;
     map[] = ; //    cul[0] = 1;
     cul[] = ;
     cul[] = ;
     cul[] = ;     cul[] = ;
     cul[] = ;
     cul[] = ;     cul[] = ;
     cul[] = ;
     cul[] = ;     cul[] = ;
     cul[] = ;
     cul[] = ;     cul[] = ;
     cul[] = ;
     cul[] = ;     cul[] = ;
     cul[] = ;
     cul[] = ;
     cul[] = ;     cul[] = ;
     cul[] = ;
     cul[] = ;     cul[] = ;
     cul[] = ;
     cul[] = ;
     cul[] = ;
     cin>>test;
     while(test --)
     {
         cin>>time>>wait;
         getchar();
         getline(cin,s);
     //    cout<<s<<endl;
         int sum = ;
         int i;
         for(i = ; i < s.length(); ++ i)
         {
             if(s[i] == ' ')
             {
                 sum += time;
             }
             else if(i !=  && map[s[i-] - 'A'] != ' ' && map[s[i]-'A'] == map[s[i-]-'A'])
             {
                 sum += wait;
                 sum += cul[s[i]-'A'+]*time;
             }
             else
             {
                 sum += cul[s[i]-'A'+]*time;
             }
         }
         cout<<sum<<endl;
     }
 }