結果
| 問題 | No.515 典型LCP |
| ユーザー |
 koyumeishi
|
| 提出日時 | 2017-05-06 02:38:11 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 12,257 bytes |
| コンパイル時間 | 2,273 ms |
| コンパイル使用メモリ | 143,104 KB |
| 実行使用メモリ | 93,040 KB |
| 最終ジャッジ日時 | 2024-09-14 10:35:56 |
| 合計ジャッジ時間 | 12,176 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge6 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | AC | 2 ms
6,944 KB |
| testcase_04 | AC | 2 ms
6,944 KB |
| testcase_05 | AC | 658 ms
89,808 KB |
| testcase_06 | AC | 718 ms
92,788 KB |
| testcase_07 | AC | 675 ms
89,384 KB |
| testcase_08 | AC | 706 ms
89,932 KB |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | AC | 667 ms
89,112 KB |
| testcase_16 | AC | 667 ms
89,752 KB |
ソースコード
#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;
class SA_IS{
//compress alphabets
//return vector<count of alphabet>
vector<int> compress(vector<int>& v){
set<int> alph(v.begin(), v.end());
vector<int> dic(alph.begin(), alph.end());
vector<int> bucket_size(dic.size(),0);
for(int i=0; i<v.size(); i++){
v[i] = lower_bound(dic.begin(), dic.end(), v[i]) - dic.begin();
bucket_size[v[i]]++;
}
return bucket_size;
}
public:
static const int L = 0;
static const int S = 1;
string my_s;
vector<int> sa;
vector<int> lcp;
struct substring{
int pos;
int size;
vector<int>::iterator str;
vector<int>::iterator ls;
substring(){
}
substring(const int pos, const int size, const vector<int>::iterator& str, const vector<int>::iterator& ls){
this->pos = pos;
this->size = size;
this->str = str;
this->ls = ls;
}
bool operator<(const substring& x) const {
for(int i=0; i<min(this->size, x.size); i++){
if(this->str[i] != x.str[i]){
return this->str[i] < x.str[i];
}else if(this->ls[i] != x.ls[i]){
return this->ls[i] == SA_IS::L;
}
}
return this->size < x.size;
}
bool operator==(const substring& x) const {
for(int i=0; i<min(this->size, x.size); i++){
if(this->str[i] != x.str[i]){
return false;
}else if(this->ls[i] != x.ls[i]){
return false;
}
}
return this->size == x.size;
}
substring operator=(const substring& x){
this->pos = x.pos;
this->size = x.size;
this->str = x.str;
this->ls = x.ls;
return *this;
}
};
vector<int> rec(vector<int>& v){
v.push_back(-1);
vector<int> bucket_size = compress(v);
//bucket
vector<int> ret(v.size(), -1);
vector<vector<int>::iterator> bucket(bucket_size.size());
vector<bool> fixed(v.size(), false);
vector<vector<bool>::iterator> bucket_fixed(bucket_size.size());
vector<int> bucket_front(bucket_size.size());
vector<int> bucket_back(bucket_size.size());
vector<bool> used(v.size(), false);
//initialize
{
int sum = 0;
for(int i=0; i<bucket_size.size(); i++){
bucket[i] = ret.begin() + sum;
bucket_fixed[i] = fixed.begin() +sum;
bucket_front[i] = 0;
bucket_back[i] = bucket_size[i] - 1;
sum += bucket_size[i];
}
}
vector<int> LS(v.size());
LS.back() = S;
for(int i=v.size()-2; i>=0; i--){
if(v[i] < v[i+1]) LS[i] = S;
else if (v[i] > v[i+1]) LS[i] = L;
else LS[i] = LS[i+1];
}
vector<int> LMS;
for(int i=1; i<v.size(); i++){
if(LS[i] != S) continue;
if(LS[i-1] == L) LMS.push_back(i);
}
LMS.push_back(v.size()-1);
vector< pair<substring, int> > LMS_substring;
for(int i=0; i<LMS.size()-1; i++){
substring sub(LMS[i], LMS[i+1]-LMS[i]+1, v.begin()+LMS[i], LS.begin()+LMS[i]);
LMS_substring.push_back({sub, LMS_substring.size()});
}
if(LMS_substring.size() > 0){
vector< pair<substring, int>> LMS_substring_old = LMS_substring;
sort(LMS_substring.begin(), LMS_substring.end());
vector<int> LMS_order(LMS_substring.size());
int cnt = 0;
LMS_order[ LMS_substring[0].second ] = cnt;
cnt++;
for(int i=1; i<LMS_substring.size(); i++){
if(LMS_substring[i].first == LMS_substring[i-1].first){
LMS_order[ LMS_substring[i].second ] = cnt-1;
}else{
LMS_order[ LMS_substring[i].second ] = cnt;
cnt++;
}
}
if(cnt != LMS_substring.size()){
vector<int> new_order = rec(LMS_order);
LMS_order = vector<int>(new_order.begin()+1, new_order.end());
for(int i=0; i<LMS_substring.size(); i++){
LMS_substring[i].first = LMS_substring_old[LMS_order[i]].first;
}
}
for(int i=LMS_substring.size()-1; i>=0; i--){
int c = v[LMS_substring[i].first.pos];
bucket[c][bucket_back[c]] = LMS_substring[i].first.pos;
bucket_back[c]--;
}
}
for(int i=0; i<bucket_size.size(); i++){
for(int j=0; j<bucket_size[i]; j++){
if( bucket[i][j] - 1 < 0 ) continue;
if( LS[ bucket[i][j]-1 ] == L ){
if(used[bucket[i][j]-1]) continue;
used[ bucket[i][j]-1 ] = true;
int c = v[ bucket[i][j]-1 ];
bucket[c][ bucket_front[c] ] = bucket[i][j]-1;
bucket_fixed[c][ bucket_front[c] ] = true;
bucket_front[c]++;
}
}
bucket_back[i] = bucket_size[i] - 1;
}
for(int i=0; i<v.size(); i++){
if(fixed[i] == false){
ret[i] = -1;
}
}
for(int i=bucket_size.size()-1; i>=0; i--){
for(int j=bucket_size[i]-1; j>=0; j--){
if( bucket[i][j] - 1 < 0 ) continue;
if( LS[ bucket[i][j]-1 ] == S ){
if(used[bucket[i][j]-1]) continue;
used[ bucket[i][j]-1 ] = true;
int c = v[ bucket[i][j]-1 ];
bucket[c][ bucket_back[c] ] = bucket[i][j]-1;
bucket_fixed[c][ bucket_back[c] ] = true;
bucket_back[c]--;
}
}
}
ret[0] = ret.size()-1;
return ret;
}
vector<int> rec(string &s){
vector<int> v(s.begin(), s.end());
return rec(v);
}
void constract_lcp(){
int n = my_s.size();
lcp.resize(n+1);
vector<int> rank(n+1);
for(int i=0; i<=n; i++) rank[sa[i]] = i;
int h=0;
lcp[0] = 0;
for(int i=0; i<n; i++){
int j=sa[rank[i]-1];
if(h>0) h--;
for(; j+h<n && i+h<n; h++){
if(my_s[j+h] != my_s[i+h]) break;
}
lcp[rank[i] - 1] = h;
}
}
SA_IS(string s){
my_s = s;
sa = rec(s);
constract_lcp();
}
void dbg_print(){
for(int i=0; i<=my_s.size(); i++){
string p(my_s.begin() + sa[i], my_s.end());
cerr << p << " " << sa[i] << /*" " << lcp[i] <<*/ endl;
}
}
};
template<class T=int>
class SparseTable{
public:
SparseTable(int len, T default_value_ = 100000000, function<T(T,T)> eval = default_evaluate)
: col(len), default_value(default_value_)
{
evaluate = eval;
row = 1;
while((1<<row) < col) row += 1;
row++;
table = vector<vector<T>>(row, vector<T>(col, default_value));
}
SparseTable(vector<T>& vec, T default_value_ = 100000000, function<T(T,T)> eval = default_evaluate)
: col(vec.size()), default_value(default_value_)
{
evaluate = eval;
row = 1;
while((1<<row) < col) row += 1;
row++;
table = vector<vector<T>>(row, vector<T>(col, default_value));
set(vec);
}
void set(vector<T>& vec){
assert(col == vec.size());
values = &vec;
vector<T>& val = vec;
iota(table[0].begin(), table[0].end(), 0);
for(int k=1; k<row; k++){
for(int i=0; i + (1<<k)-1 < col; i++){
T left = val[table[k-1][i]];
T right = val[table[k-1][i+(1<<(k-1))]];
if(left == evaluate(left,right)){
table[k][i] = table[k-1][i];
}else{
table[k][i] = table[k-1][i+(1<<(k-1))];
}
}
}
}
//[l,r)
T get(int l, int r){
if(l>=r) return default_value;
vector<T>& val = *values;
T ret = default_value;
int k = 0;
static vector<int> log_k(col+1);
static bool set = false;
if(!set){
int kk = 0;
for(int i=2; i<=col; i++){
if( (i&-i) == i ) kk++;
log_k[i] = kk;
}
set = true;
}
// while((1<<(k+1)) < (r-l)) k++;
k = log_k[r-l];
T left = val[ table[k][l] ];
T right = val[ table[k][r-(1<<k)] ];
ret = evaluate(left, right);
return ret;
}
private:
int col;
int row;
T default_value;
vector<T>* values;
vector<vector<T>> table;
static T default_evaluate(T a, T b){
return min(a,b);
}
function<T(T,T)> evaluate;
};
int main(){
int n;
cin >> n;
vector<string> s(n);
char buff[800010];
for(int i=0; i<n; ++i){
scanf("%s", buff);
s[i] = buff;
}
//cin >> s;
long long m,x,d;
cin >> m,x,d;
long long ans = 0;
string ss;
vector<int> pos(n);
for(int i=0; i<n; ++i){
pos[i] = ss.size();
ss += s[i] ;
}
// SuffixArray sa(ss);
SA_IS sa(ss);
SparseTable<int> st( sa.lcp );
// sa.dbg_print();
vector<int> rank(sa.sa.size());
for(int i=0; i<sa.sa.size(); ++i){
rank[ sa.sa[i] ] = i;
}
// abort();
long long nn = n*(n-1ll);
for(int i=0; i<m; ++i){
long long l = (x/(n-1));
long long r = x-l*(n-1);//(x%(n-1));
if( l>r ) swap(l,r);
else r = r+1;
x += d;
if( x >= nn ) x -= nn;
int pl,pr;
pl = rank[ pos[l] ];
pr = rank[ pos[r] ];
if( pl>pr ) swap(pl,pr);
int lcp_len = st.get(pl,pr);
// lcp_len = min<int>(lcp_len, min(s[l].size(), s[r].size()));
ans += lcp_len;
}
println(ans);
return 0;
}