BOJ 2037 - 문자메시지 [C++]

문제

링크

풀이

#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
 
unordered_map<char, int> a = {
  {' ', 1}, {'A', 1}, {'B', 2}, {'C', 3}, {'D', 1}, {'E', 2},
  {'F', 3}, {'G', 1}, {'H', 2}, {'I', 3}, {'J', 1}, {'K', 2},
  {'L', 3}, {'M', 1}, {'N', 2}, {'O', 3}, {'P', 1}, {'Q', 2},
  {'R', 3}, {'S', 4}, {'T', 1}, {'U', 2}, {'V', 3}, {'W', 1},
  {'X', 2}, {'Y', 3}, {'Z', 4}
};
 
unordered_map<char, int> b = {
  {' ', 1}, {'A', 2}, {'B', 2}, {'C', 2}, {'D', 3}, {'E', 3},
  {'F', 3}, {'G', 4}, {'H', 4}, {'I', 4}, {'J', 5}, {'K', 5},
  {'L', 5}, {'M', 6}, {'N', 6}, {'O', 6}, {'P', 7}, {'Q', 7},
  {'R', 7}, {'S', 7}, {'T', 8}, {'U', 8}, {'V', 8}, {'W', 9},
  {'X', 9}, {'Y', 9}, {'Z', 9}
};
 
void solve(void) {
  int p, w; cin >> p >> w;
  cin.ignore();
  string s; getline(cin, s);
 
  int ans = a[s[0]] * p;
  for (int i=1; i<s.length(); i++) {
    ans += a[s[i]] * p;
    if (s[i] == ' ') continue;
    if (b[s[i-1]] == b[s[i]]) ans += w;
  }
  cout << ans;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}