text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int value[26];
for (int i = 0; i < 26; i++) cin >> value[i];
string s;
cin >> s;
long long int ans = 0;
vector<int> v[26];
long long int sum[s.length() + 1];
sum[0] = 0;
for (int i = 0; i < s.length(); i++) {
v[s[i] - 'a'].push_back(i);
sum[i + 1] = sum[i] + value[s[i] - 'a'];
}
for (int i = 0; i < 26; i++) {
map<long long, int> m;
for (int j = 0; j < v[i].size(); j++) {
ans += m[sum[v[i][j]]];
m[sum[v[i][j] + 1]]++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
int val[27];
char a[N];
int n;
map<long long, int> h[26];
int main() {
int i;
for (i = 0; i < 26; ++i) {
cin >> val[i];
}
cin >> (a + 1);
n = strlen(a + 1);
long long sc = 0, rez = 0;
for (i = 1; i <= n; ++i) {
a[i] -= 'a';
sc += val[a[i]];
rez += h[a[i]][sc - val[a[i]]];
h[a[i]][sc]++;
}
cout << rez;
}
|
#include <bits/stdc++.h>
using namespace std;
long long val[26], ans, cur;
string s;
map<long long, long long> cnt[26];
int main() {
for (int i = 0; i < 26; i++) cin >> val[i];
cin >> s;
cur = 0;
for (char i : s) {
cur += val[i - 'a'];
cnt[i - 'a'][cur] = 0;
cnt[i - 'a'][cur - val[i - 'a']] = 0;
}
ans = 0;
cur = 0;
for (char i : s) {
cur += val[i - 'a'];
ans += cnt[i - 'a'][cur - val[i - 'a']];
cnt[i - 'a'][cur]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int al = 26;
vector<long long int> w(al);
for (int i = 0; i < (al); i++) {
cin >> w[i];
}
string s;
cin >> s;
vector<map<long long int, long long int>> before(al);
long long int bala = 0;
long long int ans = 0;
for (int i = 0; i < ((int)(s).size()); i++) {
long long int last = bala;
long long int c = s[i] - 'a';
bala += w[c];
ans += before[c][(bala - 2 * w[c])];
before[c][last]++;
}
cout << ans;
};
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int val[26];
map<long long, int> hash[26];
for (int i = 0; i < 26; ++i) cin >> val[i];
cin >> str;
int n = str.length();
long long sc = 0, rez = 0;
for (int i = 0; i < n; ++i) {
str[i] -= 'a';
sc += val[str[i]];
rez += hash[str[i]][sc - val[str[i]]];
hash[str[i]][sc]++;
}
cout << rez << endl;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
long long prefix[100002];
void solve() {
ios::sync_with_stdio(0);
cin.tie(nullptr);
cout.tie(nullptr);
int alpha[27];
for (int i = 1; i < 27; i++) {
cin >> alpha[i];
}
string a;
cin >> a;
int k = 1;
vector<int> v[27];
for (auto &b : a) {
int o = b - 'a' + 1;
prefix[k] = alpha[o];
prefix[k] += prefix[k - 1];
v[o].push_back(k);
k++;
}
long long total = 0;
for (int i = 1; i < 27; i++) {
if (v[i].size() >= 2) {
int p = v[i].size();
for (int j = 0; j < p; j++) {
for (int j1 = j + 1; j1 < p; j1++) {
if (prefix[v[i][j1]] - prefix[v[i][j]] - alpha[i] == 0LL) {
total++;
}
}
}
}
}
cout << total;
}
int main() {
int test_cases = 1;
while (test_cases-- > 0) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
map<char, int> valueOfChar;
string s;
vector<long long> preCalc;
vector<vector<int> > Pos(26);
void readData() {
int x;
for (char c = 'a'; c <= 'z'; ++c) {
cin >> x;
valueOfChar[c] = x;
}
cin >> s;
for (int i = 0; i < s.size(); ++i) {
Pos[s[i] - 'a'].push_back(i);
}
preCalc.resize(s.size() + 1);
}
void precalc() {
preCalc[0] = 0;
long long sum = 0;
for (int i = 1; i < preCalc.size(); ++i) {
preCalc[i] = preCalc[i - 1] + valueOfChar[s[i - 1]];
}
}
long long getSum(long long l, long long r) {
if (r == 0) return 0;
return preCalc[r];
}
long long totalrez = 0;
int main() {
readData();
precalc();
map<long long, long long> mymap;
for (int c = 0; c < 26; ++c) {
for (int i = 0; i < Pos[c].size(); ++i) {
++mymap[getSum(0, Pos[c][i])];
}
for (int i = 0; i < Pos[c].size(); ++i) {
long long sum = getSum(0, Pos[c][i]);
mymap[sum]--;
sum += valueOfChar[c + 'a'];
totalrez += mymap[sum];
}
}
cout << totalrez << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
vector<long long> wt(26);
long long n, sum = 0, ans = 0;
string second;
for (auto &i : wt) cin >> i;
cin >> second;
map<long long, long long> make_pair[26];
for (auto i : second)
ans += make_pair[i - 'a'][sum], make_pair[i - 'a'][sum += wt[i - 'a']]++;
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 1e5 + 1e3;
long long val[26];
long long sum[Maxn];
vector<int> Occ[26];
map<long long, int> small;
map<long long, int> big;
string second;
int main() {
ios_base::sync_with_stdio(0);
for (int i = (0); i < ((int)26); ++i) cin >> val[i];
cin >> second;
int n = second.size();
sum[0] = val[second[0] - 'a'];
for (int i = (1); i < ((int)n); ++i) {
sum[i] = sum[i - 1] + val[second[i] - 'a'];
}
long long ans = 0;
for (int i = (0); i < ((int)26); ++i) {
for (int j = (0); j < ((int)n); ++j) {
if (second[j] - 'a' == i) {
if (j) ans += small[sum[j - 1]];
small[sum[j]]++;
if (j) big[sum[j - 1]]++;
}
}
big.clear();
small.clear();
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long v[30];
string s;
map<pair<char, long long>, int> dp;
int main() {
for (int i = 0; i < 26; i++) cin >> v[i];
cin >> s;
long long sum = 0LL;
for (int i = 1; i < s.size(); i++) {
dp[make_pair(s[i], sum)]++;
sum += v[s[i] - 'a'];
}
long long r = 0;
sum = 0LL;
for (int i = 0; i < s.size() - 1; i++) {
r += dp[make_pair(s[i], sum)];
dp[make_pair(s[i + 1], sum)]--;
sum += v[s[i + 1] - 'a'];
}
cout << r << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
t = 1;
while (t--) {
unordered_map<long long, int> mp[27];
long long sum = 0, ans = 0, i, k, c, x;
string s;
vector<long long> v;
for (i = 0; i < 26; i++) {
cin >> x;
v.push_back(x);
}
cin >> s;
k = s.size();
for (i = 0; i < k; i++) {
c = s[i] - 'a';
ans += mp[c][sum];
sum += v[c];
mp[c][sum]++;
}
cout << ans << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int32_t main() {
cin.tie(NULL);
cout.tie(NULL);
ios::sync_with_stdio(false);
long long weights[26];
for (long long i = 0; i < 26; i++) {
cin >> weights[i];
}
cin >> s;
long long n = s.length();
s = '0' + s;
long long sum[n + 1];
long long ans = 0;
vector<long long> pos[26];
sum[0] = 0;
for (auto i = 1; i <= n; i++) {
sum[i] = weights[s[i] - 'a'];
sum[i] += sum[i - 1];
pos[s[i] - 'a'].push_back(i);
}
for (long long cha = 0; cha < 26; cha++) {
map<long long, long long> mp;
for (long long i = 0; i < pos[cha].size(); i++) {
long long p = pos[cha][i];
if (p != 0) ans += mp[sum[p - 1]];
mp[sum[p]]++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100000];
map<long long, int> f[26];
int x[26];
int main() {
long long ans = 0, tot = 0;
for (int i = 0; i < 26; i++) scanf("%d", &x[i]);
scanf("%s", &s);
for (int i = 0; i < strlen(s); i++) {
ans += f[s[i] - 'a'][tot];
tot += x[s[i] - 'a'];
f[s[i] - 'a'][tot]++;
}
printf("%I64d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int v[26], n;
char str[100007];
long long S[100007];
map<long long, long long> MAP[26];
int main(void) {
while (~scanf("%d", &v[0])) {
for (int i = 1; i < 26; ++i) scanf("%d", &v[i]);
scanf("%s", str);
n = strlen(str);
for (int i = 0; i < n; ++i) str[i] -= 'a';
S[0] = v[str[0]];
for (int i = 1; i < n; ++i) S[i] = S[i - 1] + v[str[i]];
for (int i = 0; i < 26; ++i) MAP[i].clear();
long long ANS = 0;
for (int i = 0; i < n; ++i) {
ANS += MAP[str[i]][S[i] - v[str[i]]];
MAP[str[i]][S[i]]++;
}
cout << ANS << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s;
long long i, n;
long long score[26], cumSum = 0, ans = 0;
vector<map<long long, long long> > m(26);
for (i = 0; i < 26; i++) {
cin >> score[i];
m.clear();
}
cin >> s;
n = s.length();
for (i = 0; i < n; i++) {
cumSum += score[s[i] - 'a'];
ans += m[s[i] - 'a'][cumSum - score[s[i] - 'a']];
m[s[i] - 'a'][cumSum]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long val[30], sump[100005];
int i, j, n;
string s;
map<long long, long long> maps[30];
int main(void) {
for (i = 0; i < 26; ++i) cin >> val[i];
getline(cin, s);
getline(cin, s);
long long sol = 0;
sump[0] = val[(int)(s[0] - 'a')];
maps[(int)(s[0] - 'a')][sump[0]] = 1;
for (i = 1; i < s.length(); ++i) {
sump[i] = val[(int)(s[i] - 'a')] + sump[i - 1];
sol += maps[(int)(s[i] - 'a')][sump[i - 1]];
if (maps[(int)(s[i] - 'a')][sump[i]] == 0)
maps[(int)(s[i] - 'a')][sump[i]] = 1;
else
maps[(int)(s[i] - 'a')][sump[i]] = maps[(int)(s[i] - 'a')][sump[i]] + 1;
}
cout << sol;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int vis[200];
map<long long int, long long int> viss;
char st[100005];
int main() {
long long int i, j, k, l, t, cs = 1, r = 1, s, m, n, a, b, c, d, e, f, g, h,
u, v;
for (i = 'a'; i <= 'z'; i++) {
scanf("%d", &vis[i]);
}
long long int ans = 0;
scanf("%s", &st);
l = strlen(st);
s = 0;
for (i = 'a'; i <= 'z'; i++) {
s = 0;
for (j = 0; j < l; j++) {
if (st[j] == i) {
if (viss[s] != 0) {
ans = ans + viss[s];
}
}
s = s + vis[st[j]];
if (st[j] == i)
if (viss[s] != 0)
viss[s]++;
else
viss[s] = 1ll;
}
viss.clear();
}
printf("%I64d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long val[30];
char a[100005];
long long sum[100005];
map<long long, int> M[30];
int main() {
for (int i = 0; i < 26; i++) scanf("%I64d", &val[i]);
scanf("%s", a);
int len = strlen(a);
sum[0] = val[a[0] - 'a'];
for (int i = 1; i < len; i++) {
sum[i] = sum[i - 1] + val[a[i] - 'a'];
}
long long ans = 0;
for (int i = 0; i < len; i++) {
ans += M[a[i] - 'a'][sum[i - 1]];
M[a[i] - 'a'][sum[i]]++;
}
printf("%I64d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long long x[30];
for (long long i = 0; i < 26; i++) {
cin >> x[i];
}
string s;
cin >> s;
long long n = s.size();
long long pre[n + 1];
pre[0] = 0;
for (long long i = 1; i <= n; i++) {
pre[i] = pre[i - 1] + x[s[i - 1] - 'a'];
}
long long ans = 0;
map<pair<long long, char>, long long> cnt;
for (long long i = 1; i < n; i++) {
if (s[i] == s[i - 1]) ans++;
ans += cnt[{pre[i], s[i]}];
cnt[{pre[i], s[i - 1]}]++;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a[26];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long int i, j, k, n, m, t;
for (i = 0; i < 26; i++) cin >> a[i];
string s;
cin >> s;
long long int sum = 0, re = 0, pre = 0;
map<long long int, long long int> pk[26];
for (i = 0; i < s.size(); i++) {
long long int cur = s[i] - 97;
sum += a[cur];
if (i == 0)
pk[cur][sum] += 1, pre = sum;
else {
re += pk[cur][pre];
pk[cur][sum] += 1;
pre = sum;
}
}
cout << re;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> pos[100012];
long long cnt[27], sum[100012], n;
long long ans = 0;
string s;
int main() {
for (int i = 0; i < 26; i++) {
cin >> cnt[i];
}
cin >> s;
n = s.size();
for (int i = 1; i <= n; i++) {
sum[i] = cnt[s[i - 1] - 'a'];
sum[i] += sum[i - 1];
pos[s[i - 1] - 'a'].push_back(i);
}
for (int i = 0; i < 26; i++) {
map<long long, int> m;
for (int j = 0; j < pos[i].size(); j++) {
int p = pos[i][j];
ans += m[sum[p - 1]];
m[sum[p]]++;
}
m.clear();
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 5;
const int MOD = 5e5 + 5;
map<long long, long long> dp[30];
long long sum[maxn];
long long a[27], ans = 0;
char word[maxn];
int main() {
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;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100005];
long long int V[256];
map<pair<int, long long int>, int> M;
int main() {
int i, n;
long long int prefixSum = 0, ans = 0;
for (i = 0; i < 26; i++) scanf("%lld", &V['a' + i]);
scanf("%s", s);
n = strlen(s);
for (i = 0; i < n; i++) {
ans += M[make_pair(s[i], prefixSum)];
prefixSum += V[(int)s[i]];
M[make_pair(s[i], prefixSum)]++;
}
printf("%lld\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
ifstream fin("in.in");
ofstream fout("out.out");
class compare : public std::binary_function<double, double, bool> {
public:
compare(double arg = 1e-7) : e(arg) {}
bool operator()(const double &left, const double &right) const {
return (abs(left - right) > e) && (left < right);
}
double e;
};
inline long long myabs(long long a) { return (a < 0) ? -a : a; }
inline int d_compare(double x, double y) {
return (fabs(x - y) <= 1e-7) ? 0 : (x > y) ? 1 : -1;
}
inline int mod(long long x, int y) {
if (y == 0) return x;
if (x < 0) x = -x;
if (x >= y) x %= y;
return x;
}
inline int cmod(int x, int y) {
if (y == 0) return x;
if (x < 0) x += (abs(x) / y + 1) * y;
if (x >= y) x = x % y;
return x;
}
int Bcount(int mask) {
int n = 0;
while (mask) n += ((mask & -mask) != 0), mask &= ~(mask & -mask);
return n;
}
inline bool Bstate(int mask, int idx) { return (mask & (1 << idx)); }
inline int B1(int mask, int idx) { return mask | (1 << idx); }
inline int B0(int mask, int idx) { return mask & ~(1 << idx); }
inline int drift(int mask, int n) { return mask & ((1 << n) - 1); }
void debugmask(int mask, int n) {
for (int i = 0; i < n; i++) cout << Bstate(mask, i);
}
int dr[8] = {0, 0, -1, 1, -1, 1, -1, 1}, dc[8] = {-1, 1, 0, 0, 1, -1, -1, 1};
template <typename Ty>
void clear(Ty &q) {
Ty empty;
swap(q, empty);
}
int arr['z' + 1];
long long sum[100000];
vector<map<long long, int> > mp;
string str;
void input() {
mp.clear();
mp.resize('z' + 1);
for (int i = 'a'; i <= 'z'; i++) cin >> arr[i];
cin >> str;
sum[0] = 0;
mp[str[0]][sum[0]]++;
for (int i = 1; str[i]; i++) {
sum[i] = arr[str[i - 1]] + sum[i - 1];
mp[str[i]][sum[i]]++;
}
}
int main() {
input();
long long c = 0;
for (int i = 0; str[i]; i++) {
mp[str[i]][sum[i]]--;
c += mp[str[i]][sum[i] + arr[str[i]]];
}
cout << c << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
using plc = pair<ll, char>;
using vll = vector<ll>;
using vld = vector<ld>;
using vvll = vector<vll>;
using vvld = vector<vld>;
using vpll = vector<pll>;
using vpld = vector<pld>;
using vplc = vector<plc>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vc = vector<char>;
using vvc = vector<vc>;
using mll = map<ll, ll>;
using sll = set<ll>;
const ll MOD = 1e9 + 7, LIM = 1e6 + 5, INF = 1e18 + 5;
const ld ERR = 1e-9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll tc = 1;
while (tc--) {
vll x(26);
for (ll i = 0; i < 26; i++) cin >> x[i];
string s;
cin >> s;
ll n = s.length();
vll dp(n);
for (ll i = 0; i < n; i++)
dp[i] = ((i > 0) ? dp[i - 1] : 0) + x[s[i] - 'a'];
vvll idx1(26);
for (ll i = 0; i < n; i++) idx1[s[i] - 'a'].push_back(i);
ll cnt = 0;
for (ll i = 0; i < 26; i++) {
if (idx1[i].size() >= 2) {
map<ll, vll> idx2;
for (ll idx : idx1[i]) {
idx2[dp[idx]].push_back(idx);
}
for (ll idx : idx1[i]) {
cnt += (upper_bound(idx2[dp[idx - 1]].begin(),
idx2[dp[idx - 1]].end(), idx - 1) -
idx2[dp[idx - 1]].begin());
}
}
}
cout << cnt;
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool deb = false;
const int N = 100011;
int n;
int c[30];
char a[N];
long long int sum[N];
map<long long int, int> mp;
vector<int> ind[30];
int main() {
int t;
for (int i = 0; i < 26; ++i) scanf("%d", &c[i]);
scanf("%s", a);
n = strlen(a);
for (int i = n; i > 0; --i) a[i] = a[i - 1];
for (int i = 1; i < n + 1; ++i) {
sum[i] += c[a[i] - 'a'] + sum[i - 1];
ind[a[i] - 'a'].push_back(i);
}
long long int ans = 0;
for (int i = 0; i < 26; ++i) {
for (int j = 0; j < (int)ind[i].size(); ++j) {
ans += mp[sum[ind[i][j] - 1]];
mp[sum[ind[i][j]]]++;
}
mp.clear();
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int sum[100010];
long long int PowMod(long long int x, long long int e, long long int mod) {
long long int res;
if (e == 0)
res = 1;
else if (e == 1)
res = x;
else {
res = PowMod(x, e / 2, mod);
res = res * res % mod;
if (e % 2) res = res * x % mod;
}
return res % mod;
}
int main() {
vector<long long int> pos[100010];
string str;
long long int res = 0, p;
long long int cnt[26], i;
for (i = 0; i <= 25; i++) cin >> cnt[i];
cin >> str;
for (i = 0; i <= str.length() - 1; i++) {
sum[i] = sum[i - 1] + cnt[str[i] - 'a'];
pos[str[i] - 'a'].push_back(i);
}
for (i = 0; i <= 25; i++) {
map<long long int, long long int> M1;
for (size_t j = 0; j < pos[i].size(); j++) {
p = pos[i][j];
res += M1[sum[p - 1]];
M1[sum[p]]++;
}
M1.clear();
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long int> Values(26);
string s;
for (int i = 0; i < 26; i++) cin >> Values[i];
cin >> s;
vector<long long int> cumulativeSum(s.length());
cumulativeSum[0] = Values[s[0] - 'a'];
for (int i = 1; i < s.length(); i++)
cumulativeSum[i] = cumulativeSum[i - 1] + Values[s[i] - 'a'];
long long int res = 0;
map<long long int, long long int> sumRepeat[26];
for (int i = 0; i < s.length(); i++) {
res += sumRepeat[s[i] - 'a'][cumulativeSum[i] - Values[s[i] - 'a']];
sumRepeat[s[i] - 'a'][cumulativeSum[i]]++;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
static const int maxn = 1e5 + 10;
static int c[26];
static string s;
static long long cnt[maxn];
static map<char, map<long long, int> > hashs;
int main() {
for (int i = 0; i < 26; i++) cin >> c[i];
cin >> s;
int n = s.length();
long long ans = 0;
for (int i = 0; i < n; i++) {
if (i == 0)
cnt[i] = c[s[i] - 'a'];
else
cnt[i] = cnt[i - 1] + c[s[i] - 'a'];
}
for (int i = 0; i < n; i++) {
ans += hashs[s[i]][cnt[i] - c[s[i] - 'a']];
++hashs[s[i]][cnt[i]];
}
printf("%I64d\n", ans);
return 0;
;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, n;
int mas[256] = {0};
static char str[300005];
static long long sum[300005] = {0};
map<long long, int> spisok[256];
long long kolvo = 0;
for (int i = 0; i < 26; i++) {
scanf("%d", &a);
mas['a' + i] = a;
}
scanf("%s", str);
n = strlen(str);
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + mas[str[i - 1]];
}
for (int i = 0; i < n; i++) {
kolvo += spisok[str[i]][sum[i + 1]];
spisok[str[i]][sum[i + 1] + mas[str[i]]]++;
}
printf("%I64d\n", kolvo);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool read(T &x) {
int c = getchar();
int sgn = 1;
while (~c && c < '0' || c > '9') {
if (c == '-') sgn = -1;
c = getchar();
}
for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
x *= sgn;
return ~c;
}
int X[] = {-1, -1, -1, 0, 1, 1, 1, 0};
int Y[] = {-1, 0, +1, 1, 1, 0, -1, -1};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
map<pair<int, long long>, long long> mp;
int val[30];
long long cumSum;
int main() {
for (int i = 0; i < 26; i++) read(val[i]);
cumSum = 0;
string str;
cin >> str;
long long ans = 0;
for (int i = 0; i < str.size(); i++) {
int c = str[i] - 'a';
ans += mp[pair<int, long long>(c, cumSum)];
cumSum += val[c];
mp[pair<int, long long>(c, cumSum)]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
char str[N];
long long a[N];
long long dp[N];
long long sum[N];
map<long long, int> mp;
int main() {
for (int i = 'a'; i <= 'z'; i++) cin >> a[i];
scanf("%s", str + 1);
int n = strlen(str + 1);
long long s = 0;
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[str[i]];
for (int i = 'a'; i <= 'z'; i++) {
mp.clear();
long long x = 0, y = 0;
int flag = 0;
for (int j = 1; j <= n; j++) {
if (flag == 0) {
if (str[j] != i)
continue;
else {
flag = 1;
mp[2 * a[str[j]]] = 1;
y = a[str[j]];
continue;
}
}
x += a[str[j]];
if (str[j] == i) {
y += x;
s += mp[y];
mp[y + a[str[j]]]++;
x = 0;
}
}
}
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int const inf = 1e18;
long long int const maxn = 2e5 + 5;
long long int const mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
vector<long long int> arr(26);
for (auto &u : arr) cin >> u;
string s;
cin >> s;
long long int n = s.length();
map<long long int, long long int> mp[26];
vector<long long int> brr(n);
for (long long int i = 0; i < n; i++) {
brr[i] = arr[s[i] - 'a'];
if (i != 0) brr[i] += brr[i - 1];
}
long long int ans = 0;
mp[s[0] - 'a'][brr[0]]++;
for (long long int i = 1; i < n; i++) {
ans += mp[s[i] - 'a'][brr[i - 1]];
mp[s[i] - 'a'][brr[i]]++;
}
cout << ans << "\n";
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
char in[MAXN];
long long wynik, wag[26], s[MAXN];
int n;
map<long long, long long> pocz[26];
int main() {
for (int i = 0; i < 26; i++) scanf("%I64d", &wag[i]);
scanf("%s", in + 1);
n = strlen(in + 1);
for (int i = 1; i <= n; i++) s[i] = s[i - 1] + wag[in[i] - 'a'];
for (int i = 1; i <= n; i++) {
if (i > 1) wynik += pocz[in[i] - 'a'][s[i - 1]];
pocz[in[i] - 'a'][s[i]]++;
}
printf("%I64d\n", wynik);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int maxN = 1e+5 + 8;
void print(vector<long long int> A) {
int N = A.size();
for (int i = 0; i < N; i++) printf("%lld ", A[i]);
printf("\n");
}
void solve() {
vector<long long int> X(26);
for (int i = 0; i < 26; i++) cin >> X[i];
string str;
cin >> str;
int N = str.length();
long long int ans = 0;
for (int i = 0; i < 26; i++) {
long long int sum = 0;
map<long long int, long long int> mapt;
for (int j = 0; j < N; j++) {
if (mapt.find(sum) != mapt.end() && str[j] - 'a' == i) ans += mapt[sum];
sum += X[str[j] - 'a'];
if (str[j] - 'a' == i) mapt[sum] += 1;
}
}
printf("%lld\n", ans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int T = 1, t;
t = T;
while (T--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double PI = acos(-1.0);
const int MOD = 1000 * 1000 * 1000 + 7;
const int INF = 2000 * 1000 * 1000;
const int MAXN = 100010;
template <typename T>
inline T sqr(T n) {
return n * n;
}
int cnt[26];
vector<int> pos[MAXN];
char s[MAXN];
int n;
long long sum[MAXN], ans;
int main() {
for (int i = 0; i < 26; i++) {
scanf("%d", &cnt[i]);
}
getchar();
gets(s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) {
sum[i] = cnt[s[i] - 'a'];
sum[i] += sum[i - 1];
pos[s[i] - 'a'].push_back(i);
}
for (int cc = 0; cc < 26; cc++) {
map<long long, int> Map;
for (size_t i = 0; i < pos[cc].size(); i++) {
int p = pos[cc][i];
ans += Map[sum[p - 1]];
Map[sum[p]]++;
}
Map.clear();
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long int, long long int> mp[26];
int main() {
int a[27];
for (int i = 0; i < 26; i++) {
int b;
scanf("%d", &b);
a[i] = b;
}
char f[100005];
scanf("%s", f);
long long int sum = 0, ans = 0;
for (int i = 0; i < strlen(f); i++) {
int t = f[i] - 'a';
ans += mp[t][sum];
sum += a[t];
mp[t][sum]++;
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long hash[26];
for (long long i = 0; i < 26; i++) cin >> hash[i];
string s;
cin >> s;
vector<long long> position[200000];
vector<long long> sum;
long long c = 0;
for (long long i = 0; i < s.length(); i++) {
position[s[i] - 'a'].emplace_back(i);
c += hash[s[i] - 'a'];
sum.emplace_back(c);
}
long long ans = 0;
for (long long i = 0; i < 26; i++) {
map<long long, long long> v;
for (long long j = 0; j < position[i].size(); j++) {
ans += v[sum[position[i][j] - 1]];
v[sum[position[i][j]]]++;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
long long val[26];
long long cumSum[100010];
string s;
int len;
multiset<long long> st1[26];
multiset<long long>::iterator itL, itU, itEd, itSt;
void brute() {
int cnt = 0;
for (int i = 0; i < len; i++) {
for (int j = i + 1; j < len; j++) {
if (s[i] == s[j] && cumSum[i] == cumSum[j - 1]) {
cnt++;
cout << s[i] << " : " << i << " - " << j << "\n";
}
}
}
cout << cnt << "\n";
}
map<long long, int> mp[26];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
for (int i = 0; i < 26; i++) cin >> val[i];
cin >> s;
len = s.size();
cumSum[0] = val[s[0] - 97];
for (int i = 1; i < len; i++) cumSum[i] = cumSum[i - 1] + val[s[i] - 97];
long long ans = 0;
int x = s[0] - 97;
long long valx = cumSum[0];
mp[x][valx]++;
for (int i = 1; i < len; i++) {
x = s[i] - 97;
if (mp[x].find(cumSum[i - 1]) != mp[x].end()) {
ans += mp[x][cumSum[i - 1]];
}
mp[x][cumSum[i]]++;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
char a[200000];
long long b[26];
long long s[200000];
int n;
map<long long, int> mq;
int main() {
int i, j, k;
for (i = 0; i < 26; i++) cin >> b[i];
scanf("%s", a);
n = strlen(a);
for (i = 0; i < n; i++) s[i] = (i == 0 ? 0 : s[i - 1]) + b[a[i] - 'a'];
long long dab = 0;
for (i = 0; i < 26; i++) {
mq.clear();
for (j = 0; j < n; j++) {
if (a[j] != i + 'a') continue;
dab += mq.count(s[j] - b[i]) ? mq[s[j] - b[i]] : 0;
mq[s[j]]++;
}
}
cout << dab;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[30], sum;
map<long long, long long> m[30];
int main() {
for (int i = 0; i < 26; i++) cin >> a[i];
string s;
cin >> s;
int n = s.size();
long long res = 0;
for (int i = 0; i < n; i++) {
res += m[s[i] - 'a'][sum];
sum += a[s[i] - 'a'];
m[s[i] - 'a'][sum]++;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;
const double EPS = 1e-7;
int N;
int v[256];
long long t[100010];
string s;
vector<int> pos[256];
map<long long, int> sum;
int main() {
ios::sync_with_stdio(false);
for (int i = 0; i < (26); ++i) {
int x;
cin >> x;
v['a' + i] = x;
}
cin >> s;
N = s.length();
long long sol = 0;
for (int c = 'a'; c <= 'z'; ++c) {
sum.clear();
for (int i = 1; i <= (N); ++i) {
t[i] = v[s[i - 1]];
t[i] += t[i - 1];
if (s[i - 1] == c) {
sol += sum[t[i - 1]];
sum[t[i]]++;
}
}
}
cout << sol << endl;
return 0;
}
|
#include <bits/stdc++.h>
namespace SGT {
char getc() { return getchar(); }
void putc(char ch) { putchar(ch); }
long long read() {
long long mk = 1, x = 0;
char ch = getc();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getc();
if (ch == '-') mk = -1, ch = getc();
while ('0' <= ch && ch <= '9')
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getc();
return x * mk;
}
void write(long long x, std::string ch) {
char cc[100000];
long long t = 0;
if (x == 0) putc('0');
if (x < 0) putc('-'), x = -x;
while (x) {
cc[++t] = char(x % 10 + 48);
x /= 10;
}
for (long long i = t; i >= 1; i--) putc(cc[i]);
if (ch.size() > 0) putc(ch[0]);
}
void write(char str[], std::string ch) {
for (long long i = 0; i < strlen(str); i++) putc(str[i]);
if (ch.size() > 0) putc(ch[0]);
}
void write(char wr, std::string ch) {
putc(wr);
if (ch.size() > 0) putc(ch[0]);
}
long long max(long long a, long long b) { return (a > b ? a : b); }
long long min(long long a, long long b) { return (a < b ? a : b); }
} // namespace SGT
using namespace SGT;
std::map<long long, long long> M[30];
char s[100010];
long long val[30], pre[100010], ans;
signed main() {
for (long long i = 0; i < 26; i++) val[i] = read();
scanf("%s", s);
pre[0] = val[s[0] - 'a'];
++M[s[0] - 'a'][pre[0]];
long long len = strlen(s);
for (long long i = 1; i < len; i++) {
pre[i] = pre[i - 1] + val[s[i] - 'a'];
ans += M[s[i] - 'a'][pre[i - 1]];
++M[s[i] - 'a'][pre[i]];
}
write(ans, "\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long wt[27];
long long presum[1000000];
vector<long long> pos[26];
string s;
int main() {
long long i, j, k;
for (i = 0; i < 26; i++) {
cin >> wt[i];
}
cin >> s;
presum[0] = wt[s[0] - 'a'];
pos[s[0] - 'a'].push_back(0);
for (i = 1; i < s.size(); i++) {
presum[i] = presum[i - 1] + wt[s[i] - 'a'];
pos[s[i] - 'a'].push_back(i);
}
long long res = 0;
for (i = 0; i < 26; i++) {
long long tot = 0;
map<long long, long long> M;
for (j = 0; j < pos[i].size(); j++) {
if (M.count(presum[pos[i][j] - 1])) {
tot += M[presum[pos[i][j] - 1]];
}
if (M.count(presum[pos[i][j]])) {
M[presum[pos[i][j]]]++;
} else {
M[presum[pos[i][j]]] = 1;
}
}
res += tot;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const long long inf = 1e18;
long long sum, ans, a[30], prefix[N];
char s[N];
map<pair<char, long long>, int> m;
int main() {
for (int i = 0; i < 26; i++) scanf("%lld", &a[i]);
scanf("%s", s);
int len = strlen(s);
for (int i = 0; i < len; i++) {
long long temp = a[s[i] - 97];
if (m.find(make_pair(s[i], sum)) != m.end()) ans += m[make_pair(s[i], sum)];
sum += temp;
if (!(m.find(make_pair(s[i], sum)) != m.end()))
m[make_pair(s[i], sum)] = 1;
else
m[make_pair(s[i], sum)]++;
}
printf("%lld\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
vector<int> x;
for (int i = 0; i < 26; i++) {
int v;
cin >> v;
x.push_back(v);
}
cin >> s;
map<long long, vector<int> > prefix2pos[26];
vector<long long> prefix;
long long psum = 0;
int i = 0;
for (string::iterator it = s.begin(); it != s.end(); ++it, ++i) {
char c = *it - 'a';
prefix2pos[c][psum].push_back(i - 1);
int v = x[c];
psum += v;
prefix.push_back(psum);
}
long long answer = 0;
i = 0;
for (string::iterator si = s.begin(); si != s.end(); si++, i++) {
int c = *si - 'a';
long long psum = prefix[i];
vector<int>& p = prefix2pos[c][psum];
vector<int>::iterator where = lower_bound(p.begin(), p.end(), i);
if (where != p.end()) answer += distance(where, p.end());
}
cout << answer << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 10;
long long len, ans, val[26], s[mx];
char str[mx];
map<pair<long long, char>, long long> dp;
int main() {
for (int i = 0; i < 26; i++) scanf("%I64d", &val[i]);
scanf("%s", str);
len = strlen(str);
s[0] = val[str[0] - 'a'];
for (int i = 1; i < len; i++) s[i] = s[i - 1] + val[str[i] - 'a'];
for (int i = 0; i < len; i++) {
ans += dp[make_pair(s[i - 1], str[i])];
dp[make_pair(s[i], str[i])]++;
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long al[26], ans, t;
map<long long, int> A[26];
string s;
int main() {
for (int i = 0; i < 26; ++i) scanf("%I64d", al + i);
cin >> s;
for (int i = 0; i < s.length(); ++i) {
ans += A[s[i] - 'a'][t];
t += al[s[i] - 'a'];
A[s[i] - 'a'][t]++;
}
printf("%I64d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
long long x, s;
};
bool operator<(node a, node b) {
if (a.x != b.x) return a.x < b.x;
return a.s < b.s;
}
map<node, int> M, L;
map<int, long long> V;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
for (int i = 0; i < 26; i++) {
long long x;
cin >> x;
V[i] = x;
}
string s;
cin >> s;
int ch = s[0] - 'a';
long long ss = V[ch];
M[{ch, 0}]++;
for (int i = 1; i < (int)s.size(); i++) {
int x = s[i] - 'a';
node n{x, ss};
M[n]++;
ss += V[x];
}
ss = 0;
long long res = 0;
for (int i = 0; i < (int)s.size(); i++) {
int x = s[i] - 'a';
node n{x, ss};
M[n]--;
ss += V[x];
node nn{x, ss};
if (M.find(nn) == M.end()) continue;
res += M[nn];
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 1e5 + 1e3;
long long val[26];
long long sum[Maxn];
vector<int> Occ[26];
map<long long, int> small;
map<long long, int> big;
string second;
int main() {
ios_base::sync_with_stdio(0);
for (int i = (0); i < ((int)26); ++i) cin >> val[i];
cin >> second;
int n = second.size();
sum[0] = val[second[0] - 'a'];
for (int i = (1); i < ((int)n); ++i) {
sum[i] = sum[i - 1] + val[second[i] - 'a'];
}
long long ans = 0;
for (int i = (0); i < ((int)26); ++i) {
for (int j = (0); j < ((int)n); ++j) {
if (second[j] - 'a' == i) {
if (j) ans += small[sum[j - 1]];
small[sum[j]]++;
if (j) big[sum[j - 1]]++;
}
}
big.clear();
small.clear();
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, -1, 1};
const int N = 1000100;
int cnt[100];
char s[N];
int n;
map<long long, int> foo[100];
int main() {
for (int i = 0; i < 26; ++i) scanf("%d", cnt + i);
scanf(" %s", s);
n = strlen(s);
long long at = 0;
for (int i = 0; i < n; ++i) {
foo[s[i] - 'a'][at]++;
int w = cnt[s[i] - 'a'];
at += w;
}
long long ans = 0;
at = 0;
for (int i = 0; i < n - 1; ++i) {
long long w = cnt[s[i] - 'a'];
foo[s[i] - 'a'][at]--;
ans += foo[s[i] - 'a'][at + w];
at += w;
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
const long long SZ = 3e5 + 7;
const long long inf = 1e18;
const long long MOD = 1e9 + 7;
const long long mod = 1e9 + 7;
long long opnmbr = 1;
using namespace std;
void solve() {}
long long pm(long long a, long long b) {
long long ans = 1;
while (b) {
if (b & 1) ans = (ans * a) % MOD;
b = b / 2;
a = (a * a) % MOD;
}
return ans;
}
long long mul(long long a, long long b) { return (a * 1LL * b) % mod; }
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
void krdiyasuru() {
vector<long long> a(30);
for (long long i = 0; i < (26); i++) cin >> a[i];
string s;
cin >> s;
long long n = (long long)s.size();
map<long long, long long> g;
for (long long i = 0; i < (n); i++) s[i] -= 'a';
long long ans = 0;
for (long long i = 0; i < (26); i++) {
g.clear();
long long sum = 0;
for (long long j = 0; j < (n); j++) {
if (s[j] == i) {
ans += g[sum];
g[sum + a[i]]++;
}
sum += a[(long long)s[j]];
}
}
cout << ans << '\n';
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
{ krdiyasuru(); }
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int a[26];
for (int i = 0; i < 26; i++) cin >> a[i];
string s;
cin >> s;
vector<long long> sum(s.size(), 0);
map<pair<char, long long>, int> m;
long long ans = 0;
for (int i = 0; i < s.size(); i++) {
sum[i] += a[s[i] - 'a'];
if (i > 0) sum[i] += sum[i - 1];
if (m[pair<char, long long>(s[i], sum[i - 1])] != 0) {
ans += m[pair<char, long long>(s[i], sum[i - 1])];
}
m[pair<char, long long>(s[i], sum[i])]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[26];
vector<long long> occ[26];
map<long long, long long> m;
long long pref[100003];
int main() {
string s;
long long i;
for (i = 0; i < 26; i++) cin >> a[i];
cin >> s;
for (i = 0; i < s.size(); i++) occ[s[i] - 'a'].push_back(i);
for (i = 0; i < s.size(); i++)
if (i == 0)
pref[i] = a[s[i] - 'a'];
else
pref[i] = pref[i - 1] + a[s[i] - 'a'];
long long ans = 0;
for (i = 0; i < 26; i++) {
m.clear();
if (!occ[i].empty()) m[pref[occ[i][0]]]++;
for (long long j = 1; j < occ[i].size(); j++) {
long long in = occ[i][j];
ans += m[pref[in - 1]];
m[pref[in]]++;
if (in == occ[i][j - 1] + 1) ans--;
}
}
for (i = 1; i < s.size(); i++)
if (s[i] == s[i - 1]) ans++;
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int sigma = 26;
const int maxn = 100005;
int val[sigma];
long long prefix[maxn];
map<unsigned long long, int> m[sigma];
string s;
int main() {
memset(val, 0, sizeof val);
for (int i = 0; i < sigma; i++) {
cin >> val[i];
m[i].clear();
}
cin >> s;
int len = s.size();
long long ans = 0;
for (int i = 0; i < len; i++) {
char cc = s[i] - 'a';
prefix[i] = i == 0 ? val[cc] : (prefix[i - 1] + val[cc]);
if (i != 0) ans += m[cc][prefix[i - 1]];
m[cc][prefix[i]]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int M = (1ll << 32) - 1;
const long long int N = 1e5 + 1;
long long int power(long long int x, long long int y, long long int M = ::M) {
long long int ans = 1;
while (y) {
if (y & 1) ans = (ans * x);
y >>= 1LL;
x = (x * x);
}
return ans;
}
long long int add(long long int a, long long int b) {
return ((a % M + b % M) % M);
}
long long int sub(long long int a, long long int b) {
return ((a % M - b % M + M) % M);
}
long long int mul(long long int a, long long int b) {
return (((a % M) * (b % M)) % M);
}
long long int divi(long long int a, long long int b) {
return (mul(a, power(b, M - 2)) % M);
}
inline void solve() {
int arr[26];
for (int i = 0; i < 26; i++) {
cin >> arr[i];
}
string s;
cin >> s;
int n = (int)s.size();
map<long long int, long long int> dp[26];
map<long long int, set<int>> sumdp;
long long int ans = 0;
long long int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += arr[s[i] - 'a'];
ans += dp[s[i + 1] - 'a'][sum];
dp[s[i] - 'a'][sum]++;
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < n - 1; j++) {
if (s[j] - 'a' == i && s[j] == s[j + 1]) ans++;
}
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
int t;
t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int C[26];
char s[200000];
map<long long, int> m[26];
long long rr[200000];
long long res;
int main() {
for (int(i) = 0; (i) < (26); (i)++) cin >> C[i];
scanf("%s", &s);
int n = strlen(s);
for (int(i) = 0; (i) < (n); (i)++) rr[i + 1] = rr[i] + C[s[i] - 'a'];
for (int(i) = 0; (i) < (n); (i)++) m[s[i] - 'a'][rr[i]]++;
for (int(i) = 0; (i) < (n); (i)++) {
m[s[i] - 'a'][rr[i]]--;
res += m[s[i] - 'a'][rr[i] + C[s[i] - 'a']];
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int val[100100];
long long s[100100];
char a[100100];
vector<int> pos[100100];
map<long long, int> cnt;
void process(void) {
for (int i = ('a'), _b = ('z'); i <= _b; i = i + 1) scanf("%d", &val[i]);
scanf("%s", a + 1);
for (int i = (1), _b = (strlen(a + 1)); i <= _b; i = i + 1)
s[i] = s[i - 1] + val[a[i]];
for (int i = (1), _b = (strlen(a + 1)); i <= _b; i = i + 1)
pos[a[i]].push_back(i);
long long res = 0;
for (int i = ('a'), _b = ('z'); i <= _b; i = i + 1)
if (!pos[i].empty()) {
cnt.clear();
for (__typeof((pos[i]).rbegin()) it = (pos[i]).rbegin();
it != (pos[i]).rend(); it++) {
res += cnt[s[*it]];
cnt[s[*it - 1]]++;
}
}
cout << res << endl;
}
int main(void) {
process();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-6;
int const mod = 1e9 + 7;
int const INF = 1 << 29;
int const M = 1e5 + 5;
long long int sum[M], a[28];
string s;
map<pair<long long int, long long int>, int> mm;
int main() {
for (int i = 0; i < 26; ++i) scanf("%I64d", &a[i]);
cin >> s;
int n = s.length();
sum[0] = a[s[0] - 'a'];
for (int i = 1; i < n; ++i) {
int c = s[i] - 'a';
sum[i] = sum[i - 1] + a[c];
}
long long int ans = 0;
for (int i = 0; i + 1 < n; ++i) {
long long int sm = sum[i];
int c = s[i + 1] - 'a';
ans += mm[make_pair(sm, c)];
c = s[i] - 'a';
++mm[make_pair(sm, c)];
}
for (int i = 0; i + 1 < n; ++i) {
if (s[i] == s[i + 1]) ++ans;
}
cout << ans;
putchar('\n');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c[26];
for (int i = 0; i < 26; i++) cin >> c[i];
string s;
cin >> s;
map<long long, int> l[26];
long long sum = 0, ans = 0;
for (int i = 0; i < s.size(); i++) {
ans += l[s[i] - 'a'][sum - c[s[i] - 'a']];
l[s[i] - 'a'][sum]++;
sum += c[s[i] - 'a'];
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9;
const int SIZE = 1e6 + 5;
const long long INF = 1LL << 55;
const double eps = 1e-10;
int v[26];
char s[100009];
long long rs[100009];
unordered_map<long long, int> m[26];
int main() {
for (int i = 0; i < (26); ++i) scanf("%d", &(v[i]));
scanf("%s", (s));
int n = strlen(s);
for (int i = (1); i < (n + 1); ++i) {
rs[i] = rs[i - 1] + v[s[i - 1] - 'a'];
}
long long cm = 0;
for (int i = (1); i < (n + 1); ++i) {
if (i >= 2) {
m[s[i - 2] - 'a'][rs[i - 1]]++;
}
cm += m[s[i - 1] - 'a'][rs[i - 1]];
}
printf("%I64d", cm);
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int value[27];
char input_[maxn];
map<long long, int> M[26];
int main() {
for (int i = 0; i < 26; i++) {
scanf("%d", &value[i]);
}
scanf("%s", input_ + 1);
int len = strlen(input_ + 1);
long long cnt = 0, k = 0;
for (int i = 1; i <= len; i++) {
cnt += M[input_[i] - 'a'][k];
k += value[input_[i] - 'a'];
M[input_[i] - 'a'][k]++;
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
long long w[27], a, i, p;
map<long long, int> m[123];
int main() {
for (i = 0; i < 26; i++) cin >> w[i];
cin >> s;
for (i = 0; i < s.size(); i++) {
a += m[s[i]][p];
p += w[s[i] - 'a'];
m[s[i]][p]++;
}
cout << a;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, int> mp[26];
int a[26];
char str[100005];
int main() {
long long ans = 0, x = 0;
for (int i = 0; i < 26; i++) cin >> a[i];
cin >> str;
int len = strlen(str);
for (int i = 0; i < len; i++) {
ans += mp[str[i] - 'a'][x];
x += a[str[i] - 'a'];
mp[str[i] - 'a'][x]++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
map<long long, int> m[30];
int num[30];
int main() {
for (int i = 0; i < 26; i++) cin >> num[i];
cin >> s;
vector<long long> sum;
long long sumsofar = 0;
long long total = 0;
for (int i = 0; i < s.size(); i++) {
sumsofar += num[s[i] - 'a'];
sum.push_back(sumsofar);
if (i > 0) total += m[s[i] - 'a'][sum[i - 1]];
m[s[i] - 'a'][sum[i]]++;
}
cout << total << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int Value[26];
long long Ar[100001];
map<long long, int> Mp[26];
int main() {
for (int i = 0; i < 26; i++) scanf("%d", &Value[i]);
string Input;
cin >> Input;
int n = Input.size();
Input = "$" + Input;
for (int i = 1; i <= n; i++) {
Ar[i] += Ar[i - 1] + Value[Input[i] - 'a'];
}
long long res = 0;
for (int i = n; i > 0; i--) {
res += Mp[Input[i] - 'a'][Ar[i] + Value[Input[i] - 'a']];
Mp[Input[i] - 'a'][Ar[i]]++;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int max_n = 111111, inf = 1111111111;
int a[222], cnt[33][max_n];
long long sum[max_n];
string s;
map<pair<char, long long>, int> q;
int main() {
for (int i = 0; i < 26; ++i) {
cin >> a[i];
}
cin >> s;
s = "#" + s;
for (int i = 1; i < s.length(); ++i) {
sum[i] = sum[i - 1] + a[s[i] - 'a'];
for (int j = 0; j < 26; ++j) {
cnt[j][i] = cnt[j][i - 1];
if (s[i] - 'a' == j) {
++cnt[j][i];
}
}
}
long long ans = 0;
for (int l = 2; l < s.length(); ++l) {
++q[make_pair(s[l], sum[l - 1])];
}
for (int l = 1; l + 1 < s.length(); ++l) {
ans += q[make_pair(s[l], sum[l])];
--q[make_pair(s[l + 1], sum[l])];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, int> mp[30];
int a[30];
char str[100010];
int main() {
while (scanf("%d", &a[0]) == 1) {
for (int i = 1; i < 26; i++) scanf("%d", &a[i]);
for (int i = 0; i < 26; i++) mp[i].clear();
scanf("%s", str);
int n = strlen(str);
long long ans = 0;
long long sum = 0;
for (int i = 0; i < n; i++) {
int id = str[i] - 'a';
if (mp[id].find(sum) != mp[id].end()) ans += mp[id][sum];
sum += a[id];
mp[id][sum]++;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6;
long long int x[maxn];
long long int sum, ans;
map<long long int, long long int> table[27];
string s;
int main() {
for (int i = 1; i <= 26; i++) cin >> x[i];
cin >> s;
for (int i = 0; i < s.size(); i++) {
ans += table[s[i] - 'a' + 1][sum];
sum += x[s[i] - 'a' + 1];
table[s[i] - 'a' + 1][sum]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int val[30];
char a[100005];
map<long long, int> h[26];
int main() {
for (int i = 0; i < 26; i++) scanf("%d", &val[i]);
scanf("%s", a);
int len = strlen(a);
long long ans = 0, sum = 0;
for (int i = 0; i < len; i++) {
ans += h[a[i] - 'a'][sum];
sum += val[a[i] - 'a'];
h[a[i] - 'a'][sum]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
const int shift = 100000;
using namespace std;
map<long long, long long> dp[26];
long long a[26];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
for (int i = 0; i < 26; i++) cin >> a[i];
string s;
cin >> s;
long long sum = 0, ans = 0;
for (int i = 0; i < s.size(); i++) {
ans += dp[s[i] - 'a'][sum + shift];
sum += a[s[i] - 'a'];
dp[s[i] - 'a'][sum + shift]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int val[26];
string second;
for (int i = 0; i < 26; i++) {
cin >> val[i];
}
cin >> second;
vector<long long int> adj[26];
long long int pref[second.size()];
for (int i = 0; i < second.size(); i++) {
adj[second[i] - 'a'].push_back(i);
if (i == 0) {
pref[i] = val[second[i] - 'a'];
} else {
pref[i] = pref[i - 1] + val[second[i] - 'a'];
}
}
long long int ans = 0;
for (char c = 'a'; c <= 'z'; c++) {
long long int sum = 0;
unordered_map<long long int, long long int> mp;
for (int j = 0; j < adj[c - 'a'].size(); j++) {
ans += mp[pref[adj[c - 'a'][j]] - val[c - 'a']];
mp[pref[adj[c - 'a'][j]]]++;
}
}
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;
const int INF = 1 << 30;
const int maxn = 100010;
long long ans;
int al[26];
long long gpa[maxn];
map<long long, long long> be[26];
int l;
char ch;
int main() {
for (int i = 0; i < 26; i++) scanf("%d", &al[i]);
getchar();
int l = 0;
while (scanf("%c", &ch) == 1 && ch <= 'z' && ch >= 'a') {
l++;
int t = ch - 'a';
if (l == 1) {
gpa[0] = al[t];
be[t][gpa[0]]++;
continue;
}
gpa[l - 1] = al[t] + gpa[l - 2];
ans += be[t][gpa[l - 2]];
be[t][gpa[l - 1]]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void cline() { cout << '\n'; }
template <typename T, typename... V>
void cline(T t, V... v) {
cout << t;
if (sizeof...(v)) cout << ' ';
cline(v...);
}
void cspc() { cout << ' '; }
template <typename T, typename... V>
void cspc(T t, V... v) {
cout << t;
if (sizeof...(v)) cout << ' ';
cspc(v...);
}
const long long N = 1e6 + 4;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long val[26];
string s;
for (long long i = 0; i < 26; i++) cin >> val[i];
cin >> s;
long long n = s.size();
vector<long long> v[26];
long long sum[n];
sum[0] = val[s[0] - 'a'];
v[s[0] - 'a'].push_back(0);
for (long long i = 1; i < n; i++) {
sum[i] = val[s[i] - 'a'] + sum[i - 1];
v[s[i] - 'a'].push_back(i);
}
long long ans = 0;
for (long long i = 0; i < 26; i++) {
if (v[i].size() > 1) {
map<long long, long long> fro;
for (long long j = 0; j < v[i].size(); j++) {
if (v[i][j] == 0) {
ans += fro[0];
} else {
ans += fro[sum[v[i][j] - 1]];
}
fro[sum[v[i][j]]]++;
}
}
}
cspc(ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
long long sum[N];
int val[26];
map<long long, int> fr[26];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
for (int i = 0; i < 26; i++) cin >> val[i];
string s;
cin >> s;
long long ans = 0;
for (int i = 1; i < s.size(); i++) {
char c = s[i - 1];
sum[i] = sum[i - 1] + val[c - 'a'];
fr[c - 'a'][sum[i]]++;
ans += fr[s[i] - 'a'][sum[i]];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> store[26];
int val[26];
int main() {
long long sum = 0;
for (int i = 0; i < 26; i++) cin >> val[i];
string str;
cin >> str;
for (int i = 0; i < str.size(); i++) {
sum = sum + val[str[i] - 'a'];
store[str[i] - 'a'].push_back(sum);
}
long long ans = 0;
for (int i = 0; i < 26; i++) {
vector<long long> &a = store[i];
map<long long, int> ahaa;
for (int idx = 0; idx < a.size(); idx++) {
if (ahaa.count(a[idx] - val[i])) ans += ahaa[a[idx] - val[i]];
ahaa[a[idx]]++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long Pw(long long int b, long long int p) {
if (!p) return 1;
long long int sq = Pw(b, p / 2);
sq *= sq;
if (p % 2) sq *= b;
return sq;
}
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long sd(long long x) { return x < 10 ? x : x % 10 + sd(x / 10); }
long long lcm(long long a, long long b) { return ((a * b) / gcd(a, b)); }
vector<long long> get_divisors(long long n) {
vector<long long> arr;
long long i = 1;
for (i; i * i <= n; i++) {
if (n % i == 0) {
arr.push_back(i);
if (i * i != n) arr.push_back(n / i);
}
}
return arr;
}
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int p[200500];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
map<long long, int> mp[26];
long long sum = 0, c = 0;
int arr[26];
string s;
for (long long i = 0; i < 26; i++) cin >> arr[i];
cin >> s;
for (long long i = 0; i < s.size(); i++) {
c += mp[s[i] - 'a'][sum];
sum += arr[s[i] - 'a'];
mp[s[i] - 'a'][sum]++;
}
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = (const int)(1e5 + 11);
int A[33];
int64_t P[MAX];
map<int64_t, int> M[33];
vector<int> all[33];
static void solve(std::int32_t test) {
memset(P, 0, sizeof(P));
for (int i = 0; i < 33; ++i) {
M[i].clear();
all[i].clear();
}
for (int i = 0; i < 26; ++i) cin >> A[i];
string S;
cin >> S;
for (int i = 0; i < S.length(); ++i) all[S[i] - 'a'].push_back(i);
for (int i = 0; i < S.length(); ++i) P[i + 1] = P[i] + A[S[i] - 'a'];
int64_t res = 0;
for (int i = 0; i < 26; ++i) {
auto &m = M[i];
for (const auto &j : all[i]) {
res += m[P[j] - A[S[j] - 'a']];
m[P[j]]++;
}
}
cout << res;
}
int main() {
ios_base::sync_with_stdio(0);
cout << setprecision(12) << fixed;
solve(0);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void reader(int *x) {
int k, m = 0;
*x = 0;
for (;;) {
(k) = getchar();
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
*x = k - '0';
break;
}
}
for (;;) {
(k) = getchar();
if (k < '0' || k > '9') break;
*x = (*x) * 10 + k - '0';
}
if (m) (*x) = -(*x);
}
void reader(long long *x) {
int k, m = 0;
*x = 0;
for (;;) {
(k) = getchar();
if (k == '-') {
m = 1;
break;
}
if ('0' <= k && k <= '9') {
*x = k - '0';
break;
}
}
for (;;) {
(k) = getchar();
if (k < '0' || k > '9') break;
*x = (*x) * 10 + k - '0';
}
if (m) (*x) = -(*x);
}
void reader(double *x) { scanf("%lf", x); }
int reader(char c[]) {
int i, s = 0;
for (;;) {
(i) = getchar();
if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) break;
}
c[s++] = i;
for (;;) {
(i) = getchar();
if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break;
c[s++] = i;
}
c[s] = '\0';
return s;
}
template <class T, class S>
void reader(T *x, S *y) {
reader(x);
reader(y);
}
template <class T, class S, class U>
void reader(T *x, S *y, U *z) {
reader(x);
reader(y);
reader(z);
}
template <class T, class S, class U, class V>
void reader(T *x, S *y, U *z, V *w) {
reader(x);
reader(y);
reader(z);
reader(w);
}
void writer(int x, char c) {
int s = 0, m = 0;
char f[10];
if (x < 0) m = 1, x = -x;
while (x) f[s++] = x % 10, x /= 10;
if (!s) f[s++] = 0;
if (m) putchar('-');
while (s--) putchar(f[s] + '0');
putchar(c);
}
void writer(long long x, char c) {
int s = 0, m = 0;
char f[20];
if (x < 0) m = 1, x = -x;
while (x) f[s++] = x % 10, x /= 10;
if (!s) f[s++] = 0;
if (m) putchar('-');
while (s--) putchar(f[s] + '0');
putchar(c);
}
void writer(double x, char c) {
printf("%.15f", x);
putchar(c);
}
void writer(const char c[]) {
int i;
for (i = 0; c[i] != '\0'; i++) putchar(c[i]);
}
void writer(const char x[], char c) {
int i;
for (i = 0; x[i] != '\0'; i++) putchar(x[i]);
putchar(c);
}
template <class T>
void writerLn(T x) {
writer(x, '\n');
}
template <class T, class S>
void writerLn(T x, S y) {
writer(x, ' ');
writer(y, '\n');
}
template <class T, class S, class U>
void writerLn(T x, S y, U z) {
writer(x, ' ');
writer(y, ' ');
writer(z, '\n');
}
template <class T>
void writerArr(T x[], int n) {
int i;
if (!n) {
putchar('\n');
return;
}
for (i = 0; i < n - 1; i++) writer(x[i], ' ');
writer(x[n - 1], '\n');
}
char memarr[17000000];
void *mem = memarr;
template <class T>
struct ullHash {
unsigned long long *key;
T *val;
unsigned memory, size, mask;
void clear() { memset(val, 0, size * sizeof(T)); }
void clear(int sz) {
size = 1;
while (size < sz) size *= 2;
mask = size - 1;
clear();
}
void init(int mem, int sz) {
memory = mem;
size = 1;
while (size < sz) size *= 2;
mask = size - 1;
if (memory < size) memory = size;
key = (unsigned long long *)malloc(memory * sizeof(unsigned long long));
val = (T *)malloc(memory * sizeof(T));
if (size) clear();
}
int function(unsigned long long a) {
return (((a * 123456789789ULL) >> 32) * 987654321321ULL) & mask;
}
T get(unsigned long long a) {
int i = function(a);
for (; key[i] != a && val[i] != 0;) i = (i + 1) & mask;
if (key[i] != a) return 0;
return val[i];
}
void set(unsigned long long a, T v) {
int i = function(a);
for (; key[i] != a && val[i] != 0;) i = (i + 1) & mask;
key[i] = a;
val[i] = v;
}
T increase(unsigned long long a, T v = 1) {
int i = function(a);
for (; key[i] != a && val[i] != 0;) i = (i + 1) & mask;
key[i] = a;
return val[i] += v;
}
};
int N;
int X[26];
long long sum[110000];
char S[110000];
int main() {
int i, j, k;
long long res = 0;
ullHash<int> hs;
for (i = 0; i < 26; i++) reader(X + i);
N = reader(S);
sum[0] = 0;
for (i = 0; i < N; i++) sum[i + 1] = sum[i] + X[S[i] - 'a'];
hs.init(150000, 150000);
for (k = 0; k < 26; k++) {
hs.clear(150000);
for (i = 0; i < N; i++)
if (S[i] == 'a' + k) {
res += hs.get(sum[i] - X[k]);
hs.increase(sum[i]);
}
}
writerLn(res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int d[300];
map<long long, long long> mp[10005];
int main() {
string s;
int i, j;
long long res = 0;
long long t = 0;
for (i = 0; i < 26; i++) {
scanf("%d", &d['a' + i]);
}
cin >> s;
for (i = 0; i < s.length(); i++) {
long long c = s[i];
res += mp[c][t];
t += d[c];
mp[c][t]++;
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[27];
string str;
for (int i = 0; i < 26; i++) scanf("%d", &arr[i]);
cin >> str;
map<pair<char, long long>, long long> m;
long long sum = 0;
int len = str.length();
long long ans = 0;
for (int i = 0; i < len - 1; i++) {
sum += arr[str[i] - 97];
if (m.count(make_pair(str[i], sum)))
m[make_pair(str[i], sum)]++;
else
m[make_pair(str[i], sum)] = 1;
if (m.count(make_pair(str[i + 1], sum)))
ans += m[make_pair(str[i + 1], sum)];
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
vector<long long> x;
string y;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
x.push_back(0);
for (long long i = 0; i < 26; i++) {
long long k;
cin >> k;
x.push_back(k);
};
cin >> y;
long long sum = 0;
map<long long, vector<long long> > p;
long long ans = 0;
for (long long i = 0; i < (long long)y.size() - 1; i++) {
long long z = (y[i] - 'a') + 1;
long long q = (y[i + 1] - 'a') + 1;
sum += x[z];
if (q == z) {
ans++;
}
if (p.find(sum) == p.end()) {
vector<long long> r(28, 0);
r[z]++;
p[sum] = r;
continue;
}
ans += p[sum][q];
p[sum][z]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int ALNUM = 26;
const int MAXN = 100005;
int score[ALNUM];
char str[MAXN];
long long sum[MAXN];
long long ans;
vector<int> vec[ALNUM];
map<long long, long long> mp;
void Init();
void Cal(int);
int main() {
while (scanf("%d", &score[0]) != EOF) {
for (int i = 1; i < ALNUM; i++) scanf("%d", &score[i]);
scanf("%s", str);
Init();
for (int i = 0; i < ALNUM; i++) Cal(i);
cout << ans << endl;
}
return 0;
}
void Init() {
ans = 0;
for (int i = 0; i < ALNUM; i++) vec[i].clear();
sum[0] = score[str[0] - 'a'];
for (int i = 1; str[i] != '\0'; i++)
sum[i] = sum[i - 1] + score[str[i] - 'a'];
for (int i = 0; str[i] != '\0'; i++) vec[str[i] - 'a'].push_back(i);
return;
}
void Cal(int n) {
mp.clear();
int siz = vec[n].size();
for (int i = 0; i < siz; i++) {
long long val = sum[vec[n][i]];
if (mp.count(val - score[n])) ans += mp[val - score[n]];
if (mp.count(val))
mp[val]++;
else
mp[val] = 1;
}
return;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[30], b[100005];
long long summ[1000005];
char s[100005];
unordered_map<long long, unordered_map<long long, long long> > mp;
unordered_map<long long, long long> mpp;
int main() {
long long n, m, i, j, k, ans, num, sum;
for (i = 1; i <= 26; i++) scanf("%lld", &a[i]);
scanf("%s", s + 1);
n = strlen(s + 1);
ans = 0;
for (i = 1; i <= n; i++) {
summ[i] = summ[i - 1] + a[s[i] - 'a' + 1];
ans += mp[summ[i] - a[s[i] - 'a' + 1]][s[i] - 'a' + 1];
mp[summ[i]][s[i] - 'a' + 1]++;
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, len, alpha[26];
for (i = 0; i < 26; i++) cin >> alpha[i];
long long ans = 0, sum = 0;
string str;
cin >> str;
len = str.length();
map<long long, long long> m[26];
for (i = 0; i < len; i++) {
int x = str[i] - 'a';
ans += m[x][sum];
m[x][sum += alpha[x]]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long> x(26);
for (int i = 0; i < 26; ++i) {
cin >> x[i];
}
string s;
cin >> s;
int n = s.length();
vector<long long> pre(n);
vector<vector<int>> pos(26);
for (int i = 0; i < n; ++i) {
pre[i] = x[s[i] - 'a'] + (i > 0 ? pre[i - 1] : 0LL);
pos[s[i] - 'a'].push_back(i);
}
long long ans = 0;
for (int i = 0; i < 26; ++i) {
map<long long, long long> mp;
for (int j : pos[i]) mp[pre[j]]++;
for (int j : pos[i]) {
mp[pre[j]]--;
ans += mp[pre[j] + x[i]];
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 7;
const long double eps = 1e-7;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int dx[8] = {+1, +1, +1, 0, 0, -1, -1, -1};
int dy[8] = {+1, 0, -1, +1, -1, +1, 0, -1};
long long power(long long x, long long y) {
long long res = 1;
x = x;
while (y > 0) {
if (y & 1) res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
template <typename T>
T gcd(T a, T mp) {
if (a == 0) return mp;
return gcd(mp % a, a);
}
template <typename T>
T powm(T a, T mp, long long m) {
T cnt = 1;
while (mp > 0) {
if (mp % 2 == 1) cnt = (cnt * a) % m;
mp /= 2;
a = (a * a) % m;
}
return cnt % m;
}
long long ncr(long long n, long long r) {
long long res = 1;
if (r > n) return 0;
if (r > n - r) r = n - r;
for (long long i = 0; i < r; i++) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
long long sqr(long long x) { return x * x; }
void prec() {}
long long pre[N], ans;
void run() {
long long a[26];
for (long long i = (0); i <= (25); ++i) cin >> a[i];
string s;
cin >> s;
int n = (long long)s.size();
s = '?' + s;
for (int i = 1; i <= n; ++i) pre[i] = pre[i - 1] + a[s[i] - 'a'];
for (char ch = 'a'; ch <= 'z'; ch++) {
map<long long, long long> now;
long long ct = 0;
for (long long i = 1; i <= n; i++) {
if (s[i] != ch) continue;
ct++;
ans += now[pre[i] - a[s[i] - 'a']];
now[pre[i]]++;
}
now.clear();
}
cout << ans;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int tc = 1;
prec();
for (long long i = 0; i < tc; ++i) run();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int inf = 2e9 + 5;
const int N = 1e5;
int cost[26];
map<long long, long long> m[26];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
for (int i = 0; i < 26; i++) cin >> cost[i];
string s;
cin >> s;
long long n = s.length(), sum = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
ans += m[s[i] - 'a'][sum];
sum += cost[s[i] - 'a'];
m[s[i] - 'a'][sum] += 1;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int alf[26];
bool input() {
for (int i = 0; i < 26; i++) {
if (!(cin >> alf[i])) return false;
}
return true;
}
long long solve(string s) {
int length = s.length();
long long *p = new long long[length];
p[0] = alf[s[0] - 'a'];
for (int i = 1; i < length; i++) {
p[i] = p[i - 1] + alf[s[i] - 'a'];
}
map<long long, long long> m[26];
long long ans = 0;
m[s[0] - 'a'][p[0]] = 1;
for (int i = 1; i < length; i++) {
int alfidx = s[i] - 'a';
ans += m[alfidx][p[i - 1]];
m[alfidx][p[i]]++;
}
delete p;
return ans;
}
int main() {
while (input()) {
string s;
cin >> s;
cout << solve(s) << endl;
}
}
|
#include <bits/stdc++.h>
inline unsigned int getuint() {
char w = getchar();
while (w < '0' || '9' < w) w = getchar();
unsigned int ans = 0;
for (; '0' <= w && w <= '9'; w = getchar()) ans = ans * 10 + w - '0';
return ans;
}
inline int getint() {
char w = getchar(), last = '?';
for (; w < '0' || '9' < w; w = getchar()) last = w;
unsigned int ans = 0;
for (; '0' <= w && w <= '9'; w = getchar()) ans = ans * 10 + w - '0';
return last != '-' ? ans : -ans;
}
int a[26];
char str[100005];
long long sum[100005];
std::map<std::pair<long long, char>, int> Map;
int main() {
int m = 26;
for (int i = 0; i < m; i++) a[i] = getint();
scanf("%s", str + 1);
int n = strlen(str + 1);
long long ans = 0;
for (int i = 1; i < n; i++)
Map[std::make_pair(sum[i] = sum[i - 1] + a[str[i] - 'a'], str[i])]++,
ans += Map[std::make_pair(sum[i], str[i + 1])];
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct temp {
unordered_map<long long, int> mp;
};
int main() {
ios_base::sync_with_stdio(false);
long long sum = 0, ans = 0;
vector<int> val(26);
string str;
temp mpc[26];
for (int i = 0; i < 26; i++) cin >> val[i];
cin >> str;
for (int i = 0; i < str.size(); i++) {
int ch = str[i] - 'a';
if (mpc[ch].mp[sum] != 0) ans += mpc[ch].mp[sum];
sum += val[ch];
mpc[ch].mp[sum]++;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int tt;
vector<long long int> mark(100001, 1);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
vector<long long int> val(26);
for (long long int i = 0; i < 26; i++) {
cin >> val[i];
}
string ch;
cin >> ch;
long long int n = ch.length();
map<pair<long long int, long long int>, long long int> mp;
long long int x = 0;
for (long long int i = 0; i < n; i++) {
long long int idx = (ch[i] - 'a');
x = x + val[idx];
mp[{idx, x}]++;
}
long long int ans = 0;
x = 0;
for (long long int i = 0; i < n; i++) {
long long int idx = (ch[i] - 'a');
x = x + val[idx];
mp[{idx, x}]--;
if (mp.find({idx, (x + val[idx])}) != mp.end()) {
ans = ans + mp[{idx, (x + val[idx])}];
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int val[26], pt1 = 1, pt2 = 2, inplen;
long long cumval[100005], ans = 0;
char inp[100005];
map<long long, map<long long, long long> > lookup;
int main() {
for (int q = 0; q < 26; q++) cin >> val[q];
cin >> inp;
inplen = strlen(inp);
for (int q = 0; q < inplen; q++) {
cumval[q] = val[inp[q] - 'a'];
if (q > 0) cumval[q] += cumval[q - 1];
if (q > 0) {
ans += lookup[cumval[q - 1]][inp[q] - 'a'];
}
lookup[cumval[q]][inp[q] - 'a']++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100000, A = 26;
char cc[N + 1];
int xx[A];
long long pp[N];
map<long long, int> mp[A];
int main() {
for (int a = 0; a < A; a++) cin >> xx[a];
cin >> cc;
int n = strlen(cc);
pp[0] = xx[cc[0] - 'a'];
for (int i = 1; i < n; i++) pp[i] = pp[i - 1] + xx[cc[i] - 'a'];
long long ans = 0;
for (int i = 0; i < n; i++) {
if (i > 0) ans += mp[cc[i] - 'a'][pp[i - 1]];
mp[cc[i] - 'a'][pp[i]]++;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long A[N], v[N];
map<long long, long long> m[26];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
for (int i = 0; i < 26; i++) cin >> v[i];
string s;
cin >> s;
A[0] = v[s[0] - 'a'];
m[s[0] - 'a'][A[0]]++;
long long ans = 0;
for (int i = 1; i < s.length(); i++) {
A[i] = A[i - 1] + v[s[i] - 'a'];
ans += (m[s[i] - 'a'][A[i] - v[s[i] - 'a']]);
m[s[i] - 'a'][A[i]]++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
int a[33];
string s;
int main() {
for (int i = 0; i < 26; ++i) scanf("%d", &a[i]);
cin >> s;
int len = s.length();
vector<long long> v(len + 1);
for (int i = 0; i < len; ++i) {
v[i + 1] = a[s[i] - 'a'] + v[i];
}
map<pair<int, long long>, int> m;
long long res = 0;
for (int i = 0; i < len; i++) {
if (m[make_pair(s[i] - 'a', v[i + 1])]) {
res += m[make_pair(s[i] - 'a', v[i + 1])];
}
m[make_pair(s[i] - 'a', v[i + 1] + a[s[i] - 'a'])]++;
}
cout << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 6;
int a[421];
map<long long int, long long int> m[27];
long long int su = 0;
int main() {
for (int i = 1; i <= 26; i++) cin >> a[i];
long long int ans = 0;
string s;
cin >> s;
for (int i = 0; i < s.length(); ++i) {
ans += m[s[i] - 'a' + 1][su];
su += a[s[i] - 'a' + 1];
m[s[i] - 'a' + 1][su]++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
long long sum[100005];
map<long long, int> M['z' + 1];
char s[100005];
long long val['z' + 1];
int main() {
long long x;
for (int i = 0; i < 26; i++) {
scanf("%I64d", &x);
val['a' + i] = x;
}
scanf("%s", s + 1);
int len = strlen(s + 1);
for (int i = 1; i <= len; i++) {
sum[i] = sum[i - 1] + val[s[i]];
}
long long ans = 0;
for (int i = 1; i <= len; i++) {
ans += M[s[i]][sum[i - 1]];
M[s[i]][sum[i]]++;
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7, INF = 9e18;
long long a[26], sum, ans;
string s;
map<pair<long long, char>, long long> m;
long long pw(long long a, long long b) {
long long res = 0;
if (b == 0) return 1;
if (b % 2 == 0) {
res = pw(a, b / 2);
return res * res;
} else {
res = pw(a, (b - 1) / 2);
return a * res * res;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
for (int i = 0; i < 26; ++i) cin >> a[i];
cin >> s;
++m[make_pair(0, s[0])];
for (int i = 1; i < s.size() - 1; ++i) {
sum += a[s[i] - 97];
ans += m[make_pair(sum, s[i + 1])];
++m[make_pair(sum, s[i])];
}
for (int i = 0; i < s.size() - 1; ++i)
if (s[i] == s[i + 1]) ++ans;
cout << ans;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.