前缀和STL CF 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 x_a, x_b, ..., x_z ( - 10⁵ ≤ x_i ≤ 10⁵) — the value assigned to lettersa, b, c, ..., z respectively.

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

Output

Print the answer to the problem.

Sample test(s)

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.

题目大意是 在第二行的字符串里面 找到满足两种条件的子串，并求出子串的个数
条件1：第一行分别对应26个字母代表的价值，要求这些子串(长度大于1)除去首尾，然后加上剩余字母的价值必须为0
条件2：子串的首字符必须和尾字符相等

注意：数据的处理
思路： 先把前缀和求出来 然后 统计dp[word[i]-'a'][sum[i]] (在前i个字母里 以第i个字母表示的字符结尾的前缀和为sum[i]的数量) 每次 ans加上 dp[word[i]-'a'][sum[i-1]],  dp[word[i]-'a'][sum[i]]再自己增加1
 //
// Create by 神舟 on 2015-02-28
//

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <cctype>
#include <stack>
#include <queue>
#include <map>
#include <string>
#include <set>
#include <vector>
using namespace std;

#define CLR(x) memset(x,0,sizeof x)
#define ll long long
const int inf=0x3f3f3f3f;
const int maxn=1e5+5;
const int MOD=5e5+5;
map <ll, ll> dp[30];
ll sum[maxn];
ll a[27], ans = 0;
char word[maxn];
int main()
{
#ifdef LOCAL
 freopen("in.txt","r",stdin);
 //freopen("out.txt","w",stdout);
#endif
 ios_base::sync_with_stdio(0);

    for(int i = 0; i < 26; scanf("%I64d", a + i++));
    scanf("%s", word + 1);
    int len = strlen(word + 1);
    for(int i = 1; i <= len; i++) i[sum] = sum[i-1] + a[word[i] - 'a'];//求出前缀和
    for(int i = 1; i <= len; i++){
        ans += dp[word[i]-'a'][sum[i-1]];//构造子串
        dp[word[i] - 'a'][sum[i]]++;
    }
    printf("%I64d\n", ans);
 return 0;
}
一开始wa了大数据，才反应该用ll 不过输入的时候必须对号入座