E. Palisection
time limit per test

2 seconds

memory limit per test

128 megabytes

input

standard input

output

standard output

In an English class Nick had nothing to do at all, and remembered about wonderful strings called palindromes. We should remind you that a string is called a palindrome if it can be read the same way both from left to right and from right to left. Here are examples of such strings: «eye», «pop», «level», «aba», «deed», «racecar», «rotor», «madam».

Nick started to look carefully for all palindromes in the text that they were reading in the class. For each occurrence of each palindrome in the text he wrote a pair — the position of the beginning and the position of the ending of this occurrence in the text. Nick called each occurrence of each palindrome he found in the text subpalindrome. When he found all the subpalindromes, he decided to find out how many different pairs among these subpalindromes cross. Two subpalindromes cross if they cover common positions in the text. No palindrome can cross itself.

Let's look at the actions, performed by Nick, by the example of text «babb». At first he wrote out all subpalindromes:

• «b» — 1..1 • «bab» — 1..3 • «a» — 2..2 • «b» — 3..3 • «bb» — 3..4 • «b» — 4..4

Then Nick counted the amount of different pairs among these subpalindromes that cross. These pairs were six:

1. 1..1 cross with 1..3 2. 1..3 cross with 2..2 3. 1..3 cross with 3..3 4. 1..3 cross with 3..4 5. 3..3 cross with 3..4 6. 3..4 cross with 4..4

Since it's very exhausting to perform all the described actions manually, Nick asked you to help him and write a program that can find out the amount of different subpalindrome pairs that cross. Two subpalindrome pairs are regarded as different if one of the pairs contains a subpalindrome that the other does not.

Input

The first input line contains integer n (1 ≤ n ≤ 2·106) — length of the text. The following line contains n lower-case Latin letters (from a to z).

Output

In the only line output the amount of different pairs of two subpalindromes that cross each other. Output the answer modulo 51123987.

Examples
Input
4
babb
Output
6
Input
2
aa
Output
2
大致题意:求相交的回文子串有多少个.
分析:相交的回文子串的数量=总数量-不相交的回文子串的数量,这里的总数量指的是有多少对.那么如何求不相交的回文子串的数量呢?比较常见的套路,类似bzoj2565,将中心转移到两边,也就是记录以i为左端点结尾的回文子串有多少个,以i为右端点结尾的回文子串有多少个.那么每处理到一个i,就要更新i-r[i]到i的左端点值,i到i+r[i]的右端点值,很多次区间操作,可以用差分快速维护.
Manacher算法非常容易错的就是插入字符的讨论.最后答案的统计肯定实在实际字符上的,要将插入字符的答案转移到实际字符上来,对此要进行分类讨论,看这一位到底是实际字符还是插入字符.差分完后对实际字符做一次前缀和.这样可以得到每个的值.再对右端点做一次后缀和.这样就可以通过乘法原理和加法原理累计答案了.
Manacher算法的经典变形:中间变到两边. 易错点:对+1,-1的考虑,插入字符的分类讨论. 要点:统计答案是统计实际字符的答案.
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm> using namespace std; typedef long long ll; const int mod = ;
ll n,len,r[],p,mx,f[],g[],ans;
char s[],ss[]; void solve()
{
mx = p = ;
for (int i = ; i <= len; i++)
{
ll x = ;
if (i < mx)
x = min(r[ * p - i],mx - i);
else
x = ;
while (ss[i + x] == ss[i - x])
x++;
r[i] = x;
if (i + x > mx)
{
mx = i + x;
p = i;
}
ans += (x - ) / ;
if (i % == )
ans++;
ans %= mod;
}
ans = (ans - ) * ans / ;
ans %= mod;
} int main()
{
cin >> n;
scanf("%s",s + );
ss[] = '(';
for (int i = ; i <= n; i++)
{
ss[++len] = '#';
ss[++len] = s[i];
}
ss[++len] = '#';
ss[len + ] = ')';
solve();
for (int i = ; i <= len; i += )//差分修改的实际上是回文半径覆盖到的最左边的字符和最右边的字符的右边第一个字符(实际字符)
{
f[i - r[i] + ]++;
f[i + ]--;
g[i]++;
g[i + r[i]]--;
}
for (int i = ; i <= len; i += )
{
f[i - r[i] + ]++;
f[i + ]--;
g[i + ]++;
g[i + r[i]]--;
}
for (int i = ; i <= len; i += )
{
f[i] += f[i - ];
f[i] %= mod;
g[i] += g[i - ];
g[i] %= mod;
}
f[len + ] = ;
for(int i = len - ; i >= ; i -= )
{
f[i] += f[i + ];
f[i] %= mod;
}
f[len + ] = ;
for (int i = ; i <= len; i += )
{
ans -= g[i] * f[i + ] % mod;
ans = (ans + mod) % mod;
}
printf("%I64d\n",(ans % mod + mod) % mod); return ;
}

 

