CF - 519D. A and B and Interesting Substrings - 前缀和思维+map

1.题目描述：

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, ..., 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.

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.

2.题意概述：

给定每个字母的权值（一共只有26个小写英文字母的组合单词），以及一个字符串，找出这个字符串的子字符串中的满足

1. 除去第一个和最后一个字母中间权值加起来和为0的。

2. 第一个字母和最后一个字母相同的。

输出这样的字符串有几个。

3.解题思路：

若(a'..a)(开区间)区间和为0 则前缀(a-1)-前缀a'==0，p-p'=0 p'=p p'个数为:记录之前以字符id结尾前缀和为的p个数即可。

4.AC代码：

#include <bits/stdc++.h>
#define INF 0x7fffffff
#define maxn 1001000
#define eps 1e-6
#define pi acos(-1.0)
#define e 2.718281828459
#define mod (int)1e9 + 7;
using namespace std;
typedef long long ll;
map<ll, int> mp[26];
int a[26];
char ch[maxn];
int main()
{
#ifndef ONLINE_JUDGE
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
  long _begin_time = clock();
#endif
  for (int i = 0; i < 26; i++)
    scanf("%d", &a[i]);
  scanf("%s", ch);
  int len = strlen(ch);
  ll ans = 0, cnt = 0;
  for (int i = 0; i < len; i++)
  {
    int b = ch[i] - 'a';
    ans += mp[b][cnt];
    cnt += a[b];
    mp[b][cnt]++;
  }
  printf("%lld\n", ans);
#ifndef ONLINE_JUDGE
  long _end_time = clock();
  printf("time = %ld ms", _end_time - _begin_time);
#endif
  return 0;
}