CF1817F.Entangled Substrings
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Quantum entanglement is when two particles link together in a certain way no matter how far apart they are in space.
You are given a string s . A pair of its non-empty substrings (a,b) is called entangled if there is a (possibly empty) link string c such that:
- Every occurrence of a in s is immediately followed by cb ;
- Every occurrence of b in s is immediately preceded by ac .
In other words, a and b occur in s only as substrings of acb . Compute the total number of entangled pairs of substrings of s .
A string a is a substring of a string b if a can be obtained from b by the deletion of several (possibly zero or all) characters from the beginning and several (possibly zero or all) characters from the end.
输入格式
The first and only line contains a string s of lowercase English letters ( 1≤∣s∣≤105 ) — the string for which you should count pairs of entangled substrings.
输出格式
Output a single integer, the number of entangled pairs of substrings of s .
输入输出样例
输入#1
abba
输出#1
1
输入#2
abacaba
输出#2
0
输入#3
abcabcabcabc
输出#3
5
输入#4
adamant
输出#4
82
说明/提示
In the first example, the only entangled pair is (ab,ba). For this pair, the corresponding link string c is empty, as they only occur as substrings of the whole string abba, which doesn't have any characters between ab and ba.
In the second example, there are no entangled pairs.
In the third example, the entangled pairs are (a,b), (b,c), (a,c), (a,bc), and (ab,c). For most pairs, the corresponding link string c is empty, except for the pair (a,c), for which the link string c is b, as a and c only occur as substrings of the string abc.