codeforces 451D 会YY就能A

最新推荐文章于 2020-10-15 16:50:13 发布

x920405451x

最新推荐文章于 2020-10-15 16:50:13 发布

阅读量720

点赞数

分类专栏： YY 文章标签： codeforces

本文链接：https://blog.csdn.net/x920405451x/article/details/38114057

版权

YY 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

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:

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

Input

The first line of the input contains a single string of length n (1 ≤ n ≤ 10⁵). 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

Note

In example 1, there are three good substrings ("b", "b", and "bb"). One of them has even length and two of them have odd length.

In example 2, there are six good substrings (i.e. "b", "a", "a", "b", "aa", "baab"). Two of them have even length and four of them have odd length.

In example 3, there are seven good substrings (i.e. "b", "a", "b", "b", "bb", "bab", "babb"). Two of them have even length and five of them have odd length.

Definitions

A substring s[l, r] (1 ≤ l ≤ r ≤ n) of string s = s₁s₂... s_n is string s_ls_l + 1... s_r.

A string s = s₁s₂... s_n is a palindrome if it is equal to string s_ns_n - 1... s₁.

这是昨天晚上的CF的第四题，要求偶数和奇数长度的good substring。

比赛时候没做出来。加上晚上1点多了，有点困了，所以没有YY出来，赛后看了题解顿时傻了，为什么可以这么神。

一个重要的发现：如果一个串的首尾相同，那么这个串一定是good substring，仔细想一想就能发现。

所以如果当前位是a，只要统计一下a在奇偶位出现的次数就行了。

其实比起YY题，我更喜欢做算法题。。。不吐槽的，还是自己太菜

代码

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <ctime>
typedef long long ll;
//#pragma comment(linker, "/STACK:1024000000,1024000000")  
#define INF 1e9
#define maxn 500
#define maxm 100086+10
#define mod 1000000007
#define eps 1e-7
#define PI acos(-1.0)
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define scan(n) scanf("%d",&n)
#define scanll(n) scanf("%I64d",&n)
#define scan2(n,m) scanf("%d%d",&n,&m)
#define scans(s) scanf("%s",s);
#define ini(a) memset(a,0,sizeof(a))
#define out(n) printf("%d\n",n)
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt","r",stdin);
	//      freopen("out.txt","w",stdout);
#endif
	string s;
	cin>>s;
	int len = s.length();
	ll a = 0,b = 0;
	ll dp[2][2]={0};
	rep(i,len)
	{
		dp[i&1][s[i]-'a'] ++;
		a += dp[!(i&1)][s[i]-'a']; //偶数
		b += dp[i&1][s[i]-'a'];  //奇数
	}
	cout<<a<<' '<<b<<endl;

	return 0;
}