Google Code Jam 2009 Qualification Round Problem A. Alien Language

https://code.google.com/codejam/contest/90101/dashboard#s=p0

Problem

After years of study, scientists at Google Labs have discovered an alien language transmitted from a faraway planet. The alien language is very unique in that every word consists of exactly L lowercase letters. Also, there are exactly D words in this language.

Once the dictionary of all the words in the alien language was built, the next breakthrough was to discover that the aliens have been transmitting messages to Earth for the past decade. Unfortunately, these signals are weakened due to the distance between our two planets and some of the words may be misinterpreted. In order to help them decipher these messages, the scientists have asked you to devise an algorithm that will determine the number of possible interpretations for a given pattern.

A pattern consists of exactly L tokens. Each token is either a single lowercase letter (the scientists are very sure that this is the letter) or a group of unique lowercase letters surrounded by parenthesis ( and ). For example: (ab)d(dc) means the first letter is either a or b, the second letter is definitely d and the last letter is either d or c. Therefore, the pattern (ab)d(dc) can stand for either one of these 4 possibilities: add, adc, bdd, bdc.

Input

The first line of input contains 3 integers, L, D and N separated by a space. D lines follow, each containing one word of length L. These are the words that are known to exist in the alien language. N test cases then follow, each on its own line and each consisting of a pattern as described above. You may assume that all known words provided are unique.

Output

For each test case, output

Case #X: K

where X is the test case number, starting from 1, and K indicates how many words in the alien language match the pattern.

Limits

Small dataset

1 ≤ L ≤ 10
1 ≤ D ≤ 25
1 ≤ N ≤ 10

Large dataset

1 ≤ L ≤ 15
1 ≤ D ≤ 5000
1 ≤ N ≤ 500

Sample

Input	Output
3 5 4 abc bca dac dbc cba (ab)(bc)(ca) abc (abc)(abc)(abc) (zyx)bc	Case #1: 2 Case #2: 1 Case #3: 3 Case #4: 0

Solution:

int solve(int L, int D, vector<string>dictionary, string pattern)
{
 
    int matches = ;
 
    for (int di = ; di < dictionary.size(); di++) {
        string dw = dictionary.at(di);
 
        bool bracket = false;
        bool inbracket_match = false;
        bool word_match = true;
        int cci = ;
        for (int i = ; i < pattern.length(); i++) {
            char chr = pattern[i];
            if (chr == '(') {
                bracket = true;
            } else if (chr == ')') {
                bracket = false;
                if (!inbracket_match) {
                    word_match = false;
                    break;
                }
                inbracket_match = false;
                cci++;
            } else {
                if (bracket) {
                    if (dw[cci] == chr) {
                        inbracket_match = true;
                    }
                } else {
                    if (dw[cci] != chr) {
                        word_match = false;
                        break;
                    }
                    cci++;
                }
            }
        }
 
        if (word_match) {
            matches++;
        }
 
    }
 
    return matches;
 
}
 
int main() {
    freopen("in.in", "r", stdin);
    freopen("out.out", "w", stdout);
 
    int L, D;
    scanf("%d\n", &L);
    scanf("%d\n", &D);
 
    int CN;
    scanf("%d\n", &CN);
    if (!CN) {
        cerr << "Check input!" << endl;
        exit();
    }
 
    vector<string> dict;
    for (int di = ; di < D; di++) {
        char *word = new char[L];
        scanf("%s\n", word);
        string strword = string(word, L);
        dict.push_back(strword);
    }
 
    for (int case_i = ; case_i <= CN; case_i++) {
        string pattern;
        cin >> pattern;
 
        auto result = solve(L, D, dict, pattern);
        printf("Case #%d: %d\n", case_i, result);
    }
 
    fclose(stdin);
    fclose(stdout);
    return ;
}