Codeforces Round #258 (Div. 2) D

D. Count Good Substrings

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

We call a string good, if after merging all the consecutive equal characters, the resulting string is palindrome. For example, "aabba" is good, because after the merging step it will become "aba".

Given a string, you have to find two values:

1. the number of good substrings of even length;
2. the number of good substrings of odd length.

Input

The first line of the input contains a single string of length n (1 ≤ n ≤ 105). Each character of the string will be either 'a' or 'b'.

Output

Print two space-separated integers: the number of good substrings of even length and the number of good substrings of odd length.

Sample test(s)

input

bb

output

1 2

input

baab

output

2 4

input

babb

output

2 5

input

babaa

output

2 7

sl ：分析发现最后回文串的第一个字符和第二个字符相同，这样统计相应数位上的字符就行了。

 1 //by caonima
 2 //hehe
 3 #include <bits/stdc++.h>
 4 typedef long long LL;
 5 const int MAX = 1e5+;
 6 char str[MAX];
 7 LL even_cnt[],odd_cnt[];
 8 // odd ji even o
 9 int main() {
     LL odd,even;
     while(scanf("%s",str+)==) {
         memset(even_cnt,,sizeof(even_cnt));
         memset(odd_cnt,,sizeof(odd_cnt));
         int n=strlen(str+);
         odd=even=;
         for(int i=;i<=n;i++) {
             int x=str[i]-'a';
             if(i&) {
                 odd+=odd_cnt[x];
                 even+=even_cnt[x];
                 odd_cnt[x]++;
             }
             else {
                 odd+=even_cnt[x];
                 even+=odd_cnt[x];
                 even_cnt[x]++;
             }
         }
         odd+=n;
         printf("%I64d %I64d\n",even,odd);
     }
     return ;

33 }