#include <cstring> #include <cstdio> #include <map> const int max_n = 400000; char input[max_n]; int n; std::map<long long, int> bilans; int main() { scanf("%s", &input); n = strlen(input); long long count = 0, curr = 0; bilans[0] = 1; for (int i = 0; i < n; ++i) { if (input[i] == 'a') curr -= max_n + 1; if (input[i] == 'b') curr += 1; if (input[i] == 'c') curr += max_n; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'a') curr -= 1; if (input[i] == 'b') curr += 1; if (input[i] == 'c') curr += max_n; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'a') curr -= 1; if (input[i] == 'c') curr += 1; if (input[i] == 'b') curr += max_n; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'c') curr -= 1; if (input[i] == 'b') curr += 1; if (input[i] == 'a') curr += max_n; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'c') curr += 1; if (input[i] == 'a') curr += 1; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'a') curr += 1; if (input[i] == 'b') curr += 1; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'c') curr += 1; if (input[i] == 'b') curr += 1; count += bilans[curr]; ++bilans[curr]; } printf("%lld\n", count); return 0; }
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 | #include <cstring> #include <cstdio> #include <map> const int max_n = 400000; char input[max_n]; int n; std::map<long long, int> bilans; int main() { scanf("%s", &input); n = strlen(input); long long count = 0, curr = 0; bilans[0] = 1; for (int i = 0; i < n; ++i) { if (input[i] == 'a') curr -= max_n + 1; if (input[i] == 'b') curr += 1; if (input[i] == 'c') curr += max_n; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'a') curr -= 1; if (input[i] == 'b') curr += 1; if (input[i] == 'c') curr += max_n; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'a') curr -= 1; if (input[i] == 'c') curr += 1; if (input[i] == 'b') curr += max_n; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'c') curr -= 1; if (input[i] == 'b') curr += 1; if (input[i] == 'a') curr += max_n; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'c') curr += 1; if (input[i] == 'a') curr += 1; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'a') curr += 1; if (input[i] == 'b') curr += 1; count += bilans[curr]; ++bilans[curr]; } bilans.clear(); bilans[0] = 1; curr = 0; for (int i = 0; i < n; ++i) { if (input[i] == 'c') curr += 1; if (input[i] == 'b') curr += 1; count += bilans[curr]; ++bilans[curr]; } printf("%lld\n", count); return 0; } |