Codeforces Round #294 (Div. 2) D. A and B and Interesting Substrings(map)

最新推荐文章于 2022-11-22 23:15:14 发布

一种坚持__

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量371

点赞数

分类专栏： Codeforces

本文链接：https://blog.csdn.net/u014361775/article/details/44024227

版权

Codeforces 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

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.

   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.

先给出26个数字，即a~z的对应值，问给出的字符串中有多少个子串首尾字符相同，且除了首尾字母后，子串字母和为0

暴是暴不过去的，可以用map[s][sum]来存下首字母为s,和为sum（找到下一个相同字母s后，和仍然为sum，即说明中间所有子母和为0）的子串数量，一次循环即可出结果

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <queue>
#include <map>
#define N 100001
using namespace std;
int a[30];
char s[N];
map<long long int ,int >q[30];
int main()
{
    while(~scanf("%d",&a[0]))
    {
        for(int i=1; i<26; i++)
            scanf("%d",&a[i]);
        scanf("%s",s);
        long long int ans=0,sum=0;
        int len=strlen(s);
        for(int i=0; i<len; i++)
        {
            ans+=q[s[i]-'a'][sum];
            sum+=a[s[i]-'a'];
            q[s[i]-'a'][sum]++;
        }
       printf("%I64d\n",ans);
    }
    return 0;
}