F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Bring Bring Big Teacher Brother

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 70    Accepted Submission(s): 3


Problem Description
"Why are you shouting so loudly? Why don't you go to the property control? You try roar again?!"

After the gentle and easy-going Master Sun uttered a lot of adrenaline-provoking words, people did not hate him at all, but liked him more. His paragraph became a source of happiness for people. For example, his idea about meeting and working is very famous: "When the meeting is so serious, everyone is being scolded, how can you laugh when everyone is accepting opinions.Should I smile?smile to the death photo of your horse ".


Later, the Master Sun became an indispensable part of people's life, and people consider what he said an abstract Bible.

definition:
If the substring $s[l .. r]$ of a string s is an abstract Bible, if and only if $l = r$ or satisfies the following conditions:

1. $mid$ is an integer, and the character s[mid] appears only once in $s[l .. r]$. (where mid is defined as $\frac{(l+r)}{2}$ )

2. $s[l .. mid-1] = s[mid + 1 .. r]$.

3. $s[l .. mid-1]$ is also an abstract Bible.

Now, given a string s, the happy value of this string is

$$\sum_{l=1}^{\left|s \right|} \sum_{r=l}^{\left|s \right|} G(s[l..r])\times (r-l+1)^2$$

Where $G(t)=1$ if and only if t is an abstract Bible, otherwise $G(t)=0$.


On this day, Mr. Sun is interacting with his neighbour's softly and gently. Every word he says has been all memorized by you. Let's call it string s. You want to quote classics to the people around you. But quoting classics is not equivalent to copying. So you want to know how much happy value can be brought by changing at most one character of the original string s.
 

Input
First line containing single integer T representing testcase number.
Next T lines each line containing a string.

$|s| \leq 10^5$, s only contain lowercase letter.
 

Output
T lines,each line one integer representing the answer.
 

Sample Input
2 abacaba zyz
 

Sample Output
83 12
 

Hint
substring
[1,1],[2,2],[3,3],[4,4],[5,5],[6,6],[7,7],[1,3],[3,5],[5,7],[1,7] are abstract bible.
Answer = 1 * 7 + 9 + 9 + 9 + 49 = 83
It can be proved that you can't modify any letter such that a better result is procedured.
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-22 18:02:14, Gzip enabled