第八届福建省大学生程序设计竞赛-重现赛I Magic

Problem I Magic

Accept: 24    Submit: 157
Time Limit: 2000 mSec    Memory Limit : 262144 KB

Problem Description

Kim is a magician, he can use n kinds of magic, number from 1 to n. We use string Si to describe magic i. Magic Si will make Wi points of damage. Note that Wi may change over time.

Kim obey the following rules to use magic:

Each turn, he picks out one magic, suppose that is magic Sk, then Kim will use all the magic i satisfying the following condition:

1. Wi<=Wk

2. Sk is a suffix of Si.

Now Kim wondering how many magic will he use each turn.

Note that all the strings are considered as a suffix of itself.

Input

First line the number of test case T. (T<=6)

For each case, first line an integer n (1<=n<=1000) stand for the number of magic.

Next n lines, each line a string Si (Length of Si<=1000) and an integer Wi (1<=Wi<=1000), stand for magic i and it’s damage Wi.

Next line an integer Q (1<=Q<=80000), stand for there are Q operations. There are two kinds of operation.

“1 x y” means Wx is changed to y.

“2 x” means Kim has picked out magic x, and you should tell him how many magic he will use in this turn.

Note that different Si can be the same.

Output

For each query, output the answer.

Sample Input

15abracadabra 2adbra 1bra 3abr 3br 252 32 51 2 52 32 2

Sample Output

3121

给出许多魔法的名称，再给出相应的魔力值，有2种操作，一种是把某个魔法的魔力值变成y，还有一种操作是选出一个魔法释放，并释放比它魔力值小并且以之为名称后缀的魔法，这题只需要按题意来，但是如果每次去寻找魔法并且检测是否为后缀，那一定会超时，所以需要用一个二维数组来记录i是否是j的后缀，这样极端情况下比较后缀的情况每两个单词直接就最多只有1次了。