Problem:
Score : 600 points

Problem Statement

We have N strings of lowercase English letters: S_1, S_2, \cdots, S_N.

Takahashi wants to make a string that is a palindrome by choosing one or more of these strings - the same string can be chosen more than once - and concatenating them in some order of his choice.

The cost of using the string S_i once is C_i, and the cost of using it multiple times is C_i multiplied by that number of times.

Find the minimum total cost needed to choose strings so that Takahashi can make a palindrome.

If there is no choice of strings in which he can make a palindrome, print -1.

Constraints

1 \leq N \leq 50

1 \leq |S_i| \leq 20

S_i consists of lowercase English letters.

1 \leq C_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
S_1 C_1
S_2 C_2
:
S_N C_N

Output

Print the minimum total cost needed to choose strings so that Takahashi can make a palindrome, or -1 if there is no such choice.

Sample Input 1

3
ba 3
abc 4
cbaa 5

Sample Output 1

7

We have ba, abc, and cbaa.

For example, we can use ba once and abc once for a cost of 7, then concatenate them in the order abc, ba to make a palindrome.
Also, we can use abc once and cbaa once for a cost of 9, then concatenate them in the order cbaa, abc to make a palindrome.

We cannot make a palindrome for a cost less than 7, so we should print 7.

Sample Input 2

2
abcab 5
cba 3

Sample Output 2

11

We can choose abcab once and cba twice, then concatenate them in the order abcab, cba, cba to make a palindrome for a cost of 11.

Sample Input 3

4
ab 5
cba 3
a 12
ab 10

Sample Output 3

8

We can choose a once, which is already a palindrome, but it is cheaper to concatenate ab and cba.

Sample Input 4

2
abc 1
ab 2

Sample Output 4

-1

We cannot make a palindrome, so we should print -1.

Solution in Java (OpenJDK 11.0.6) (judge verdict: Runtime Error)


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.StringTokenizer;

public class Main {

    private static boolean isPalindrome(String s){
        int i = 0, j = s.length() - 1;
        while (i <= j){
            if(s.charAt(i) != s.charAt(j)) return false;
            i++;
            j--;
        }
        return true;
    }

    private static long calculate(String a, String b, String[] strings, int[] costs, boolean left){
        int len = Math.min(a.length(), b.length());
        int i = 0, j = b.length() - 1;
        while (i <= j && i < len){
            if(a.charAt(i) != b.charAt(j)){
                return Long.MAX_VALUE;
            }
            i++;
            j--;
        }
        if(a.length() == b.length()) return 0;
        if(len != a.length()){
            if(isPalindrome(a.substring(len))){
                return 0;
            }
        }else {
            if(isPalindrome(b.substring(len))){
                return 0;
            }
        }

        long ans = Long.MAX_VALUE;
        for(int c = 0; c < strings.length; c++){
            if(left){
                long temp = calculate(a.substring(len), strings[c], strings, costs, left);
                if(temp != Long.MAX_VALUE) ans = Math.min(ans, temp + costs[c]);
            }else {
                long temp = calculate(strings[c], b.substring(len), strings, costs, left);
                if(temp != Long.MAX_VALUE) ans = Math.min(ans, temp + costs[c]);
            }
        }
        return ans;
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb = new StringBuilder();
        // code goes here
        int n = nextInt(br);
        String[] strings = new String[n];
        int[] costs = new int[n];
        long ans = Long.MAX_VALUE;
        for(int i = 0; i < n; i++){
            StringTokenizer st = new StringTokenizer(br.readLine());
            strings[i] = st.nextToken();
            costs[i] = Integer.parseInt(st.nextToken());
            if(isPalindrome(strings[i])){
                ans = Math.min(ans, costs[i]);
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                if(i == j) continue;
                // string[i] and string[j]
                long temp = calculate(strings[i], strings[j], strings, costs, strings[i].length() > strings[j].length());
                if(temp != Long.MAX_VALUE)
                    ans = Math.min(ans, temp + costs[i] + costs[j]);

                // string[j] and string[i]
                temp = calculate(strings[j], strings[i], strings, costs, strings[j].length() > strings[i].length());
                if(temp != Long.MAX_VALUE)
                    ans = Math.min(ans, temp + costs[i] + costs[j]);
                //System.out.println(i+" "+j+" "+temp);
            }
        }

        if(ans == Long.MAX_VALUE){
            sb.append(-1);
        }else {
            sb.append(ans);
        }

        System.out.print(sb.toString());
    }

    private static int nextInt(BufferedReader br) throws IOException{
        return Integer.parseInt(br.readLine());
    }

    private static int[] nextIntArray(BufferedReader br, int n) throws IOException{
        StringTokenizer st = new StringTokenizer(br.readLine());
        int[] arr = new int[n];
        for(int i = 0; i < n; i++){
            arr[i] = Integer.parseInt(st.nextToken());
        }
        return arr;
    }

    static class Pair<A, B>{
        A first;
        B second;
        public Pair(A first, B second){
            this.first = first;
            this.second = second;
        }
    }
}