#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; namespace { using Integer = long long; //__int128; template istream& operator >> (istream& is, pair& p){return is >> p.first >> p.second;} template istream& operator >> (istream& is, vector& vec){for(T& val: vec) is >> val; return is;} template istream& operator , (istream& is, T& val){ return is >> val;} template ostream& operator << (ostream& os, const pair& p){return os << p.first << " " << p.second;} template ostream& operator << (ostream& os, const vector& vec){for(size_t i=0; i ostream& operator , (ostream& os, const T& val){ return os << " " << val;} template void print(const H& head){ cout << head; } template void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); } template void println(const T& ... values){ print(values...); cout << endl; } template void eprint(const H& head){ cerr << head; } template void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); } template void eprintln(const T& ... values){ eprint(values...); cerr << endl; } class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } }; inline string operator "" _s (const char* str, size_t size){ return move(string(str)); } constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);} constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);} constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); } inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed mt19937 mt(chrono::duration_cast(chrono::steady_clock::now().time_since_epoch()).count()); template string join(const vector& v, const string& sep){ stringstream ss; for(size_t i=0; i0) ss << sep; ss << v[i]; } return ss.str(); } inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; } } constexpr long long mod = 9_ten + 7; #include using bits = bitset<500001>; class palindromic_tree{ public: struct node{ map e; int suf; int len; int depth; }; const string& s; vector t; vector s_pos; void constract(){ int pos = 1; for(int i=0; i= 0 && s[i-t[pos].len-1] == s[i]) break; pos = t[pos].suf; } if(t[pos].e.count(s[i])){ pos = t[pos].e[s[i]]; continue; } int nx = t.size(); t.push_back(node{{}, -1, t[pos].len+2, 1}); t[pos].e[s[i]] = nx; if(t[nx].len == 1){ t[nx].suf = 1; pos = nx; t[pos].depth = t[t[pos].suf].depth+1; continue; } while(1){ pos = t[pos].suf; if( i-t[pos].len-1 >= 0 && s[i-t[pos].len-1] == s[i]){ t[nx].suf = t[pos].e[s[i]]; break; } } pos = nx; t[pos].depth = t[t[pos].suf].depth+1; } } void init(){ t[0].suf = 0; t[0].len = -1; t[0].depth = 0; t[1].suf = 0; t[1].len = 0; t[0].depth = 1; } palindromic_tree(const string& s_) : s(s_), t(2), s_pos(s_.size()){ init(); constract(); } }; long long dfs(palindromic_tree& p, int i, vector& aho, int n, bits& head){ int pos = p.s_pos[i]; long long ret = 0; while(pos > 1){ if(aho[pos] != nullptr){ ret += (head&((*aho[pos])<<(n-1-i))).count(); break; } int len = p.t[ pos ].len; int suf = p.t[ pos ].suf; int left = i-len; if(left >= 0){ if(left - p.t[ p.s_pos[left] ].len == -1) ret++; } pos = suf; } return ret; } const int block = 100; void dfs2(palindromic_tree& p, vector>& G, int pos, bits& s, vector& aho){ if(pos>1) s.set( p.t[pos].len, 1 ); if(pos>1) if( (p.t[pos].depth % block) == 0){ aho[pos] = new bits(s); } for(int nx : G[pos]){ if(nx == pos)continue; dfs2(p,G, nx, s, aho); } if(pos>1) s.set( p.t[pos].len , 0 ); } int main(){ string s; cin >> s; set unko(s.begin(), s.end()); if(unko.size() == 1){ long long n = s.size() - 3; println( n*(n+1)*(n+2)/6 ); return 0; } palindromic_tree p(s); bits head; for(int i=0; i> G(p.t.size()); for(int i=0; i aho(p.t.size(), nullptr); bits tmp; dfs2(p,G,0,tmp, aho); vector dp(s.size()+1, 0); for(int i=1; i 1){ int len = p.t[pos].len; int suf = p.t[pos].suf; int left = i-len-1; if( left >= 0 ){ ans += dp[left]; } pos = suf; } println(ans); return 0; }