Code Jam - Alien Language Solution

Posted on Tuesday, April 27, 2010 by Anuj Mehta

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

3 5 4
abc
bca
dac
dbc
cba
(ab)(bc)(ca)
abc
(abc)(abc)(abc)
(zyx)bc


Output
Case #1: 2
Case #2: 1
Case #3: 3
Case #4: 0



My Solution


import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

/**
*
* @author anuj.mehta
*
*/
public class AlienLanguage {

public static void main(String[] args) {
try {
BufferedReader br = new BufferedReader(new FileReader("Test.txt"));
String[] arr = br.readLine().split(" ");
int numOfWords = Integer.parseInt(arr[1]);
int numOfPatterns = Integer.parseInt(arr[2]);

List wordList = new ArrayList();
for(int i =0; i < numOfWords; i++)
wordList.add(br.readLine());

List patternList = new ArrayList();
for(int i =0; i < numOfPatterns; i++)
patternList.add(Pattern.compile( br.readLine().replace('(', '[').replace(')', ']')));
int index = 0;
for(Pattern p : patternList)
{
index++;
int count = 0;
for(String word : wordList)
{
Matcher m = p.matcher(word);
if(m.matches())
count++;
}
System.out.println("Case " + index + ": " + count);
}
} catch (FileNotFoundException e) {
e.printStackTrace();
} catch (IOException e) {
e.printStackTrace();
}
}
}

1 comments:

Christian Harms says:

Thanx for linking - your java solution looks simular to my python sniplet.