1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <bits/stdc++.h>
#define dbg(x) " [" << #x << ": " << (x) << "] "
using namespace std;
template<typename A,typename B>
ostream& operator<<(ostream& out,const pair<A,B>& p) {
    return out << "(" << p.first << ", " << p.second << ")";
}
template<typename T>
ostream& operator<<(ostream& out,const vector<T>& c) {
    out << "{";
    for(auto it = c.begin(); it != c.end(); it++) {
        if(it != c.begin()) out << ", ";
        out << *it;
    }
    return out << "}";
}
void solve() {
    string s;
    cin >> s;
    int n = s.length();
    long long sm1 = 0,sm2 = 0,sm3 = 0,A = 0,B = 0,C = 0;
    long long mod = 3e5 + 1;
    map<long long,int> mp,mpa,mpb,mpc;
    mp[0] = 1;
    mpa[0] = 1;
    mpb[0] = 1;
    mpc[0] = 1;
    long long ans = 0;
    vector<int> v(n);
    for(int i = 0; i < n; i++) {
        if(s[i] == 'a') {
            sm1++;
            sm2++;
            B++;
            C++;
            A += mod;
        } else if(s[i] == 'b') {
            sm1--;
            A++;
            C--;
            B += mod;
        } else {
            sm2--;
            A--;
            B--;
            C += mod;
        }
        ans += mp[sm1 + mod * sm2]++;
        if(i && s[i] == s[i - 1]) {
            v[i] = v[i - 1];
        } else {
            v[i] = i;
        }
        ans += i - v[i] + 1;
        ans += mpa[A]++;
        ans += mpb[B]++;
        ans += mpc[C]++;
    }
    cout << ans << endl;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int testNum = 1;
    //cin >> testNum;
    for(int i = 1; i <= testNum; i++) {
        solve();
    }
    return 0;
}