COCI '07 Contest 5 #6 Baza

View as PDF

Submit solution

Points: 25
Time limit: 1.0s
Memory limit: 32M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

The longest common prefix of two words is the longest word that both words start with. For example, the longest common prefix of the words "identity" and "idealistic" is the word "ide".

A database contains N words.

The algorithm to search for a query word W in the database is primitive. It compares the word W one by one with each word in the database. Two words are compared letter by letter until a letter in which they differ is found or until the end of one of the words is reached (it is then established either that the words are equal or that one is longer than the other). When the algorithm finds the word W in the database, it terminates.

Analysing the algorithm shows that the number of steps needed to find a word W is equal to the number of words W is compared to, plus the sum of the lengths of the longest common prefixes of W and each of the words it was compared to.

Write a program that calculates the number of steps the algorithm uses to find each of the Q query words.

Input Specification

The first line contains an integer N (1 \le N \le 30\,000), the number of words in the database.

Each of the following N lines contains a single word from the database. The words are given in the order the algorithm compares them to a query word. All words in the database will be distinct.

The following line contains an integer Q (1 \le Q \le 30\,000), the number of words searched for.

Each of the following Q lines contains a single query word.

All words in the input will be strings of less than 30 lowercase letters of the English alphabet.

Output Specification

Output one integer per line for each query word, the number of steps the algorithm uses when searching for the word.

Sample Input 1

5
hobotnica
robot
hobi
hobit
robi
4
robi
hobi
hobit
rakija

Sample Output 1

12
10
16
7

Sample Input 2

8
majmunica
majmun
majka
malina
malinska
malo
maleni
malesnica
3
krampus
malnar
majmun

Sample Output 2

8
29
14

In the second example, the number of steps to search for the word "krampus" is 8 because the algorithm only needs to compare its first letter to each word in the database.

When searching for the word "malnar", we need three steps for each of the first three words, and four steps for each of the remaining five words, for a total of 29 steps.

To find the word "majmun" we use a total of 14 steps. For the first word in the database, we have six successful comparisons and one step in which we determine that the word "majmunica" is longer than the query word. For the second word, we also have six successful comparisons and a final step in which it is established that the words are equal. After finding the word, the algorithm terminates with great joy.


Comments

There are no comments at the moment.