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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
// Daniel Grzegorzewski
// while (clock()<=69*CLOCKS_PER_SEC)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")

#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define int long long

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

//X.find_by_order(k); - zwraca iterator na k-ty element (numeracja od zerowego)
//X.order_of_key(k); - zwraca liczbę elementów ostro mniejszych niż k

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef long long LL;

void init_ios() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
}

auto random_address = [] { char *p = new char; delete p; return uint64_t(p); };
 
const uint64_t SEED = chrono::steady_clock::now().time_since_epoch().count() * (random_address() | 1);
mt19937_64 rng(SEED);

const int N = 3*(int)1e5 + 3;

int n, res, dp[N];
string s;

signed main() {
  init_ios();
  cin >> s;
  n = (int)s.size();
  for (int i = 0; i < n; ++i) {
    dp[i] = 1;
    if (i > 0 && s[i] == s[i-1])
      dp[i] += dp[i-1];
    res += dp[i];
  }
  vector<PII> v{{'a', 'b'}, {'a', 'c'}, {'b', 'c'}};
  for (auto el: v) {
    map<int, int> cnt;
    cnt[0] = 1;
    int cur = 0;
    for (char c: s) {
      if (c != el.ST && c != el.ND) {
        cnt.clear();
        cnt[0] = 1;
        cur = 0;
        continue;
      }
      if (c == el.ST) {
        ++cur;
      } else {
        --cur;
      }
      res += cnt[cur]++;
    }
  }
  map<PII, int> cnt;
  PII cur;
  cnt[cur] = 1;
  for (char c: s) {
    if (c == 'a') {
      ++cur.ST;
    }
    else if (c == 'b') {
      ++cur.ND;
    }
    else {
      cur.ST--;
      cur.ND--;
    }
    res += cnt[cur]++;
  }
  cout<<res<<"\n";
}