Hard problem

題目敘述

Vasiliy is fond of solving different tasks. Today he found one he wasn't able to solve himself, so he asks you to help.

Vasiliy is given n strings consisting of lowercase English letters. He wants them to be sorted in lexicographical order (as in the dictionary), but he is not allowed to swap any of them. The only operation he is allowed to do is to reverse any of them (first character becomes last, second becomes one before last and so on).

To reverse the i-th string Vasiliy has to spent ci units of energy. He is interested in the minimum amount of energy he has to spent in order to have strings sorted in lexicographical order.

String $A$ is lexicographically smaller than string $B$ if it is shorter than $B (|A| < |B|)$ and is its prefix, or if none of them is a prefix of the other and at the first position where they differ character in $A$ is smaller than the character in $B$.

For the purpose of this problem, two equal strings nearby do not break the condition of sequence being sorted lexicographically.

輸入說明

The first line of the input contains a single integer $n (2\leq n\leq 100000)$ — the number of strings.

The second line contains $n$ integers $c_i (0\leq c_i\leq 10^9)$, the i-th of them is equal to the amount of energy Vasiliy has to spent in order to reverse the i-th string.

Then follow n lines, each containing a string consisting of lowercase English letters. The total length of these strings doesn't exceed $100000$.

輸出說明

If it is impossible to reverse some of the strings such that they will be located in lexicographical order, print $-1$. Otherwise, print the minimum total amount of energy Vasiliy has to spent.

範例輸入1

2
1 2
ba
ac

範例輸出1

範例輸入2

3
1 3 1
aa
ba
ac

範例輸出2

範例輸入3

2
5 5
bbb
aaa

範例輸出3

-1

範例輸入4

2
3 3
aaa
aa

範例輸出4

-1

Note

In the second sample one has to reverse string $2$ or string $3$. To amount of energy required to reverse the string $3$ is smaller.

In the third sample, both strings do not change after reverse and they go in the wrong order, so the answer is $-1$.

In the fourth sample, both strings consists of characters 'a' only, but in the sorted order string "aa" should go before string "aaa", thus the answer is $-1$.

Source

Codeforces Round #367 (Div. 2) C.Hard problem

Judge Setting

run-time limit: 1000 ms
memory limit: 2621440 byte
測資數量: 0