text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> mp[30];
long long arr[30];
char s[100010];
int main() {
for (long long i = 0; i < 26; i++) {
scanf("%I64d", &arr[i]);
}
scanf("%s", s);
long long len = strlen(s);
long long sum = 0;
long long ans = 0;
for (long long i = 0; i < len; i++) {
long long pos = s[i] - 'a';
if (mp[pos].find(sum) != mp[pos].end()) {
ans += mp[pos][sum];
}
sum += arr[pos];
mp[pos][sum]++;
}
printf("%I64d\n", ans);
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long N = 3e5;
long long arr[26], n, pref[N], ans;
string a;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
for (int i = 0; i < 26; i++) cin >> arr[i];
cin >> a;
n = a.size();
map<pair<long long, char>, long long> b;
for (int i = 0; i < n - 1; i++) {
pref[i] = arr[a[i] - 'a'];
if (i == 0) {
b[{pref[i], a[i]}]++;
continue;
}
if (a[i] == a[i - 1]) ans++;
pref[i] += pref[i - 1];
pair<long long, char> k = {pref[i], a[i + 1]};
ans += b[k];
b[{pref[i], a[i]}]++;
}
cout << ans + (a[n - 1] == a[n - 2]);
}
|
#include <bits/stdc++.h>
using namespace std;
long long score[26];
string s;
map<long long, long long> mp[26];
int MAIN() {
for (int i = 0; i < 26; ++i) {
cin >> score[i];
}
cin >> s;
int sz = s.length();
long long sum = 0;
long long tot = 0;
for (int i = 0; i < sz; ++i) {
int c = s[i] - 'a';
if (mp[c].find(sum) != mp[c].end()) {
tot += mp[c][sum];
}
sum += score[c];
if (mp[c].find(sum) != mp[c].end()) {
long long t = mp[c][sum];
t++;
mp[c].erase(sum);
mp[c].insert(make_pair(sum, t));
} else {
mp[c].insert(make_pair(sum, 1));
}
}
cout << tot << endl;
return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(16);
int ret = MAIN();
return ret;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, MOD = 1e9 + 7;
long long c, ans, x[26];
string s;
map<pair<char, long long>, long long> m;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
for (int i = 0; i < 26; i++) cin >> x[i];
cin >> s;
for (int i = 0; i < s.length(); i++) {
ans += m[{s[i], c - x[s[i] - 'a']}];
m[{s[i], c}]++;
c += x[s[i] - 'a'];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
map<long long, int> mp[26];
char s[maxn];
int val[30];
int main() {
for (int i = 0; i < 26; i++) scanf("%d", &val[i]);
scanf("%s", s);
int len = strlen(s);
long long sum = 0;
long long ans = 0;
for (int i = 0; i < len; i++) {
ans += mp[s[i] - 'a'][sum];
sum += val[s[i] - 'a'];
mp[s[i] - 'a'][sum]++;
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
char a;
long long v;
};
long long a[30], ans, sum;
char s[100005];
map<pair<char, long long>, long long> mp;
int main() {
for (int i = 0; i < 26; i++) scanf("%lld", &a[i]);
scanf("%s", s);
int n = strlen(s);
for (int i = 0; i < n; i++) {
ans += mp[make_pair(s[i], sum)];
sum += a[s[i] - 'a'];
mp[make_pair(s[i], sum)]++;
}
printf("%lld", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void read_file(bool outToFile = true) {}
long long val[100000 + 9];
long long sum[100000 + 9];
int A[26 + 9];
int n;
string s;
vector<vector<int> > G;
map<long long, int> mp;
int main() {
read_file(true);
while (cin >> A[0]) {
for (int i = 1; i < 26; i++) cin >> A[i];
cin >> s;
n = s.length();
G.assign(26, vector<int>());
for (int i = 0; i < n; i++) {
G[s[i] - 'a'].push_back(i);
val[i] = 0;
}
sum[0] = A[s[0] - 'a'];
for (int i = 1; i < n; i++) sum[i] = sum[i - 1] + A[s[i] - 'a'];
long long ans = 0;
for (int x = 0; x < 26; x++) {
mp.clear();
int sz = G[x].size();
for (int i = 0; i < sz; i++) {
int u = G[x][i];
ans += mp[sum[u - 1]];
mp[sum[u]]++;
}
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
const int inf = 0x3f3f3f3f, Inf = 0x7fffffff;
const long long INF = 0x7ffffffffffffff;
const double eps = 1e-8;
unsigned int seed = 19260817;
__inline__ __attribute__((always_inline)) unsigned int Rand() {
return seed = seed * 998244353u + 1000000007u;
}
template <typename _Tp>
_Tp gcd(const _Tp &a, const _Tp &b) {
return (!b) ? a : gcd(b, a % b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) {
return a > 0 ? a : -a;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b) {
return a < b ? b : a;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b) {
return a < b ? a : b;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void chmax(_Tp &a, const _Tp &b) {
(a < b) && (a = b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void chmin(_Tp &a, const _Tp &b) {
(a > b) && (a = b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) bool _cmp(const double &a,
const double &b) {
return abs(a - b) <= eps;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void read(_Tp &x) {
register char ch(getchar());
bool f(false);
while (ch < 48 || ch > 57) f |= ch == 45, ch = getchar();
x = ch & 15, ch = getchar();
while (ch >= 48 && ch <= 57)
x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar();
if (f) x = -x;
}
template <typename _Tp, typename... Args>
__inline__ __attribute__((always_inline)) void read(_Tp &t, Args &...args) {
read(t);
read(args...);
}
__inline__ __attribute__((always_inline)) int read_str(char *s) {
register char ch(getchar());
while (ch < 65 || ch > 122 || (ch > 90 && ch < 97)) ch = getchar();
register char *tar = s;
*tar = ch, ch = getchar();
while ((ch >= 65 && ch <= 90) || (ch >= 97 && ch <= 122))
*(++tar) = ch, ch = getchar();
return tar - s + 1;
}
const int N = 100005;
int a[26];
long long sum[N], c[N];
char s[N];
struct node {
long long sum;
char ch;
__inline__ __attribute__((always_inline)) bool operator<(
const node &o) const {
return sum == o.sum ? ch < o.ch : sum < o.sum;
}
};
std::map<node, int> mp;
int main() {
for (int i = 0; i < 26; ++i) read(a[i]);
int n = read_str(s + 1);
for (int i = 1; i <= n; ++i) {
c[i] = a[s[i] - 97];
sum[i] = sum[i - 1] + c[i];
}
long long ans = 0;
for (int i = 1; i <= n; ++i) {
if (mp.find((node){sum[i - 1], s[i]}) != mp.end()) {
ans += mp[(node){sum[i - 1], s[i]}];
}
++mp[(node){sum[i], s[i]}];
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << " " << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
const long long N = 100005;
const long long mod = 1e9 + 7;
long long mx = -1e18, mn = 1e18;
void inp_out() {}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
inp_out();
{
long long i, j, k, n, m, ans = 0, cnt = 0, sum = 0;
long long val[26];
for (i = 0; i < 26; i++) {
cin >> val[i];
}
string s;
cin >> s;
n = s.size();
long long pre[n + 1];
pre[0] = 0;
vector<vector<long long> > chpos(26);
for (i = 0; i < n; i++) {
pre[i + 1] = pre[i] + val[s[i] - 'a'];
chpos[s[i] - 'a'].push_back(i);
}
for (i = 0; i < 26; i++) {
m = chpos[i].size();
if (m <= 1) {
continue;
}
map<long long, long long> mp;
mp[pre[chpos[i][0] + 1]]++;
for (j = 1; j < m; j++) {
ans += mp[pre[chpos[i][j]]];
mp[pre[chpos[i][j] + 1]]++;
}
}
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[26];
map<long long, long long> M[26];
long long ans = 0, sum = 0;
for (int i = 0; i < 26; i++) cin >> a[i];
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
ans += M[s[i] - 'a'][sum];
sum += a[s[i] - 'a'];
M[s[i] - 'a'][sum]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
const double inf = 1e20;
using namespace std;
int a[26];
long long sum[111111];
map<int, vector<int> > mp;
long long ans;
int main() {
for (int i = 0; i < 26; i++) cin >> a[i];
string s;
cin >> s;
for (int i = 0; i < (int)s.size(); i++) {
mp[(int)s[i] - 'a'].push_back(i);
if (!i)
sum[i] = a[s[i] - 'a'];
else
sum[i] = sum[i - 1] + a[s[i] - 'a'];
}
for (int i = 0; i < 26; i++) {
map<long long, long long> m;
for (int j = 0; j < mp[i].size(); j++) {
ans = ans + m[sum[mp[i][j] - 1]];
m[sum[mp[i][j]]]++;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
const int INF = 100000000;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
int cost[26];
long long sum[100005];
string s;
int main() {
for (int i = 0; i < (26); i++) {
int x;
cin >> x;
cost[i] = x;
}
cin >> s;
for (int i = 0; i < (s.size()); i++) {
sum[i + 1] += sum[i] + cost[s[i] - 'a'];
}
long long ans = 0;
for (int i = 0; i < (26); i++) {
map<long long, int> m;
for (int j = 0; j < (s.size()); j++)
if (s[j] == i + 'a') {
ans += m[sum[j]];
m[sum[j + 1]]++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, a[30], pref[100007];
string s;
map<pair<long long, char>, long long> prefs;
void solve() {
for (long long let = 0; let < (26); ++let) cin >> a[let];
cin >> s;
n = ((long long)(s).size());
s = '#' + s;
long long rst = 0;
pref[1] = a[s[1] - 'a'];
++prefs[make_pair(pref[1], s[1])];
for (long long i = 2; i <= n; ++i) {
pref[i] = pref[i - 1] + a[s[i] - 'a'];
rst += prefs[make_pair(pref[i - 1], s[i])];
++prefs[make_pair(pref[i], s[i])];
}
cout << rst;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 100005;
int n, a[300];
char s[NMAX];
map<pair<int, long long>, int> M;
long long sol;
int main() {
int i;
long long sum = 0;
cin.sync_with_stdio(false);
for (i = 1; i <= 26; i++) cin >> a[i];
cin >> (s + 1);
n = strlen(s + 1);
for (i = 1; i <= n; i++) {
if (i > 1) {
M[make_pair(s[i] - 'a' + 1, sum)] += 0;
sol += M[make_pair(s[i] - 'a' + 1, sum)];
}
sum += a[s[i] - 'a' + 1];
M[make_pair(s[i] - 'a' + 1, sum)] += 0;
M[make_pair(s[i] - 'a' + 1, sum)]++;
}
cout << sol << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void output(long long x) {
if (x < 0) putchar('-'), x = -x;
if (x == 0) {
putchar('0');
return;
}
int a[20], num = 0;
while (x) a[++num] = x % 10, x /= 10;
while (num > 0) putchar('0' + a[num--]);
}
inline long long myInt() {
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
int flag = 1;
if (c == '-') flag = -1, c = getchar();
long long x = 0;
while (isdigit(c)) {
x = (x * 10) + (c - '0');
c = getchar();
}
if (-1 == flag) return -x;
return x;
}
const int mod = 10000009;
const int N = 100005;
int a[30];
char s[N];
int n;
map<long long, int> mp;
long long cal(char t) {
mp.clear();
long long pre = 0;
long long ans = 0;
for (int i = 1; i <= n; i++) {
pre += a[s[i] - 'a'];
if (s[i] == t) {
long long tmp = pre - a[t - 'a'];
if (mp.count(tmp)) ans += mp[tmp];
mp[pre]++;
}
}
return ans;
}
int main() {
for (int i = 0; i < 26; i++) a[i] = myInt();
scanf("%s", s + 1);
n = strlen(s + 1);
long long ans = 0;
for (char i = 'a'; i <= 'z'; i++) {
ans += cal(i);
}
output(ans);
puts("");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
long long x[27], ans = 0, tmp = 0, pre[100010] = {0};
vector<long long> vect[27];
for (int i = 0; i < 26; i++) {
cin >> x[i];
}
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
vect[s[i] - 'a'].push_back(i);
pre[i] = (i > 0 ? pre[i - 1] + x[s[i] - 'a'] : x[s[i] - 'a']);
}
map<long long, long long> mp;
for (int i = 0; i <= 25; i++) {
mp.clear();
for (int j = 0; j < vect[i].size(); j++) {
ans += (mp[pre[vect[i][j] - 1]]);
mp[pre[vect[i][j]]]++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<pair<long long int, char>, int> cnt;
int n;
int like[26];
long long int sum[100010];
char str[100010];
int main() {
for (int i = 0; i < 26; i++) scanf("%d", &like[i]);
scanf("%s", str);
n = strlen(str);
sum[0] = like[str[0] - 'a'];
for (int i = 1; i < n; i++) sum[i] = sum[i - 1] + like[str[i] - 'a'];
long long int ans = 0;
for (int i = n - 1; i >= 0; i--) {
ans += cnt[pair<long long int, char>(sum[i] + like[str[i] - 'a'], str[i])];
cnt[pair<long long int, char>(sum[i], str[i])]++;
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int i, a[26], ans = 0, tot = 0;
string s;
map<pair<long long int, long long int>, long long int> mp;
for (i = 0; i < 26; i++) cin >> a[i];
cin >> s;
for (i = 0; i < s.length(); i++) {
ans += mp[{s[i] - 'a', tot}];
tot += a[s[i] - 'a'];
mp[{s[i] - 'a', tot}]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
namespace ZDY {
#pragma GCC optimize(3)
template <class T>
__inline__ __attribute__((always_inline)) T ABS(T x) {
return x > 0 ? x : -x;
}
template <class T>
__inline__ __attribute__((always_inline)) T MAX(T x, T y) {
return x > y ? x : y;
}
template <class T>
__inline__ __attribute__((always_inline)) T MIN(T x, T y) {
return x < y ? x : y;
}
template <class T>
__inline__ __attribute__((always_inline)) T GCD(T x, T y) {
return y ? GCD(y, x % y) : x;
}
template <class T>
__inline__ __attribute__((always_inline)) void SWAP(T& x, T& y) {
T t = x;
x = y;
y = t;
}
} // namespace ZDY
using namespace ZDY;
using namespace std;
namespace IO {
const char* ln = "\n";
const int str = 1 << 20;
struct IN {
char buf[str], *s, *t;
bool _;
IN() : s(buf), t(buf), _(0) {}
__inline__ __attribute__((always_inline)) char gc() {
return s == t && ((t = (s = buf) + fread(buf, 1, str, stdin)) == s)
? EOF
: (*s++);
}
IN& operator>>(char& ch) {
if (_) return *this;
char c;
while ((c = gc()) != EOF && isspace(c))
;
if (c == EOF)
_ = 1;
else
ch = c;
return *this;
}
IN& operator>>(char* ch) {
memset(ch, 0, sizeof(ch));
if (_) return *this;
char c;
while ((c = gc()) != EOF && isspace(c))
;
if (c == EOF) return _ = 1, *this;
*ch = c;
ch++;
while ((c = gc()) != EOF && !isspace(c)) *ch = c, ch++;
if (c == EOF) _ = 1;
return *this;
}
IN& operator>>(string& ch) {
if (_) return *this;
char c;
while ((c = gc()) != EOF && isspace(c))
;
if (c == EOF) return _ = 1, *this;
ch += c;
while ((c = gc()) != EOF && !isspace(c)) ch += c;
if (c == EOF) _ = 1;
return *this;
}
template <typename T>
IN& operator>>(T& x) {
if (_) return *this;
char c = gc();
bool ff = 0;
while (c != EOF && (c < '0' || c > '9')) ff ^= (c == '-'), c = gc();
if (c == EOF) {
_ = 1;
return *this;
}
x = 0;
while (c != EOF && '0' <= c && c <= '9')
x = (x << 3) + (x << 1) + c - 48, c = gc();
if (c == EOF) _ = 1;
if (ff) x = -x;
return *this;
}
} in;
struct OUT {
char buf[str], *s, *t;
OUT() : s(buf), t(buf + str) {}
~OUT() { fwrite(buf, 1, s - buf, stdout); }
void pt(char c) {
(s == t) ? (fwrite(s = buf, 1, str, stdout), *s++ = c) : (*s++ = c);
}
OUT& operator<<(const char* s) {
while (*s) pt(*s++);
return *this;
}
OUT& operator<<(char* s) {
while (*s) pt(*s++);
return *this;
}
OUT& operator<<(string s) {
for (int i = 0; s[i]; i++) pt(s[i]);
return *this;
}
template <typename T>
OUT& operator<<(T x) {
if (!x) return pt('0'), *this;
if (x < 0) pt('-'), x = -x;
char a[30], t = 0;
while (x) a[t++] = x % 10, x /= 10;
while (t--) pt(a[t] + '0');
return *this;
}
} out;
} // namespace IO
using namespace IO;
int n, a[26];
long long s[100011];
map<long long, int> k[26];
char ch[100011];
int main() {
for (int i = 0; i <= 25; ++i) in >> a[i];
in >> (ch + 1);
n = strlen(ch + 1);
for (int i = 1; i <= n; ++i) s[i] = s[i - 1] + a[ch[i] - 'a'];
long long ans = 0;
for (int i = n; i >= 1; --i) {
ans += k[ch[i] - 'a'][s[i] + a[ch[i] - 'a']];
k[ch[i] - 'a'][s[i]]++;
}
out << ans << ln;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
int a[26];
char s[100010];
int main() {
int T, i, j, k, ca = 0, n, m;
for (i = 0; i < 26; i++) scanf("%d", &a[i]);
scanf("%s", s);
n = strlen(s);
map<long long, int> g[26];
long long ans = 0, f = 0;
for (i = 0; i < n; i++)
ans += g[s[i] - 'a'][f], f = f + a[s[i] - 'a'], g[s[i] - 'a'][f]++;
printf("%I64d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
long long fmin(long long a, long long b) { return a < b ? a : b; }
long long fmax(long long a, long long b) { return a > b ? a : b; }
int getBit(int n, int pos) { return (n >> pos) & 1; }
int main() {
ios_base::sync_with_stdio(false);
long long score[26];
for (int i = 0; i < 26; i++) cin >> score[i];
string s;
cin >> s;
map<long long, int> f[26];
long long sum = 0;
long long res = 0;
for (int i = 0; i < s.length(); i++) {
res += f[s[i] - 'a'][sum];
sum += score[s[i] - 'a'];
f[s[i] - 'a'][sum] += 1;
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Node {
char c;
long long sum;
bool operator<(const Node &others) const {
if (sum > others.sum)
return true;
else if (sum < others.sum)
return false;
else if (sum == others.sum)
return c > others.c;
}
};
Node e;
map<Node, long long> has;
int alp[30], len;
long long ans = 0, sum[100010];
char str[100010];
int main() {
for (int i = 0; i < 26; i++) {
scanf("%d", &alp[i]);
}
scanf("%s", str);
len = strlen(str);
has.clear();
sum[0] = alp[str[0] - 'a'];
for (int i = 0; i < len - 1; i++) {
if (str[i] == str[i + 1]) ans++;
}
for (int i = 1; i < len; i++) {
sum[i] = sum[i - 1] + alp[str[i] - 'a'];
e.c = str[i];
e.sum = sum[i - 1];
if (has[e]) ans += has[e];
e.c = str[i - 1];
if (!has[e]) {
has[e] = 1;
} else {
has[e]++;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> ms[26];
long long sum, ans, x[26];
string s;
int main() {
for (int i = 0; i < 26; i++) cin >> x[i];
cin >> s;
for (int i = 0; i < s.length(); i++) {
ans += ms[s[i] - 'a'][sum];
sum += x[s[i] - 'a'];
ms[s[i] - 'a'][sum]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAXI = 1000006;
long long a[MAXI];
map<long long, long long> mp;
map<pair<long long, long long>, long long> m;
int main() {
for (int i = 0; i < 26; i++) {
long long x;
cin >> x;
mp['a' - 0 + i] = x;
}
string s;
cin >> s;
long long ans = 0;
long long cur_sum = 0;
for (int i = 0; i < s.size(); i++) {
ans += m[make_pair(s[i] - 0, cur_sum)];
cur_sum += mp[s[i] - 0];
m[make_pair(s[i] - 0, cur_sum)]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
int ss = ((int)(v).size());
for (int(i) = 0; (i) < (ss); ++(i)) out << v[i] << " ";
return out;
}
template <typename T, typename TT>
ostream& operator<<(ostream& out, const pair<T, TT>& p) {
out << p.first << " " << p.second;
return out;
}
template <typename T, typename TT>
istream& operator>>(istream& in, pair<T, TT>& s) {
in >> s.first >> s.second;
return in;
}
template <typename T>
bitset<sizeof(T) * 8> BIN(T a) {
return bitset<sizeof(T) * 8>(a);
}
int main() {
int charMap[300];
for (int i = 'a'; i <= 'z'; i++) {
cin >> charMap[i];
}
string str;
cin >> str;
long long sum = 0;
long long tot = 0;
;
map<char, map<long long, long long> > mp;
for (int i = 0; i < ((int)(str).size()); i++) {
tot += mp[str[i]][sum];
sum += charMap[str[i]];
mp[str[i]][sum]++;
}
cout << tot << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int likes[26], len;
long long pre[100100];
string s;
int getLikes(char ch) { return likes[ch - 'a']; }
int main() {
for (int i = 0; i < 26; i++) {
cin >> likes[i];
}
cin >> s;
len = s.length();
for (int i = 0; i < len; i++) {
pre[i] = (i == 0 ? 0 : pre[i - 1]) + getLikes(s[i]);
}
long long ct = 0;
for (char ch = 'a'; ch <= 'z'; ch++) {
map<long long, int> seen;
if (s[0] == ch) {
seen.insert(make_pair(pre[0], 1));
}
for (int i = 1; i < len; i++) {
if (s[i] != ch) {
continue;
}
if (seen.find(pre[i - 1]) != seen.end()) {
ct += (long long)seen[pre[i - 1]];
}
if (seen.find(pre[i]) == seen.end()) {
seen.insert(make_pair(pre[i], 1));
} else {
seen[pre[i]]++;
}
}
}
cout << ct << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long MOD = 1e9 + 7;
const long long INF = 0x3F3F3F3F3F3F3F3F;
long double EPS = 1e-12;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ifstream fin("ip.txt");
ofstream fout("op.txt");
{
long long v[26];
for (long long i = (0); i <= (25); i++) cin >> v[i];
string s;
cin >> s;
vector<long long> ind[26];
long long n = s.length();
for (long long i = (0); i <= (n - 1); i++) ind[s[i] - 'a'].push_back(i);
long long psm[n + 1];
psm[0] = 0;
for (long long i = (1); i <= (n); i++)
psm[i] = psm[i - 1] + v[s[i - 1] - 'a'];
long long ans = 0;
for (long long i = (0); i <= (25); i++) {
if (ind[i].empty()) continue;
long long m = (long long)ind[i].size();
map<long long, long long> hsh;
hsh[psm[ind[i][0] + 1]]++;
for (long long j = (1); j <= (m - 1); j++) {
if (hsh.find(psm[ind[i][j]]) != hsh.end()) ans += hsh[psm[ind[i][j]]];
hsh[psm[ind[i][j] + 1]]++;
}
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
map<long long int, long long int> m[26];
long long int a[26], i, ans = 0, sum = 0;
for (i = 0; i < 26; i++) cin >> a[i];
string s;
cin >> s;
for (i = 0; i < s.size(); i++) {
ans += m[s[i] - 'a'][sum];
sum += a[s[i] - 'a'];
m[s[i] - 'a'][sum]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
vector<int> v(26);
for (int &x : v) cin >> x;
string s;
cin >> s;
int n = s.size();
vector<long long int> tmp(n);
for (int i = 0; i < n; i++) tmp[i] = v[s[i] - 'a'];
for (int i = 1; i < n; i++) tmp[i] += tmp[i - 1];
long long int ans = 0;
map<char, map<long long int, int>> mp;
for (int i = 0; i < n; i++) {
long long int sum = tmp[i];
sum -= v[s[i] - 'a'];
ans += mp[s[i]][sum];
mp[s[i]][tmp[i]]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int d[26];
char s[maxn];
long long num[maxn];
map<long long, long long> mp[26];
int main() {
for (int i = 0; i < 26; i++) scanf("%d", &d[i]);
scanf("%s", s);
int len = strlen(s);
num[0] = d[s[0] - 'a'];
for (int i = 1; i < len; i++) {
num[i] = num[i - 1] + d[s[i] - 'a'];
}
long long ans = 0;
for (int i = 0; i < len; i++) {
ans += mp[s[i] - 'a'][num[i] - d[s[i] - 'a']];
mp[s[i] - 'a'][num[i]]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e4 + 7;
const int MAXN = (int)2e5 + 7;
int cnt[26];
string st;
unordered_map<long long, int> s[26];
int main() {
ios_base::sync_with_stdio(0);
for (int i = 0; i < 26; i++) cin >> cnt[i];
cin >> st;
long long csum = 0;
long long ans = 0;
for (int i = 0; i < st.size(); i++) {
long long old = csum;
csum += cnt[st[i] - 'a'];
ans += s[st[i] - 'a'][csum - 2LL * cnt[st[i] - 'a']];
s[st[i] - 'a'][old]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ans, arr[40], i, j, l, dp[100001];
char str[100001];
map<long long, int> mymap[30];
int main() {
for (i = 0; i < 26; i++) cin >> arr[i];
scanf("%s", str);
l = strlen(str);
memset(dp, 0, sizeof(dp));
ans = 0;
dp[0] = arr[str[0] - 'a'];
mymap[str[0] - 'a'][dp[0]]++;
for (i = 1; i < l; i++) {
dp[i] = dp[i - 1] + arr[str[i] - 'a'];
ans = ans + mymap[str[i] - 'a'][dp[i - 1]];
mymap[str[i] - 'a'][dp[i]]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int w[26];
string str;
long long sum[100001];
map<long long, int> m[26];
int main() {
char trash;
for (int i = 0; i < 26; i++) cin >> w[i];
getline(cin, str);
getline(cin, str);
long long ans = 0;
for (int i = 0; i < str.length(); i++) {
sum[i] = (i == 0) ? w[str[i] - 'a'] : sum[i - 1] + w[str[i] - 'a'];
if (i != 0) ans += (m[str[i] - 'a'])[sum[i - 1]];
(m[str[i] - 'a'])[sum[i]]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
int main() {
const int64_t N = 26;
std::vector<int64_t> v(N);
for (int64_t p = 0; p < N; p++) {
std::cin >> v[p];
}
std::string s;
std::cin >> s;
std::vector<std::map<int64_t, int64_t> > a(N);
int64_t sofar(0), total(0);
for (int64_t p = 0; p < s.size(); p++) {
int64_t current = s[p] - 'a';
if (a[current].count(sofar) > 0) {
total += a[current][sofar];
}
sofar += v[current];
if (a[current].count(sofar) > 0) {
++a[current][sofar];
} else {
a[current][sofar] = 1;
}
}
std::cout << total << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
map<long long, long long> m[26];
long long i, cost[28], len, ans, sum;
int main() {
for (i = 0; i < 26; i++) {
cin >> cost[i];
}
cin >> s;
len = s.length();
ans = 0;
sum = 0;
for (i = 0; i < len; i++) {
ans += m[s[i] - 'a'][sum];
sum += cost[s[i] - 'a'];
m[s[i] - 'a'][sum]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> M[26];
long long val[26];
int main() {
for (int i = 0; i < 26; ++i) {
cin >> val[i];
}
string s;
cin >> s;
long long pre = 0;
long long anse = 0;
pre = pre + val[s[0] - 97];
M[s[0] - 97][pre]++;
for (int i = 1; i < s.size(); ++i) {
anse += M[s[i] - 97][pre];
pre = pre + val[s[i] - 97];
M[s[i] - 97][pre]++;
}
cout << anse;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long p[26], ans[101010];
char s[101010];
map<long long, long long> ko[26];
int main() {
for (int i = 0; i < 26; i++) cin >> p[i];
scanf("%s", s);
ans[0] = p[s[0] - 'a'];
for (int i = 1; s[i]; i++) ans[i] = ans[i - 1] + p[s[i] - 'a'];
for (int i = 0; i < 26; i++) ko[i].clear();
long long sum = 0;
ko[s[0] - 'a'][ans[0]] = 1;
for (int i = 1; s[i]; i++) {
sum += ko[s[i] - 'a'][ans[i - 1]];
ko[s[i] - 'a'][ans[i]]++;
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long cum[100004];
int main() {
int val[26];
for (int i = 0; i < 26; i++) {
scanf("%d", &val[i]);
}
string s;
cin >> s;
int n = s.size();
vector<int> pos[27];
s = "#" + s;
for (int i = 1; i <= n; i++) {
cum[i] = cum[i - 1] + val[s[i] - 'a'];
pos[s[i] - 'a'].push_back(i);
}
long long ans = 0;
for (int c = 0; c < 26; c++) {
map<long long, int> cnt;
for (auto x : pos[c]) {
ans += cnt[cum[x - 1]];
cnt[cum[x]]++;
}
}
printf("%I64d\n", ans);
}
|
#include <bits/stdc++.h>
int dx[] = {0, 1, -1, 0, 1, -1, 1, -1, -2, 2, 0, 0},
dy[] = {1, 0, 0, -1, -1, 1, 1, -1, 0, 0, -2, 2};
using namespace std;
int v[1000];
map<long long, long long> M[1000];
int main() {
for (char c = 'a'; c <= 'z'; c++) {
cin >> v[c];
}
string str;
cin >> str;
long long Asum[100005];
Asum[0] = v[str[0]];
for (int i = 1; i < str.size(); i++) {
Asum[i] = Asum[i - 1] + v[str[i]];
}
long long ans = 0;
for (int i = 0; i < str.size(); i++) {
ans += M[str[i]][Asum[i] - v[str[i]]];
M[str[i]][Asum[i]]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long c[50];
for (int i = 0; i < 26; i++) cin >> c[i];
string s;
cin >> s;
long long d[100009] = {0};
for (int i = 1; i <= s.length(); i++) {
d[i] = d[i - 1];
d[i] += c[s[i - 1] - 'a'];
}
long long int p = 0;
map<long long, long long> m[50];
for (int i = 0; i < s.length(); i++) {
long long x = s[i] - 'a';
p += m[x][d[i]];
if (m[x].find(d[i + 1]) == m[x].end()) {
m[x][d[i + 1]] = 1;
} else {
m[x][d[i + 1]]++;
}
}
cout << p << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[26];
vector<int> start[26], ending[26];
int main() {
long long pref[100000];
char c[100001];
for (int i = 0; i < 26; i++) scanf("%I64d", &a[i]);
scanf("\n");
int n;
scanf("%s", &c);
n = strlen(c);
pref[0] = a[c[0] - 'a'];
for (int i = 1; i < n; i++) pref[i] = a[c[i] - 'a'] + pref[i - 1];
map<long long, list<int> > m;
map<char, list<int> > m1;
for (int i = 0; i < n; i++) m[pref[i]].push_back(i), m1[c[i]].push_back(i);
long long result = 0;
for (auto it = m.begin(); it != m.end(); it++) {
for (list<int>::iterator it1 = it->second.begin(); it1 != it->second.end();
it1++) {
start[c[*it1] - 'a'].push_back(*it1);
if ((*it1) != n - 1) ending[c[(*it1) + 1] - 'a'].push_back(*it1);
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < start[i].size(); j++) {
vector<int>::iterator it =
lower_bound(ending[i].begin(), ending[i].end(), start[i][j]);
result += (ending[i].end() - it);
}
start[i].clear();
ending[i].clear();
}
}
cout << result;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int ddx[] = {1, 0};
int ddy[] = {1, 1};
vector<int> pos[30];
string s;
long long int pre[100001];
int n;
long long int value[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
for (int i = 0; i < 26; i++) cin >> value[i];
cin >> s;
for (int i = 0; i < int(s.size()); i++) {
pre[i + 1] = pre[i] + value[s[i] - 'a'];
pos[s[i] - 'a'].push_back(i);
}
long long int ans = 0;
for (int i = 0; i < 26; i++) {
map<long long int, int> sum;
char aux = i + 'a';
for (int j = 0; j < int(pos[i].size()); j++) {
int atual = pos[i][j];
ans += sum[pre[atual]];
sum[pre[atual + 1]]++;
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
const int INF = (int)1e9;
const long long IINF = LLONG_MAX;
const int maxn = 10000005;
int main() {
vector<int> a(26);
for (int i = 0; i < 26; i++) cin >> a[i];
string s;
cin >> s;
int n = s.length();
vector<long long> pref(n, 0);
for (int i = 0; i < n; i++) {
pref[i] = a[s[i] - 'a'];
}
long long sum = 0LL;
map<long long, long long> mp[26];
long long ans = 0;
for (int i = 0; i < n; i++) {
ans = 1LL * ans + 1LL * mp[s[i] - 'a'][sum];
sum = 1LL * sum + 1LL * pref[i];
mp[s[i] - 'a'][sum]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using LL = long long;
const int N = 100000 + 5;
int A[N];
LL sum[N];
char str[N];
int value[26];
int n;
int main() {
for (int i = 0; i < 26; ++i) {
scanf("%d", value + i);
}
scanf("%s", str + 1);
n = strlen(str + 1);
for (int i = 1; i <= n; ++i) {
sum[i] = sum[i - 1] + value[str[i] - 'a'];
}
std::map<LL, LL> map[26];
LL answer = 0;
for (int i = 1; i <= n; ++i) {
int c = str[i] - 'a';
answer += map[c][sum[i - 1]];
map[c][sum[i]]++;
}
printf("%I64d\n", answer);
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a, b, c, d[26], j;
map<long long int, int> m[26];
string s;
int main() {
for (int i = 0; i < 26; i++) cin >> d[i];
cin >> s;
b = s.size();
for (int i = 0; i < b; i++) {
c += m[s[i] - 'a'][j];
j += d[s[i] - 'a'];
m[s[i] - 'a'][j]++;
}
cout << c << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 11, mod = 1e9 + 7;
int a[30], sum, ans;
string s1;
vector<int> v[30];
vector<int> v1[30];
map<int, int> mp;
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
for (int i = 0; i < 26; i++) cin >> a[i];
cin >> s1;
for (int i = 0; i < s1.size(); i++) {
int u = s1[i];
u -= 97;
v[u].push_back(sum);
sum += a[u];
v1[u].push_back(sum);
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < v[i].size(); j++) {
if (j) {
ans += mp[v[i][j]];
}
mp[v1[i][j]]++;
}
for (int j = 0; j < v[i].size(); j++) mp[v1[i][j]] = 0;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[26];
long long cs[200001];
string s;
map<long long, long long> sum;
int main() {
for (long long i = 0; i < 26; i++) scanf("%lld", &a[i]);
cin >> s;
for (long long i = 1; i <= s.size(); i++) {
cs[i] = cs[i - 1] + a[s[i - 1] - 'a'];
}
long long ans = 0;
for (char c = 'a'; c <= 'z'; c++) {
for (long long i = 0; i < s.size(); i++) {
if (s[i] == c) sum[cs[i + 1]]++;
}
for (long long i = 0; i < s.size(); i++) {
if (s[i] == c) {
sum[cs[i + 1]]--;
ans += sum[cs[i + 1] + a[c - 'a']];
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
int main() {
ios::sync_with_stdio(0);
long long int val[26];
for (int i = 0; i < 26; i++) {
cin >> val[i];
}
string s;
cin >> s;
map<long long int, vector<int> > score[26];
long long int g = 0;
long long int dest[((long long int)s.size())];
for (int i = 0; i < ((long long int)s.size()); i++) {
g += val[s[i] - 'a'];
score[s[i] - 'a'][g].push_back(i);
dest[i] = g;
}
long long int d = 0;
for (int i = 0; i < ((long long int)s.size()); i++) {
d += score[s[i] - 'a'][val[s[i] - 'a'] + dest[i]].end() -
upper_bound(score[s[i] - 'a'][val[s[i] - 'a'] + dest[i]].begin(),
score[s[i] - 'a'][val[s[i] - 'a'] + dest[i]].end(), i);
}
cout << d << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> itRS) {}
template <typename T, typename... Args>
void err(istream_iterator<string> itRS, T a, Args... args) {
cerr << *itRS << " = " << a << "\n";
err(++itRS, args...);
}
int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int MOD = 1000000007;
int T[10001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
long long int value[26];
for (int i = 0; i < 26; i++) cin >> value[i];
string s;
cin >> s;
vector<long long int> v[26];
for (int i = 0; i < s.length(); i++) {
v[s[i] - 'a'].push_back(i);
}
long long int prefix[s.length()];
memset(prefix, 0, sizeof(prefix));
prefix[0] = value[s[0] - 'a'];
for (int i = 1; i < s.length(); i++) {
prefix[i] = value[s[i] - 'a'];
prefix[i] += prefix[i - 1];
}
long long int final_ans = 0;
for (int i = 0; i < 26; i++) {
map<long long int, int> mp1;
for (int j = 0; j < v[i].size(); j++) {
final_ans += mp1[prefix[v[i][j] - 1]];
mp1[prefix[v[i][j]]]++;
}
}
cout << final_ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long w[27], a, p;
map<long long, int> m[256];
int main() {
for (int i = 0; i < 26; i++) scanf("%lld", &w[i]);
char s[100005];
scanf("%s", s + 1);
for (int i = 1; s[i]; i++) a += m[s[i]][p], p += w[s[i] - 'a'], m[s[i]][p]++;
printf("%lld\n", a);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
x = 0;
char ch = getchar();
long long fh = 1;
while (ch < '0' || ch > '9') {
if (ch == '-') fh = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
x *= fh;
}
template <typename T>
void write(T x) {
if (x < 0) x = -x, putchar('-');
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
template <typename T>
void writeln(T x) {
write(x);
puts("");
}
long long val[30];
long long n;
long long s[100005];
long long sum[100005];
long long dp[100005];
map<long long, long long> pre[30];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
for (long long i = 0; i < 26; i++) cin >> val[i];
string str;
cin >> str;
n = str.size();
for (long long i = 0; i < str.size(); i++) s[i + 1] = str[i] - 'a';
for (long long i = 1; i <= n; i++) {
sum[i] = val[s[i]];
sum[i] += sum[i - 1];
}
long long ans = 0;
for (long long i = 1; i <= n; i++) {
dp[i] = pre[s[i]][sum[i - 1]];
pre[s[i]][sum[i]]++;
ans += dp[i];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int x[26];
string s;
map<long long, int> f[26];
int main() {
ios_base::sync_with_stdio(false);
for (int i = 0; i < 26; i++) cin >> x[i];
cin >> s;
long long sum = 0, ret = 0;
for (int i = 0; i < s.length(); i++) {
s[i] -= 'a';
ret += f[s[i]][sum];
sum += x[s[i]];
f[s[i]][sum]++;
}
cout << ret;
return 0;
}
|
#include <bits/stdc++.h>
long long mpow(long long a, long long n, long long mod) {
long long ret = 1;
long long b = a;
while (n) {
if (n & 1) ret = (ret * b) % mod;
b = (b * b) % mod;
n >>= 1;
}
return (long long)ret;
}
using namespace std;
vector<int> v;
long long pref[100005];
map<pair<long long, char>, long long> mp2;
map<pair<long long, char>, long long>::iterator it;
int main() {
int i, j;
for (j = 0; j < 26; j++) {
int x;
cin >> x;
v.push_back(x);
}
string s;
cin >> s;
int sz = s.size();
long long ans = 0;
pref[0] = v[s[j] - 'a'];
for (j = 1; j < sz; j++) {
pref[j] = pref[j - 1] + v[s[j] - 'a'];
}
for (j = 0; j < sz; j++) {
if (j == 0)
mp2[make_pair(pref[j], s[j])]++;
else {
it = mp2.find(make_pair(pref[j - 1], s[j]));
if (it != mp2.end()) ans += it->second;
mp2[make_pair(pref[j], s[j])]++;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v(26);
string s;
int n;
vector<long long> ps;
map<long long, vector<int>> cnt;
int main() {
for (int i = 0; i < 26; i++) cin >> v[i];
cin >> s;
n = s.size();
ps.resize(n);
ps[0] = v[s[0] - 'a'];
for (int i = 1; i < n; i++) ps[i] = ps[i - 1] + v[s[i] - 'a'];
for (int i = 0; i < n; i++) {
if (!cnt.count(ps[i])) cnt[ps[i]] = vector<int>(26);
cnt[ps[i]][s[i] - 'a']++;
}
long long ans = 0LL;
for (int i = 0; i < n; i++) {
cnt[ps[i]][s[i] - 'a']--;
if (cnt.count(ps[i] + v[s[i] - 'a']))
ans += (cnt[ps[i] + v[s[i] - 'a']][s[i] - 'a']);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 100;
map<long long, int> G[30];
char str[MAXN];
int val[30];
long long sum[MAXN];
int main() {
long long ans = 0;
for (int i = 0; i < 26; i++) scanf("%d", &val[i]);
scanf("%s", str + 1);
int len = strlen(str + 1);
for (int i = 1; i <= len; i++) sum[i] = sum[i - 1] + val[str[i] - 'a'];
for (int i = 1; i <= len; i++) {
int idx = str[i] - 'a';
if (G[idx].count(sum[i - 1])) ans += G[idx][sum[i - 1]];
G[idx][sum[i]]++;
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long int> v(26);
for (long long int i = 0; i <= 25; i++) cin >> v[i];
string s;
cin >> s;
map<long long int, long long int> m[26];
long long int ans = 0, sum = 0;
for (long long int i = 0; i <= s.size() - 1; i++) {
char c = s[i];
ans += m[c - 'a'][sum];
sum += v[c - 'a'];
m[c - 'a'][sum]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int addingval[100];
long long int lastOcc[100];
long long int wt[100];
long long int cum[100005];
map<long long int, long long int> mp[100];
int main() {
for (int i = 0; i < 26; ++i) cin >> wt[i];
string s;
cin >> s;
int sz = s.size();
s = "$" + s;
long long int cnt = 0;
for (int i = 1; i <= sz; ++i) {
char c = s[i] - 'a';
cum[i] = cum[i - 1] + wt[c];
cnt += mp[c][cum[i - 1]];
mp[c][cum[i]]++;
}
cout << cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9 + 7;
const int MAX = 200009;
map<long long, int> M[28];
int A[27];
int main() {
string s;
for (int i = 0; i < 26; i++) cin >> A[i];
cin >> s;
long long res = 0, sum = 0;
for (int i = 0; i < (int)s.size(); i++) {
sum += A[s[i] - 'a'];
res += M[s[i] - 'a'][sum - A[s[i] - 'a']];
M[s[i] - 'a'][sum]++;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mo(long long a) { return a % (long long)(1e9 + 7); }
long long po(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y >>= 1;
x = (x * x) % p;
}
return res % p;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
vector<long long> sc(26);
for (long long i = 0; i < sc.size(); i++) cin >> sc[i];
;
string s;
cin >> ws;
cin >> s;
cin >> ws;
long long n = s.size();
map<long long, long long> mp[26];
long long sum = 0, ans = 0;
;
for (long long i = 0; i < n; i++) {
long long e = s[i] - 'a';
ans += mp[e][sum];
sum += sc[e];
mp[e][sum]++;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 7;
map<long long, int> f[26];
int a[26];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
for (int i = 0; i < 26; ++i) cin >> a[i];
string s;
cin >> s;
int n = s.size();
s = " " + s;
long long ans = 0, sum = 0;
for (int i = 1; i <= n; ++i) {
++f[s[i] - 'a'][sum += 1LL * a[s[i] - 'a']];
if (i < n) ans += 1LL * f[s[i + 1] - 'a'][sum];
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
static inline void amin(T &x, U y) {
if (y < x) x = y;
}
template <typename T, typename U>
static inline void amax(T &x, U y) {
if (x < y) x = y;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> a) {
out << a.first << " " << a.second;
return out;
}
template <typename T>
void print(T &ar) {
for (auto itr = begin(ar); itr != end(ar); ++itr) cout << *itr << " ";
}
void solve() {
long long ar[26], ans = 0;
for (long long i = 0; i <= 25; ++i) cin >> ar[i];
string s;
cin >> s;
vector<long long> sm(s.length() + 1, 0);
map<long long, long long> mp[26];
for (long long i = 1; i <= s.length(); ++i) {
sm[i] = sm[i - 1] + ar[s[i - 1] - 'a'];
ans += mp[s[i - 1] - 'a'][sm[i - 1]];
mp[s[i - 1] - 'a'][sm[i]]++;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int test = 1;
while (test--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int x[26];
string s;
int a[100000], n;
map<pair<int, long long>, int> cnt;
int main() {
ios_base::sync_with_stdio(false);
for (int i = 0; i < (int)(26); ++i) cin >> x[i];
cin >> s;
n = (int)s.length();
for (int i = 0; i < (int)(n); ++i) a[i] = s[i] - 'a';
long long ans = 0, tot = 0;
for (int i = 0; i < (int)(n); ++i) {
ans += cnt[make_pair(a[i], tot)];
tot += x[a[i]];
++cnt[make_pair(a[i], tot)];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 3;
const int maxm = 1e6 + 3;
const int mod = 1e9 + 7;
const int oo = 1e9 + 5;
void input() {
if (fopen("abc"
".inp",
"r")) {
freopen(
"abc"
".inp",
"r", stdin);
freopen(
"abc"
".out",
"w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int a[26];
string s;
long long f[maxn];
map<long long, long long> cnt[30];
int main() {
input();
for (int i = 0; i < 26; ++i) cin >> a[i];
cin >> s;
s = " " + s;
long long res = 0;
for (int i = 1; i < s.size() - 1; ++i) {
f[i] = f[i - 1] + a[s[i] - 'a'];
res += cnt[s[i + 1] - 'a'][f[i]];
cnt[s[i] - 'a'][f[i]]++;
if (s[i] == s[i + 1]) res++;
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
map<long long, int> mp[26];
map<char, int> t;
int main() {
ios::sync_with_stdio(false);
for (char i = 'a'; i <= 'z'; i++) cin >> t[i];
cin >> s;
int n = s.size();
long long cur = 0, ans = 0;
for (int i = 0; i < n; i++) {
if (mp[s[i] - 'a'].count(cur)) ans += mp[s[i] - 'a'][cur];
cur += t[s[i]];
++mp[s[i] - 'a'][cur];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[26];
string s;
int main() {
for (int i = 0; i < 26; i++) cin >> a[i];
cin >> s;
int n = (int)s.length();
long long ans = 0;
map<long long, long long> m;
for (int i = 0; i < 26; i++) {
m.clear();
long long sum = 0;
for (int j = 0; j < n; j++) {
if (s[j] - 'a' == i) {
if (((m.find(sum - a[i])) != (m.end()))) ans += m[sum - a[i]];
if (((m.find(sum)) != (m.end())))
m[sum] = m[sum] + 1;
else
m[sum] = 1;
}
sum += a[s[j] - 'a'];
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcdf(long long a, long long b) {
while (a != 0 && b != 0) {
if (a > b) {
a %= b;
} else {
b %= a;
}
}
return max(a, b);
}
long long power(long long a, long long b, long long m) {
long long ans = 1;
while (b) {
if (b & 1) ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans;
}
void boost() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main() {
boost();
int t = 1, i, j, k;
while (t--) {
map<char, int> mpp;
for (i = 0; i < 26; i++) {
char c = 'a' + i;
cin >> mpp[c];
}
string s;
cin >> s;
int n = s.size();
long long prefix[n];
prefix[0] = mpp[s[0]];
for (i = 1; i < n; i++) prefix[i] = prefix[i - 1] + mpp[s[i]];
long long ans = 0;
for (j = 0; j < 26; j++) {
char c = 'a' + j;
map<long long, int> fr;
for (i = 0; i < n; i++) {
if (s[i] == c) {
ans += fr[prefix[i - 1]];
fr[prefix[i]]++;
}
}
}
cout << ans;
}
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> val;
string s;
long long lim;
vector<vector<long long> > idx(26);
long long cumval[1000005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
for (int i = 0; i < 26; ++i) {
int temp;
cin >> temp;
val.push_back(temp);
}
cin >> s;
lim = s.size();
for (int i = 0; i < lim; ++i) {
idx[s[i] - 'a'].push_back(i + 1);
cumval[i + 1] = val[s[i] - 'a'];
cumval[i + 1] += cumval[i];
}
long long ans = 0;
for (int i = 0; i < 26; ++i) {
map<long long, int> xd;
for (int j = 0; j < idx[i].size(); ++j) {
int x = idx[i][j];
ans += xd[cumval[x - 1]];
xd[cumval[x]]++;
}
xd.clear();
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long int> P[26];
long long int L[26], C[100001];
int main() {
string s;
for (int i = 0; i < 26; i++) cin >> L[i];
cin >> s;
s = '_' + s;
for (int i = 1; i < s.size(); i++) {
C[i] = C[i - 1] + L[s[i] - 'a'];
P[s[i] - 'a'].push_back(i);
}
long long int ans = 0;
for (int j = 0; j < 26; j++) {
map<long long int, long long int> CC;
for (int i = 0; i < P[j].size(); i++) {
ans = ans + CC[C[P[j][i] - 1]];
CC[C[P[j][i]]]++;
}
CC.clear();
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int level[26];
for (int i = 0; i < 26; i++) cin >> level[i];
string s;
cin >> s;
long long ans = 0;
for (char ch = 'a'; ch <= 'z'; ch++) {
map<long long, long long> m;
long long sum = 0;
for (int i = 0; i < s.length(); i++) {
sum += level[s[i] - 'a'];
if (s[i] == ch) ans += m[sum - level[ch - 'a']], m[sum]++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cost[30];
string S;
map<long long, long long> occ[30];
int main() {
for (int i = 0; i < 26; i++) cin >> cost[i];
cin >> S;
long long acc = 0;
long long res = 0;
for (int i = 0; i < (int)S.size(); i++) {
res += occ[S[i] - 'a'][acc];
acc += cost[S[i] - 'a'];
occ[S[i] - 'a'][acc]++;
}
cout << res << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int N, M;
long long num[30];
string str;
map<long long, long long> sum[30];
int main() {
int i;
for (i = 0; i < 26; i++) scanf("%I64d", &num[i]);
cin >> str;
long long ans = 0;
int lens = str.length();
long long SUM = 0;
for (i = 0; i < lens; i++) {
ans += sum[str[i] - 'a'][SUM];
SUM += num[str[i] - 'a'];
sum[str[i] - 'a'][SUM]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long arr[27];
char str[100005];
long long sums[100005];
map<pair<int, long long>, int> mp;
int main() {
for (int i = 0; i < 26; i++) {
cin >> arr[i];
}
cin >> str;
long long cnt = 0;
int n = (int)strlen(str);
for (int i = 1; i <= n; i++) {
if (i != 1) cnt += mp[make_pair(str[i - 1] - 'a', sums[i - 1])];
sums[i] = sums[i - 1] + (arr[str[i - 1] - 'a']);
mp[make_pair(str[i - 1] - 'a', sums[i])]++;
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, int> m[26];
long long sum, ans, val[26];
int main() {
for (int i = 0; i < 26; i++) cin >> val[i];
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
ans += m[s[i] - 'a'][sum];
sum += val[s[i] - 'a'];
m[s[i] - 'a'][sum]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long arr[26];
string s;
const long long N = 100000;
vector<long long> v1[N];
long long sum[N];
int main() {
for (long long i = 0; i < 26; i++) cin >> arr[i];
cin >> s;
long long n = s.size();
sum[0] = arr[s[0] - 'a'];
for (long long i = 1; i < n; i++) {
sum[i] = arr[s[i] - 'a'];
sum[i] += sum[i - 1];
}
for (long long i = 0; i < s.size(); i++) {
v1[s[i] - 'a'].push_back(i);
}
long long ans = 0;
for (long long i = 0; i < 26; i++) {
map<long long, long long> m1;
for (long long j = 0; j < v1[i].size(); j++) {
long long p = v1[i][j];
if (p > 0) ans = ans + m1[sum[p - 1]];
m1[sum[p]]++;
}
m1.clear();
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
map<long long, long long> m[26];
string str;
long long arr[26], i, ans = 0, po = 0;
for (i = 0; i < 26; i++) cin >> arr[i];
cin >> str;
for (i = 0; i < str.size(); i++) {
ans += m[str[i] - 97][po];
po += arr[str[i] - 97];
m[str[i] - 97][po]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int const mod = 1000000007;
long long c[26], a[100005];
vector<int> x[26];
int main() {
ios::sync_with_stdio(false);
string s;
long long cnt = 0;
for (int i = 0; i < 26; i++) cin >> c[i];
cin >> s;
for (int i = 0; i < s.size(); i++) {
a[i + 1] = a[i] + c[s[i] - 'a'];
x[s[i] - 'a'].push_back(i + 1);
}
for (int i = 0; i < 26; i++) {
map<long long, long long> w;
for (auto it : x[i]) {
cnt += w[a[it - 1]];
w[a[it]]++;
}
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string str;
int n;
int v[26];
long long sum[100010];
map<long long, int> h[26];
int main() {
for (int(i) = (0); (i) < (26); ++(i)) cin >> v[i];
cin >> str;
n = str.size();
sum[0] = 0;
for (int(i) = (0); (i) < (n); ++(i)) {
sum[i + 1] = sum[i] + v[str[i] - 'a'];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
int le = str[i] - 'a';
ans += h[le][sum[i]];
h[le][sum[i + 1]]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mark[30];
long long num[100005];
map<pair<char, long long>, int> ma;
int main() {
for (int i = 0; i < 26; i++) scanf("%d", mark + i);
string s;
cin >> s;
long long ans = 0;
num[0] = 0;
for (int i = 0; i < s.length(); i++) {
pair<char, long long> temp = make_pair(s[i], num[i]);
ans += ma[temp];
num[i + 1] = num[i] + mark[s[i] - 'a'];
temp = make_pair(s[i], num[i + 1]);
ma[temp]++;
}
printf("%I64d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> mp[30];
string s;
long long x[30], c, r;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
for (long long i = 0; i < 26; i++) cin >> x[i];
cin >> s;
for (long long i = 0; i < s.size(); i++) {
long long xx = (long long)(s[i] - 'a');
r += mp[xx][c];
c += x[xx];
mp[xx][c]++;
}
cout << r << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int nmax = 100007;
int a[27];
map<long long, int> m[27];
long long sum[nmax];
int main() {
string s;
long long ans = 0;
for (int i = 0; i < 26; i++) cin >> a[i];
cin >> s;
sum[0] = a[s[0] - 'a'];
m[s[0] - 'a'][sum[0]]++;
for (int i = 0; i < s.length(); i++) {
if (i == 0) continue;
sum[i] = sum[i - 1] + a[s[i] - 'a'];
ans += m[s[i] - 'a'][sum[i] - a[s[i] - 'a']];
m[s[i] - 'a'][sum[i]]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long int> vv[27];
map<pair<char, long long int>, long long int> mp;
long long int cum[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, i, ara[50], j;
for (i = 0; i < 26; i++) {
cin >> ara[i];
}
string s;
cin >> s;
long long int sum = 0;
int len = s.size();
sum += ara[s[0] - 'a'];
cum[0] = sum;
for (i = 1; i < len; i++) {
sum += ara[s[i] - 'a'];
cum[i] = sum;
mp[pair<char, long long int>(s[i], cum[i - 1])]++;
}
long long int ans = 0;
for (i = 0; i < len; i++) {
if (i != 0) {
mp[pair<char, long long int>(s[i], cum[i - 1])]--;
}
ans += mp[pair<char, long long int>(s[i], cum[i])];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, int> store[26];
int val[26];
int main() {
long long sum = 0, ans = 0;
for (int i = 0; i < 26; i++) cin >> val[i];
string str;
cin >> str;
for (int i = 0; i < str.size(); i++) {
int idx = str[i] - 'a';
sum = sum + val[idx];
if (store[idx].count(sum - val[idx])) ans += store[idx][sum - val[idx]];
store[idx][sum]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void RI() {}
template <typename... T>
void RI(int& head, T&... tail) {
scanf("%d", &head);
RI(tail...);
}
int v[26];
char s[100010];
long long ss[100010];
int main() {
for (int i = 0; i < int(26); i++) RI(v[i]);
scanf("%s", s + 1);
int n = strlen(s + 1);
for (int i = (1); i <= int(n); i++) ss[i] = ss[i - 1] + v[s[i] - 'a'];
long long ans = 0;
map<pair<long long, char>, int> mp;
for (int i = (1); i <= int(n); i++) {
auto p = make_pair(ss[i - 1], s[i]);
if (mp.count(p)) ans += mp[p];
mp[make_pair(ss[i], s[i])]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int valor[26];
map<long long int, int> cuantossuman[26];
int main() {
ios::sync_with_stdio(false);
for (int i = 0; i < 26; i++) cin >> valor[i];
long long int suma = 0;
string s;
cin >> s;
long long int sol = 0;
for (int i = 0; i < int(s.size()); i++) {
int x = s[i] - 'a';
sol += cuantossuman[x][suma];
suma += valor[x];
cuantossuman[x][suma]++;
}
cout << sol << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> v[150];
map<long long, long long> m[150];
long long i, x, a[150], ans;
string s;
int main() {
for (i = 'a'; i <= 'z'; i++) {
cin >> x;
a[i] = x;
}
cin >> s;
x = 0;
for (i = 0; s[i]; i++) {
ans += m[s[i]][x];
x += a[s[i]];
m[s[i]][x]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int like[26];
for (int i = 0; i < 26; i++) cin >> like[i];
string s;
cin >> s;
long long sum[s.length()];
sum[0] = like[s[0] - 'a'];
unordered_map<long long, int> mappy[26];
mappy[s[0] - 'a'][sum[0]]++;
long long ans = 0;
for (int i = 1; i < s.length(); i++) {
sum[i] = sum[i - 1] + like[s[i] - 'a'];
ans += mappy[s[i] - 'a'][sum[i - 1]];
mappy[s[i] - 'a'][sum[i]]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int oo = 1e9 + 9;
const long long inf = 1e18 + 18;
const int max6 = 1e6 + 6;
const int modx = 1e9 + 7;
const int mody = 997;
const int base = 137;
int a[max6];
long long ps[max6];
map<pair<long long, int>, int> cnt;
int n;
int main() {
ios_base::sync_with_stdio(false);
for (int i = 0; i < 26; ++i) cin >> a[i];
string s;
cin >> s;
n = s.size();
for (int i = 1; i <= n; ++i) {
int id = s[i - 1] - 'a';
ps[i] = ps[i - 1] + a[id];
}
long long res = 0;
for (int i = 1; i <= n; ++i) {
int id = s[i - 1] - 'a';
res += cnt[{ps[i - 1], id}];
cnt[{ps[i], id}]++;
}
cout << res;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int inf = 1e7;
const int MAXM = 1e5 + 5;
const int MAXN = 1e6 + 4;
int a[26];
map<pair<char, long long>, long long> m;
int main() {
string s;
for (int i = 0; i < 26; i++) {
cin >> a[i];
}
cin >> s;
int n = s.length();
long long pre = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
long long x = a[s[i] - 'a'];
if (m.find(make_pair(s[i], pre)) != m.end()) {
ans += m[make_pair(s[i], pre)];
}
pre += x;
m[make_pair(s[i], pre)]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[26], b[100001], c[100001], su, cnt;
int main() {
ios::sync_with_stdio(0);
cin.tie();
vector<int> v[26];
for (int i = 0; i < 26; i++) {
cin >> a[i];
}
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < n; i++) {
v[s[i] - 'a'].push_back(i);
}
b[0] = a[s[0] - 'a'];
for (int i = 1; i < n; i++) {
b[i] = b[i - 1] + a[s[i] - 'a'];
}
for (int i = 0; i < 26; i++) {
map<long long, int> m;
for (int j = 0; j < v[i].size(); j++) {
int p = v[i][j];
cnt += m[b[p] - a[s[p] - 'a']];
m[b[p]]++;
}
m.clear();
}
cout << cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
const int m = 1e9 + 7;
const int N = 3e5 + 10;
const int64_t INF = 100000000000000018LL;
vector<vector<long long>> graph(N);
vector<long long> collect;
long long odd = 0, even = 0;
long long pow(long long a, long long b, long long m) {
long long ans = 1;
while (b) {
if (b & 1) ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans;
}
bool checkbipartite(vector<long long> &visited, long long col, long long ind) {
visited[ind] = 1 - col;
bool t = true;
for (auto &it : graph[ind]) {
if (visited[it] == -1)
t = t && checkbipartite(visited, 1 - col, it);
else if (visited[it] == 1 - col)
return false;
}
return t;
}
bool isPrime(long long x) {
long long i;
for (i = 2; i * i <= x; i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
long long mini = INT_MAX;
void dfs(vector<vector<long long>> &graph, vector<bool> &visited, long long ind,
vector<long long> &v) {
if (visited[ind]) return;
visited[ind] = true;
mini = min(mini, v[ind]);
for (auto &it : graph[ind]) {
if (!visited[it]) {
dfs(graph, visited, it, v);
}
}
return;
}
bool isPowerOfTwo(long long n) {
if (n == 0) return false;
return (ceil(log2(n)) == floor(log2(n)));
}
void solve() {
long long a[26], i, sum = 0, j;
for (i = 0; i < 26; i++) {
cin >> a[i];
}
string s;
cin >> s;
long long pref[(long long)s.size()];
for (i = 0; i < (long long)s.size(); i++) {
sum += a[s[i] - 'a'];
pref[i] = sum;
}
long long ans = 0;
for (i = 0; i < 26; i++) {
map<long long, long long> bac;
for (j = 0; j < (long long)s.size(); j++) {
if (s[j] - 'a' == i) {
if (j != 0) {
ans += bac[pref[j - 1]];
bac[pref[j]]++;
} else
bac[pref[j]]++;
}
}
}
cout << ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, k, n, m, z, c, t;
long long b[266] = {0};
map<long long, long long> a[256];
string s;
for (i = 97; i < 123; i++) {
cin >> b[i];
}
cin >> s;
n = s.size();
c = 0, z = 0;
for (i = 0; i < n; i++) {
z = z + a[s[i]][c];
c = c + b[s[i]];
a[s[i]][c] += 1;
}
cout << z << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a[26], i, ans = 0;
for (i = 0; i < 26; i++) cin >> a[i];
string s;
cin >> s;
long long int x[s.size() + 1];
x[0] = 0;
map<long long int, long long int> m[26];
for (i = 1; i <= s.size(); i++) {
x[i] = x[i - 1] + a[s[i - 1] - 97];
ans += (m[s[i - 1] - 97][x[i - 1]]);
m[s[i - 1] - 97][x[i]]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MX = 1e6 + 5, ALPH = 30;
string s;
int t[ALPH], n;
long long pref[MX], res;
map<long long, int> dp[ALPH];
int main() {
ios_base::sync_with_stdio(false);
for (int i = 0; i < 26; ++i) cin >> t[i];
cin >> s;
n = s.size();
pref[0] = 0;
for (int i = 1; i <= n; ++i) pref[i] = pref[i - 1] + t[s[i - 1] - 'a'];
for (int i = 1; i <= n; ++i) {
int znak = s[i - 1] - 'a';
if (dp[znak].find(pref[i] - t[znak]) != dp[znak].end())
res += dp[znak][pref[i] - t[znak]];
if (dp[znak].find(pref[i]) == dp[znak].end()) dp[znak][pref[i]] = 0;
dp[znak][pref[i]]++;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long v[100001] = {};
map<long long, int> freq[26];
int val[26];
for (int i = 0; i < 26; ++i) cin >> val[i];
cin >> s;
int n = s.size();
s = "#" + s;
for (int i = 1; i <= n; ++i) v[i] = v[i - 1] + val[s[i] - 'a'];
long long res = 0;
for (int i = n; i > 0; --i) {
res += freq[s[i] - 'a'][v[i] + val[s[i] - 'a']];
++freq[s[i] - 'a'][v[i]];
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n;
int w[26];
long long sum[N];
char s[N];
vector<int> id[26];
int main() {
for (int i = 0; i < 26; ++i) scanf("%d", w + i);
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + w[s[i] - 'a'];
for (int i = 1; i <= n; ++i) id[s[i] - 'a'].push_back(i);
long long answer = 0;
for (int i = 0; i < 26; ++i) {
map<long long, int> cnt;
for (int j : id[i]) {
answer += cnt[sum[j - 1]];
cnt[sum[j]]++;
}
cnt.clear();
}
printf("%lld\n", answer);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[26];
for (int i = 0; i < 26; i++) cin >> arr[i];
string s;
cin >> s;
int n = s.size();
map<long long, int> mp[26];
long long sum[n];
sum[0] = arr[s[0] - 'a'];
for (int i = 1; i < n; i++) {
sum[i] = arr[s[i] - 'a'];
sum[i] += sum[i - 1];
}
long long ans = 0;
mp[s[0] - 'a'][sum[0]] = 1;
for (int i = 1; i < n; i++) {
long long x = mp[s[i] - 'a'][sum[i - 1]];
ans += x;
mp[s[i] - 'a'][sum[i]]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
vector<long long> a(27), sum;
for (long long i = 0; i < 26; i++) {
cin >> a[i];
}
string s;
cin >> s;
long long n = s.size();
sum.resize(n);
for (long long i = 0; i < n; i++) {
sum[i] = a[s[i] - 'a'];
}
for (long long i = 1; i < n; i++) {
sum[i] += sum[i - 1];
}
long long ans = 0;
map<pair<char, long long>, long long> mp;
mp[{s[0], sum[0]}]++;
for (long long i = 1; i < n; i++) {
ans += mp[{s[i], sum[i - 1]}];
mp[{s[i], sum[i]}]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int score[256], l;
long long sum[100100], ans;
char s[100100];
vector<long long> x[26], y[26];
map<long long, int> Cnt;
int main() {
for (int i = 0; i < 26; i++) scanf("%d", &score[(int)('a' + i)]);
scanf("%s", s);
l = strlen(s);
for (int i = 1; i <= l; i++) {
sum[i] = sum[i - 1] + score[(int)s[i - 1]];
}
for (int i = 1; i <= l; i++) {
x[s[i - 1] - 'a'].push_back(sum[i]);
y[s[i - 1] - 'a'].push_back(sum[i - 1]);
}
for (int i = 0; i < 26; i++) {
Cnt.clear();
for (int j = 0; j < (int)x[i].size(); j++) {
if (Cnt.find(y[i][j]) != Cnt.end()) ans += Cnt[y[i][j]];
if (Cnt.find(x[i][j]) == Cnt.end())
Cnt[x[i][j]] = 1;
else
Cnt[x[i][j]]++;
}
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:16777216")
using namespace std;
const int INF = 1000000000;
const int MAX = 100007;
const int MAX2 = 15000000;
int val[26];
map<long long, int> M[26];
char s[100007];
int main() {
for (int i = (0); i < (26); ++i) {
cin >> val[i];
}
scanf("%s", s);
int n = strlen(s);
long long cur = 0;
long long res = 0;
for (int i = (0); i < (n); ++i) {
int c = s[i] - 'a';
cur += val[c];
res += M[c][cur];
M[c][cur + val[c]]++;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[26];
char s[100010];
long long sum[100010], ans;
vector<int> v[26];
int main() {
int i, j, l, n;
for (i = 0; i < 26; i++) cin >> a[i];
cin >> s;
n = strlen(s);
for (i = 0; i < n; i++) {
sum[i] = a[s[i] - 'a'];
sum[i] += sum[i - 1];
v[s[i] - 'a'].push_back(i);
}
for (i = 0; i < 26; i++) {
map<long long, int> mymap;
for (j = 0; j < (int)v[i].size(); j++) {
l = v[i][j];
ans += mymap[sum[l - 1]];
mymap[sum[l]]++;
}
mymap.clear();
}
printf("%I64d\n", ans);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.