#include <bits/stdc++.h> using namespace std; //{ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define FORD(i, a, b) for(int i = (a); i >= (b); --i) #define VAR(v, i) __typeof(i) v=(i) #define all(v) (v).begin(),(v).end() #define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PII pair<int,int> #define st first #define nd second #define pb push_back #define lint long long int #define VI vector<int> #define sim template < class c #define ris return * this #define dor > debug & operator << #define eni(x) sim > typename \ enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...); struct debug { ~debug() { cerr << endl; } eni(!=) cerr << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } }; //{ #define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] " #define make( x) int (x); scanf("%d",&(x)); #define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y)); #define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z)); #define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t)); #define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} #define IOS ios_base::sync_with_stdio(0) #define HEAP priority_queue #define read( x) scanf("%d",&(x)); #define read2( x, y) scanf("%d%d",&(x),&(y)); #define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z)); #define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t)); #define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);} #define jeb() fflush(stdout); //} int n; char s[300005]; lint ans = 0; void jedna(int a, int b, int mid) { int left = mid; int right = mid; char C = s[mid]; while (left-1 >= a && s[left-1] == C) left--; while (right+1 < b && s[right+1] == C) right++; ans += (mid - left+1) * 1LL * (right - mid); } void rozne(int a, int b, int mid, char C1, char C2) { char zle = 'a'; while (zle == C1 || zle == C2) zle++; unordered_map<int, int> m1; int d1 = 0; for (int i = mid; i >= a; i--) { if (s[i] == zle) break; if (s[i] == C1) d1++; if (s[i] == C2) d1--; m1[d1]++; } d1 = 0; for (int i = mid+1; i < b; i++) { if (s[i] == zle) break; if (s[i] == C1) d1++; if (s[i] == C2) d1--; ans += m1[-d1]; } } void dwie(int a, int b, int mid) { char C = s[mid]; if (s[mid+1] != C) rozne(a,b,mid,C,s[mid+1]); else { for (char C2 = 'a'; C2 != 'd'; C2++) { if (C != C2) rozne(a,b,mid,C,C2); } } } lint code(int d1, int d2) { return (d1 + n) * 1LL * (2*n) + d2 + n; } void trzy(int a, int b, int mid) { map<lint, int> m1; int d1 = 0, d2 = 0; for (int i = mid; i >= a; i--) { if (s[i] == 'a') d1++,d2++; if (s[i] == 'b') d1--; if (s[i] == 'c') d2--; m1[code(d1,d2)]++; } d1 = 0, d2 = 0; for (int i = mid+1; i < b; i++) { if (s[i] == 'a') d1++,d2++; if (s[i] == 'b') d1--; if (s[i] == 'c') d2--; ans += m1[code(-d1,-d2)]; } } void doit(int a, int b) { if (a >= b) return; if (b-a == 1) { ans += 1; return; } int mid = (a + b - 1) / 2; doit(a, mid+1); doit(mid+1, b); // zawierajace oba mid, mid+1 jedna(a, b, mid); dwie(a, b, mid); trzy(a, b, mid); } int main() { scanf("%s", s); n = strlen(s); doit(0, n); printf("%lld\n", ans); }
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 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 | #include <bits/stdc++.h> using namespace std; //{ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define FORD(i, a, b) for(int i = (a); i >= (b); --i) #define VAR(v, i) __typeof(i) v=(i) #define all(v) (v).begin(),(v).end() #define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PII pair<int,int> #define st first #define nd second #define pb push_back #define lint long long int #define VI vector<int> #define sim template < class c #define ris return * this #define dor > debug & operator << #define eni(x) sim > typename \ enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...); struct debug { ~debug() { cerr << endl; } eni(!=) cerr << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } }; //{ #define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] " #define make( x) int (x); scanf("%d",&(x)); #define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y)); #define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z)); #define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t)); #define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} #define IOS ios_base::sync_with_stdio(0) #define HEAP priority_queue #define read( x) scanf("%d",&(x)); #define read2( x, y) scanf("%d%d",&(x),&(y)); #define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z)); #define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t)); #define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);} #define jeb() fflush(stdout); //} int n; char s[300005]; lint ans = 0; void jedna(int a, int b, int mid) { int left = mid; int right = mid; char C = s[mid]; while (left-1 >= a && s[left-1] == C) left--; while (right+1 < b && s[right+1] == C) right++; ans += (mid - left+1) * 1LL * (right - mid); } void rozne(int a, int b, int mid, char C1, char C2) { char zle = 'a'; while (zle == C1 || zle == C2) zle++; unordered_map<int, int> m1; int d1 = 0; for (int i = mid; i >= a; i--) { if (s[i] == zle) break; if (s[i] == C1) d1++; if (s[i] == C2) d1--; m1[d1]++; } d1 = 0; for (int i = mid+1; i < b; i++) { if (s[i] == zle) break; if (s[i] == C1) d1++; if (s[i] == C2) d1--; ans += m1[-d1]; } } void dwie(int a, int b, int mid) { char C = s[mid]; if (s[mid+1] != C) rozne(a,b,mid,C,s[mid+1]); else { for (char C2 = 'a'; C2 != 'd'; C2++) { if (C != C2) rozne(a,b,mid,C,C2); } } } lint code(int d1, int d2) { return (d1 + n) * 1LL * (2*n) + d2 + n; } void trzy(int a, int b, int mid) { map<lint, int> m1; int d1 = 0, d2 = 0; for (int i = mid; i >= a; i--) { if (s[i] == 'a') d1++,d2++; if (s[i] == 'b') d1--; if (s[i] == 'c') d2--; m1[code(d1,d2)]++; } d1 = 0, d2 = 0; for (int i = mid+1; i < b; i++) { if (s[i] == 'a') d1++,d2++; if (s[i] == 'b') d1--; if (s[i] == 'c') d2--; ans += m1[code(-d1,-d2)]; } } void doit(int a, int b) { if (a >= b) return; if (b-a == 1) { ans += 1; return; } int mid = (a + b - 1) / 2; doit(a, mid+1); doit(mid+1, b); // zawierajace oba mid, mid+1 jedna(a, b, mid); dwie(a, b, mid); trzy(a, b, mid); } int main() { scanf("%s", s); n = strlen(s); doit(0, n); printf("%lld\n", ans); } |