1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>		//UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>		//do setprecision
#include <ctime>
#include <complex>
using namespace std;

#include "message.h"
#include "palindromy.h"

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;

/* Jakub Radoszewski
* Algorytm Manachera - obliczanie promieni palindromów
* parzystych (Manacher1) i nieparzystych (Manacher2)
*/

string s;
vector <int> Par, Npar;

//Palindromy parzyste
vector<int> Manacher1(const string& s)
{
	string x("$"); x += s; x += '#'; // '$' i '#' - specjalne znaki
	vector<int> R;
	R.push_back(0);
	int i = 1, j = 0;
	while (i <= (int)x.size() - 1)
	{
		while (x[i - j] == x[i + j + 1])
			j++;
		R.push_back(j);
		int k = 1;
		while (R[i - k] != R[i] - k && k <= j)
		{
			R.push_back(min(R[i - k], R[i] - k));
			k++;
		}
		j = max(j - k, 0); i += k;
	}
	return R;
}

//Palindromy nieparzyste
vector<int> Manacher2(const string& s)
{
	string x("$"); x += s; x += '#'; // '$' i '#' - specjalne znaki
	vector<int> R;
	R.push_back(0);
	int i = 1, j = 0;
	while (i <= (int)x.size() - 1)
	{
		while (x[i - j - 1] == x[i + j + 1])
			j++;
		R.push_back(j);
		int k = 1;
		while (R[i - k] != R[i] - k && k <= j)
		{
			R.push_back(min(R[i - k], R[i] - k)); k++;
		}
		j = max(j - k, 0); i += k;
	}
	return R;
}

int main()
{
	int id = MyNodeId();

	if (id)
		return 0;

	int n = GetLength();
	REP(i, n)
		s += GetLetter(i);

	Par = Manacher1(s);
	Npar = Manacher2(s);

	LL res = 0;
	REP(i, n)
	{
		res += Par[i + 1];
	}

	REP(i, n)
	{
		res += Npar[i + 1] + 1;
	}

	printf("%lld\n", res);

	return 0;
}