Codeforces Round #294 (Div. 2) -- D. A and B and Interesting Substrings 【hash】

Description

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, …, z respectively.
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.

Example

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.

思路：先给出26个字母的权值，再给出一个字符串，然后找出 有多少个这样的子串：满足头和尾字母相同且中间字符的权值和为0
具体解释在代码注释中有详细介绍

下面放ac代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <functional>
#include <map>
#include <set>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//满足头和尾相同且中间字符的权值和为0
const int maxn = 1e5+10;
int val[30];
char a[maxn];
map<ll, int> mp[26];
        //每一个不同的字母对应不同的前缀和都有映射的次数
//只要找到该位置之前有多少个和这个位置有相同的字母, 且权值相同的位置，
//用map进行映射，表示到第i个字母的时候，取得的和为j的个数有多少个
int main()
{
    for(int i = 0; i < 26; i++)
        scanf("%d", &val[i]);
    scanf("%s", a);
    int len = strlen(a);
    ll ans = 0, sum = 0;
    for(int i = 0; i < len; i++)
    {
        ans += mp[a[i] - 'a'][sum]; //第一维度用来判断首位字母是否相同，第二维度表示 用sum[i]表示
        //前i个字母的权值和(前缀和)，容易发现一个合法的对<i,j>，一定是sum[i]=sum[j-1]，这是显然的
        sum += val[a[i] - 'a'];     //前缀和
        mp[a[i] - 'a'][sum]++;      //对不同字母的不同前缀和进行映射
    }
    printf("%lld\n", ans);
    return 0;
}

此题代码简单，但是思路比较难。。。