标题: Code Jam Qualification Round -A [打印本页] 作者: yizhonglee 时间: 2009-09-04 13:04 标题: Code Jam Qualification Round -A
Alien Language
In the practice contest, you may try as many times as you want.
Small input
10 points
Download A-small.inMore options ▼SubmitYour submission was received. You can still resubmit for minutes.
Only your last submission counts.Time Remaining:Input: A-small-practice.in.your output file:source file(s): removeAdd another filesource file(s): not needed for the practice contest Large input
23 points
Download A-large.inMore options ▼SubmitYour submission was received. You can still resubmit for minutes.
Only your last submission counts.Time Remaining: You may resubmit this multiple times within the remaining
time-frame. Only your last submission will count.your output file:source file(s): removeAdd another filesource file(s): not needed for the practice contest
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
inputstr="""3 5 4
abc
bca
dac
dbc
cba
(ab)(bc)(ca)
abc
(abc)(abc)(abc)
(zyx)bc"""
FileIn=open("A-large.in","r")
content=FileIn.read()
content=content.split('\n')
print content[0]
line=content[0].split(' ')
wordLen=int(line[0])
caseCounter=int(line[1])
patternCounter=int(line[2])
index=1
caseList=[]
for i in range(caseCounter):
caseList.append(content[index])
index=index+1
patternList=[]
for j in range(patternCounter):
pattern=[]
line=content[index]
k=0
while(klen(line)):
tmpPattern=[]
if(line[k]=='('):
while(line[k]!=')'):
tmpPattern.append(line[k])
k=k+1
k=k+1
else:
tmpPattern.append(line[k])
k=k+1
pattern.append(tmpPattern)
"""
line=content[index]
line=line.split('(')
pattern=[]
for k in range(len(line)):
if(line[k]==''):
pass
else:
if(line[k].endswith(')')):
tmpPattern=[]
for v in range(len(line[k])):
if(line[k][v]==')'):
continue
else:
tmpPattern.append(line[k][v])
pattern.append(tmpPattern)
else:
for v in range(len(line[k])):
tmpPattern=[]
tmpPattern.append(line[k][v])
pattern.append(tmpPattern)