Codeforces 17.E Palisection的更多相关文章

  1. 【Codeforces 17E】Palisection

    Codeforces 17 E 题意:给一个串,求其中回文子串交叉的对数. 思路1:用哈希解决.首先求出每个点左右最长的回文串(要分奇数长度和偶数长度),然后记录经过每个点的回文串的个数,以及它们是在 ...

  2. Codeforces Beta Round #17 C. Balance DP

    C. Balance 题目链接 http://codeforces.com/contest/17/problem/C 题面 Nick likes strings very much, he likes ...

  3. Codeforces Beta Round #17 A - Noldbach problem 暴力

    A - Noldbach problem 题面链接 http://codeforces.com/contest/17/problem/A 题面 Nick is interested in prime ...

  4. Codeforces 17E Palisection 【Manacher】

    Codeforces 17E Palisection E. Palisection In an English class Nick had nothing to do at all, and rem ...

  5. Codeforces Beta Round #17 D. Notepad (数论 + 广义欧拉定理降幂)

    Codeforces Beta Round #17 题目链接:点击我打开题目链接 大概题意: 给你 \(b\),\(n\),\(c\). 让你求:\((b)^{n-1}*(b-1)\%c\). \(2 ...

  6. Educational Codeforces Round 17

    Educational Codeforces Round 17 A. k-th divisor 水题,把所有因子找出来排序然后找第\(k\)大 view code //#pragma GCC opti ...

  7. Codeforces 17E Palisection - Manacher

    题目传送门 传送点I 传送点II 传送点III 题目大意 给定一个串$s$询问,有多少对回文子串有交. 好像很简单的样子. 考虑能不能直接求,感觉有点麻烦.因为要考虑右端点在当前回文子串内还有区间包含 ...

  8. CodeForces 17E Palisection(回文树)

    E. Palisection time limit per test 2 seconds memory limit per test 128 megabytes input standard inpu ...

  9. Educational Codeforces Round 17 颓废记

    又被虐了... (记一次惨痛的Codeforces) 好不容易登上去了Codeforces,22:35准时开打 第一题,一看:这不SB题嘛?直接枚举因数上啊.9min才过掉了pretest 第二题.. ...

随机推荐

  1. 使用经验风险最小化ERM方法来估计模型误差 开坑

    虽然已经学习了许多机器学习的方法,可只有我们必须知道何时何处使用哪种方法,才能将他们正确运用起来. 那不妨使用经验最小化ERM方法来估计 . 首先: 其中, δ代表训练出错的概率 k代表假设类的个数 ...

  2. 原生开发小程序 和 wepy 、 mpvue 对比

    1.三者的开发文档以及介绍: 原生开发小程序文档:点此进入 wepy 开发文档:点此进入 mpvue 开发文档:点此进入 2.三者的简单对比: 以下用一张图来简单概括三者的区别: 小程序支持的是 WX ...

  3. PHPDoc 学习记录

    https://zh.wikipedia.org/wiki/PHPDoc PHPDoc 是一个 PHP 版的 Javadoc.它是一种注释 PHP 代码的正式标准.它支持通过类似 phpDocumen ...

  4. Linux下查看apache连接数

    1.查看apache当前并发访问数: netstat -an | grep ESTABLISHED | wc -l 对比httpd.conf中MaxClients的数字差距多少. 2.查看有多少个进程 ...

  5. Nodejs学习笔记(一)--- 操作Mysql数据库

    对于一门语言的学习,我个人觉得最好的方式就是通过一个项目来展示,所以从基本的一些模块去了解是最好的方式对于Mysql怎么去链接数据库这个我是在网上找到的(其实一直想找官方文档的,发现没有它的踪迹,(后 ...

  6. Microsoft Orleans 之简介

    Microsoft Orleans 在.net用简单方法构建高并发.分布式的大型应用程序框架. 原文:http://dotnet.github.io/orleans/ 在线文档:http://dotn ...

  7. python实现进制之间的转换

    十进制转36进制: #36位映射模板 loop = '0123456789abcdefghijklmnopqrstuvwxyz' # 测试用例输入 n = a = [] : a.append( loo ...

  8. Scrum 项目准备3.0

    SCRUM 流程的步骤2: Spring 计划 1. 确保product backlog井然有序.(参考示例图1) 2. Sprint周期,一个冲刺周期,长度定为两周,本学期还有三个冲刺周期. Spr ...

  9. PAT 甲级 1020 Tree Traversals

    https://pintia.cn/problem-sets/994805342720868352/problems/994805485033603072 Suppose that all the k ...

  10. Maven编译打包出错:找不到符号

    项目中,使用的是maven管理,但是有几个jar不是通过maven引入的,是通过IDEA导入的,在使用maven插件编译的时候,会出现如下的一些错误: 解决方法: 在项目中创建一个目录lib,然后将j ...