Codeforces 17.E Palisection
2 seconds
128 megabytes
standard input
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.
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).
In the only line output the amount of different pairs of two subpalindromes that cross each other. Output the answer modulo 51123987.
4
babb
6
2
aa
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的更多相关文章
- 【Codeforces 17E】Palisection
Codeforces 17 E 题意:给一个串,求其中回文子串交叉的对数. 思路1:用哈希解决.首先求出每个点左右最长的回文串(要分奇数长度和偶数长度),然后记录经过每个点的回文串的个数,以及它们是在 ...
- Codeforces Beta Round #17 C. Balance DP
C. Balance 题目链接 http://codeforces.com/contest/17/problem/C 题面 Nick likes strings very much, he likes ...
- Codeforces Beta Round #17 A - Noldbach problem 暴力
A - Noldbach problem 题面链接 http://codeforces.com/contest/17/problem/A 题面 Nick is interested in prime ...
- Codeforces 17E Palisection 【Manacher】
Codeforces 17E Palisection E. Palisection In an English class Nick had nothing to do at all, and rem ...
- Codeforces Beta Round #17 D. Notepad (数论 + 广义欧拉定理降幂)
Codeforces Beta Round #17 题目链接:点击我打开题目链接 大概题意: 给你 \(b\),\(n\),\(c\). 让你求:\((b)^{n-1}*(b-1)\%c\). \(2 ...
- Educational Codeforces Round 17
Educational Codeforces Round 17 A. k-th divisor 水题,把所有因子找出来排序然后找第\(k\)大 view code //#pragma GCC opti ...
- Codeforces 17E Palisection - Manacher
题目传送门 传送点I 传送点II 传送点III 题目大意 给定一个串$s$询问,有多少对回文子串有交. 好像很简单的样子. 考虑能不能直接求,感觉有点麻烦.因为要考虑右端点在当前回文子串内还有区间包含 ...
- CodeForces 17E Palisection(回文树)
E. Palisection time limit per test 2 seconds memory limit per test 128 megabytes input standard inpu ...
- Educational Codeforces Round 17 颓废记
又被虐了... (记一次惨痛的Codeforces) 好不容易登上去了Codeforces,22:35准时开打 第一题,一看:这不SB题嘛?直接枚举因数上啊.9min才过掉了pretest 第二题.. ...
随机推荐
- CentOS7部署ELK5.2
原文发表于cu:2017-02-10 参考文档: Elasticsearchyum文档:https://www.elastic.co/guide/en/elasticsearch/reference/ ...
- 基于腾讯云CLB实现K8S v1.10.1集群高可用+负载均衡
概述: 最近对K8S非常感兴趣,同时对容器的管理等方面非常出色,是一款非常开源,强大的容器管理方案,最后经过1个月的本地实验,最终决定在腾讯云平台搭建属于我们的K8S集群管理平台~ 采购之后已经在本地 ...
- Spark入门(Python)
Hadoop是对大数据集进行分布式计算的标准工具,这也是为什么当你穿过机场时能看到”大数据(Big Data)”广告的原因.它已经成为大数据的操作系统,提供了包括工具和技巧在内的丰富生态系统,允许使用 ...
- Python Requests库简单入门
我对Python网络爬虫的学习主要是基于中国慕课网上嵩天老师的讲授,写博客的目的是为了更好触类旁通,并且作为学习笔记之后复习回顾. 1.引言 requests 库是一个简洁且简单的处理HTTP请求的第 ...
- 多源最短路——Floyd算法
Floyd算法 问题的提出:已知一个有向网(或者无向网),对每一对定点vi!=vj,要求求出vi与vj之间的最短路径和最短路径的长度. 解决该问题有以下两种方法: (1)轮流以每一个定点为源点,重复执 ...
- lintcode-198-排列序号II
198-排列序号II 给出一个可能包含重复数字的排列,求这些数字的所有排列按字典序排序后该排列在其中的编号.编号从1开始. 样例 给出排列[1, 4, 2, 2],其编号为3. 思路 和 lintco ...
- nginx 几个常用的标准模块介绍
ngx_http_ssl_module(https) 1:指明是否启用的虚拟主机的ssl功能 ssl on | off; 2:指明虚拟主机使用的证书文件 ssl_certificate /usr/lo ...
- 【BioCode】Elm格式中提取位点信息
说明: ①Elm格式: PLMD ID Uniprot Accession Position Type Sequence Species PMIDsPlMD编号 ...
- JS扫雷原理性代码
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/ ...
- windows查看端口占用指令
1.Windows平台 在windows命令行窗口下执行: 1.查看所有的端口占用情况 C:\>netstat -ano 协议 本地地址 外部地址 ...