結果
| 問題 |
No.465 PPPPPPPPPPPPPPPPAPPPPPPPP
|
| コンテスト | |
| ユーザー |
 koyumeishi
|
| 提出日時 | 2016-12-16 05:31:05 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 8,245 bytes |
| コンパイル時間 | 1,525 ms |
| コンパイル使用メモリ | 128,144 KB |
| 実行使用メモリ | 277,660 KB |
| 最終ジャッジ日時 | 2024-11-30 10:14:21 |
| 合計ジャッジ時間 | 11,652 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 18 TLE * 2 |
ソースコード
#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;
namespace {
using Integer = long long; //__int128;
template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
template<class T> istream& operator , (istream& is, T& val){ return is >> val;}
template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;}
template<class H> void print(const H& head){ cout << head; }
template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }
template<class H> void eprint(const H& head){ cerr << head; }
template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
template<class ... T> 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::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());
template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) 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 <bitset>
// using bits = bitset<500001>;
struct unko_bit{
constexpr static int bit_size = 1024;
using integer = bitset<bit_size>;
constexpr static int len = (500001+bit_size-1)/bit_size;
integer value[len];
int cnt[len];
unko_bit(){
for(int i=0; i<len; i++){
cnt[i] = 0;
}
}
void set(int k, int x){
if(x){
value[k/bit_size].set(k%bit_size, 1);// |= integer(1) << (k%bit_size);
}else{
value[k/bit_size].set(k%bit_size, 0);// &= ~(integer(1) << (k%bit_size));
}
cnt[k/bit_size] = value[k/bit_size].count();
}
int count(unko_bit& x, int shift){
int ss = shift/bit_size;
int dd = shift%bit_size;
int ret = 0;
for(int i=0; i<len; ++i){
if(cnt[i] == 0) continue;
if(i-ss >= 0 && x.cnt[i-ss] > 0) ret += (value[i] & (x.value[i-ss] << dd)).count();
if(dd != 0 && i-ss-1 >= 0 && x.cnt[i-ss-1] > 0) ret += (value[i] & (x.value[i-ss-1] >> (bit_size-dd))).count();
//ret += tmp.count();
}
return ret;
}
};
using bits = unko_bit;
class palindromic_tree{
public:
struct node{
map<char, int> e;
int suf;
int len;
int depth;
};
const string& s;
vector<node> t;
vector<int> s_pos;
void constract(){
int pos = 1;
for(int i=0; i<s.size(); s_pos[i++] = pos){
while(1){
if( i-t[pos].len-1 >= 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<bits*>& aho, int n, bits& head, vector<long long>& sum){
int pos = p.s_pos[i];
if( p.t[pos].len == i+1 && p.t[p.t[pos].suf].len == p.t[pos].len-1){
return sum[i-1];
}
if( p.t[pos].len == i && p.t[p.t[pos].suf].len == p.t[pos].len-2 && p.t[ p.s_pos[i-1] ].len == i){
return sum[i-1];
}
if( p.t[pos].len == i+1 && p.t[p.t[pos].suf].len == p.t[pos].len-2){
return 0;
}
long long ret = 0;
while(pos > 1){
if(aho[pos] != nullptr){
//ret += (head&((*aho[pos])<<(n-1-i))).count();
ret += head.count(*aho[pos], n-1-i);
//assert(false);
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++;
}
if( i-len >= 0 && sum[ i-len ] == sum[ i-1 ] ){
break;
}
pos = suf;
}
return ret;
}
const int block = 100;
void dfs2(palindromic_tree& p, vector<vector<int>>& G, int pos, bits& s, vector<bits*>& aho, int d){
if(pos>1) s.set( p.t[pos].len, 1 );
//if(pos>1) if( d % block == 0){
if(pos>1) if( (d & 255) == 0){
//if(pos>1) if( d>100 && (rand() & 255) == 0){
aho[pos] = new bits(s);
}
for(int nx : G[pos]){
if(nx == pos)continue;
dfs2(p,G, nx, s, aho, d+1);
}
if(pos>1) s.set( p.t[pos].len , 0 );
}
int main(){
string s;
cin >> s;
auto start = chrono::steady_clock::now();
// set<char> 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);
vector<long long> sum(s.size(), 0);
bits head;
for(int i=0; i<s.size(); i++){
if( p.t[p.s_pos[i]].len == i+1 ){
head.set(s.size()-1-i,1);
sum[i] += 1;
}
if(i) sum[i] += sum[i-1];
}
vector<vector<int>> G(p.t.size());
for(int i=0; i<p.t.size(); ++i){
G[ p.t[i].suf ].push_back( i );
}
vector<bits*> aho(p.t.size(), nullptr);
bits tmp;
dfs2(p,G,0,tmp, aho, 0);
vector<long long> dp(s.size()+1, 0);
for(int i=1; i<s.size()-2; ++i){
dp[i] = dfs(p, i, aho, s.size(), head, sum);
}
for(int i=1; i<s.size(); ++i){
dp[i] += dp[i-1];
}
long long ans = 0;
int pos = p.s_pos[ s.size()-1 ];
int i = s.size()-1;
while(pos > 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);
auto end = chrono::steady_clock::now();
eprintln("computed in ", chrono::duration_cast<chrono::milliseconds>(end-start).count() , "[ms]");
return 0;
}