【codeforces 519 D】【hash+dp】【给出一个字符串，给出每个字母的权值，求字符串的子串中首尾相等，除去首尾字母的权值和为0的数量。】

传送门：http://codeforces.com/contest/519/problem/D

题意：给出一个字符串，给出每个字母的权值，求字符串的子串中首尾相等，除去首尾字母的权值和为0的数量。

思路：

从前到后扫描字符串，计算前缀和，每次将前缀和Hash,然后每次查询与当前位字母相同的前缀和 前缀的数量，间接地计算出字符串的数量。

代码：

#include <bits/stdc++.h>
using  namespace  std;

#define ll __int64
const int N=1e5+10;
typedef std::map<ll, ll> mp;
mp dp[27];

int a[27];
char s[N];

int  main(){
    for(int i=0; i<26; i++)scanf("%d", &a[i]);
    scanf("%s", s);
    int n=strlen(s);
    ll ans=0, sum=0;
    for(int i=0; i<n; i++){
        int now=s[i]-'a';
        ans+=dp[now][sum];
        sum+=a[now];
        dp[now][sum]++;
    }    
    printf("%lld\n", ans);
    return 0;
}

D. A and B and Interesting Substrings

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A and B are preparing themselves for programming contests.

After several years of doing sports programming and solving many problems that require calculating all sorts of abstract objects, A and B also developed rather peculiar tastes.

A likes lowercase letters of the Latin alphabet. He has assigned to each letter a number that shows how much he likes that letter (he has assigned negative numbers to the letters he dislikes).

B likes substrings. He especially likes the ones that start and end with the same letter (their length must exceed one).

Also, A and B have a string s. Now they are trying to find out how many substrings t of a string s are interesting to B (that is, t starts and ends with the same letter and its length is larger than one), and also the sum of values of all letters (assigned by A), except for the first and the last one is equal to zero.

Naturally, A and B have quickly found the number of substrings t that are interesting to them. Can you do it?

Input

The first line contains 26 integers xa, xb, ..., xz ( - 105 ≤ xi ≤ 105) — the value assigned to letters a, b, c, ..., zrespectively.

The second line contains string s of length between 1 and 105 characters, consisting of Lating lowercase letters— the string for which you need to calculate the answer.

Output

Print the answer to the problem.

Examples

input

1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1
xabcab

output

2

input

1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 7 1 1 1 8 1 1 1 1 1 1
aaa

output

2

Note

In the first sample test strings satisfying the condition above are abca and bcab.

In the second sample test strings satisfying the condition above are two occurences of aa.