PAT A1160 Good in C (20分)

When your interviewer asks you to write “Hello World” using C, can you do as the following figure shows?

Input Specification:

Each input file contains one test case. For each case, the first part gives the 26 capital English letters A-Z, each in a 7×5 matrix of C's and .'s. Then a sentence is given in a line, ended by a return. The sentence is formed by several words (no more than 10 continuous capital English letters each), and the words are separated by any characters other than capital English letters.

It is guaranteed that there is at least one word given.

Output Specification:

For each word, print the matrix form of each of its letters in a line, and the letters must be separated by exactly one column of space. There must be no extra space at the beginning or the end of the word.

Between two adjacent words, there must be a single empty line to separate them. There must be no extra line at the beginning or the end of the output.

Sample Input:

..C..
.C.C.
C...C
CCCCC
C...C
C...C
C...C
CCCC.
C...C
C...C
CCCC.
C...C
C...C
CCCC.
.CCC.
C...C
C....
C....
C....
C...C
.CCC.
CCCC.
C...C
C...C
C...C
C...C
C...C
CCCC.
CCCCC
C....
C....
CCCC.
C....
C....
CCCCC
CCCCC
C....
C....
CCCC.
C....
C....
C....
CCCC.
C...C
C....
C.CCC
C...C
C...C
CCCC.
C...C
C...C
C...C
CCCCC
C...C
C...C
C...C
CCCCC
..C..
..C..
..C..
..C..
..C..
CCCCC
CCCCC
....C
....C
....C
....C
C...C
.CCC.
C...C
C..C.
C.C..
CC...
C.C..
C..C.
C...C
C....
C....
C....
C....
C....
C....
CCCCC
C...C
C...C
CC.CC
C.C.C
C...C
C...C
C...C
C...C
C...C
CC..C
C.C.C
C..CC
C...C
C...C
.CCC.
C...C
C...C
C...C
C...C
C...C
.CCC.
CCCC.
C...C
C...C
CCCC.
C....
C....
C....
.CCC.
C...C
C...C
C...C
C.C.C
C..CC
.CCC.
CCCC.
C...C
CCCC.
CC...
C.C..
C..C.
C...C
.CCC.
C...C
C....
.CCC.
....C
C...C
.CCC.
CCCCC
..C..
..C..
..C..
..C..
..C..
..C..
C...C
C...C
C...C
C...C
C...C
C...C
.CCC.
C...C
C...C
C...C
C...C
C...C
.C.C.
..C..
C...C
C...C
C...C
C.C.C
CC.CC
C...C
C...C
C...C
C...C
.C.C.
..C..
.C.C.
C...C
C...C
C...C
C...C
.C.C.
..C..
..C..
..C..
..C..
CCCCC
....C
...C.
..C..
.C...
C....
CCCCC
HELLO~WORLD!

Sample Output:

C...C CCCCC C.... C.... .CCC.
C...C C.... C.... C.... C...C
C...C C.... C.... C.... C...C
CCCCC CCCC. C.... C.... C...C
C...C C.... C.... C.... C...C
C...C C.... C.... C.... C...C
C...C CCCCC CCCCC CCCCC .CCC.

C...C .CCC. CCCC. C.... CCCC.
C...C C...C C...C C.... C...C
C...C C...C CCCC. C.... C...C
C.C.C C...C CC... C.... C...C
CC.CC C...C C.C.. C.... C...C
C...C C...C C..C. C.... C...C
C...C .CCC. C...C CCCCC CCCC.

• 思路：散列，将A-Z用一个map对应为各矩阵：用vector<string> 存储

分词：双指针（滑动窗口），每次取[left, right)之间的word，left越界要提前break,否则会将一个空字符串push进ans

TIPS1: 注意合法字符的定义
TIPS2: 开头一段是否合法，如____WORD
TIPS3: 结尾一段是否合法，如WORD_____
TIPS4：words之间可能不止一个非法字符，不能直接left = right ++;

• code:

#include <bits/stdc++.h>
using namespace std;

unordered_map<char, vector<string> > mp;
void Print(string s)
{
    for(int i = 0; i < 7; ++i)
    {
        for(int j = 0; j < s.size(); ++j)
        {
            cout << mp[s[j]][i];
            if(j < s.size() - 1) printf(" ");
        }
        if(i < 6)
            printf("\n");
    }
}
int main()
{
    for(int i = 0; i < 26; ++i)
    {
        char tmp = 'A' + i;
        for(int j = 0; j < 7; ++j)
        {
                string s;
                cin >> s;
                mp[tmp].push_back(s);
        }
    }
    string s;
    vector<string> ans;
    getchar();
    getline(cin, s);
    int left = 0, right;
    while(left < s.size())
    {
        while(left < s.size() && !isupper(s[left])) left++;
        if(left >= s.size()) break;
        right = left + 1;
        while(right < s.size() && isupper(s[right])) right++;
        string sub = s.substr(left, right - left);
        ans.push_back(sub);
        left = right;
    }
    for(int i = 0; i < ans.size(); ++i)
    {
        Print(ans[i]);
        if(i < ans.size() - 1) printf("\n\n");
    }
    return 0;
}
/*
case2,3:
   HELLO !!!
*/