-
Notifications
You must be signed in to change notification settings - Fork 0
/
cho.cpp
140 lines (126 loc) · 2.62 KB
/
cho.cpp
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int maxn=205;
const int maxs=100005;
int n,m;
char tab[maxn][maxs];
vector<int> P[maxn];
typedef long long ll;
ll roz[maxn];
ll pre[maxn][maxn];
ll P2[32][maxn][maxn];
ll PM[maxn][maxn];
ll TMP[maxn][maxn];
void copyM(ll (&a)[maxn][maxn], ll (&o)[maxn][maxn]) {
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
o[i][j] = a[i][j];
}
}
}
void mult(ll (&a)[maxn][maxn], ll (&b)[maxn][maxn], ll (&o)[maxn][maxn]) {
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
ll best = 1LL<<60LL;
for(int k=0; k<n; k++) {
ll akt = a[i][k] + b[k][j];
if(akt < best) best = akt;
}
o[i][j] = best;
}
}
}
void getM(int m) {
if(m==0) {
//copyM(pre, PM);
return;
}
copyM(pre, P2[0]);
for(int i=1; (1<<i) <= m; i++) {
mult(P2[i-1],P2[i-1], P2[i]);
}
bool first = true;
for(int i=0; (1<<i) <= m; i++) {
if(m & (1<<i)) {
if(first) {
first = false;
copyM(P2[i], PM);
} else {
copyM(PM, TMP);
mult(TMP, P2[i], PM);
}
}
}
}
void printM(ll (&a)[maxn][maxn]) {
for(int i=0; i<n; i++)
for(int j=0; j<n; j++){
cout << i << " " << j << " " << a[i][j] << endl;
}
}
void ps(int aa)
{
P[aa].resize(roz[aa]+1, 0);
P[aa][0]=-1;
int t=-1;
for(int i=1; i<=roz[aa]; i++){
while(t>=0&&tab[aa][t+1]!=tab[aa][i]) t=P[aa][t];
t++;
P[aa][i]=t;
}
}
int mp(int aa, int bb)
{
int aktmax=0;
int i=0, j=0;
while(i<=roz[aa]){
while(j<roz[bb]&&tab[bb][j+1]==tab[aa][i+j+1]) {
j++;
}
//if(aa == 1 && bb == 0) cerr << " " << i << " : " << j << endl;
if(i+j == roz[aa]) {
//cerr << "!" << tab[bb]+1 << " : " << (tab[aa]+i+1) << endl;
for(int jj=0; jj<j; jj++) if(tab[bb][jj+1] != tab[aa][i+jj+1]) return 0;
return j;
}
if(i+j > roz[aa]) cerr << "!";
aktmax=max(aktmax, j);
i+=j-P[aa][j];
j=max(0,P[aa][j]);
}
return 0;
}
int main()
{
cin >> n >>m;
for(int i=0; i<n; i++){
string a;
cin >> a;
for(int j=1; j<a.size()+1; j++) tab[i][j]=a[j-1];
roz[i]=a.size();
}
for(int i=0; i<n; i++) ps(i);
for(int i=0; i<n; i++)
for(int j=0; j<n; j++){
if(i==j) {
pre[i][j]=roz[j]-P[i][roz[j]];
}
else{
int wynik=mp(i,j);
pre[i][j]=roz[j]-wynik;
}
}
//printM(pre);
getM(m-1);
ll best = 1LL<<60LL;
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
ll akt = roz[i] + PM[i][j];
if(akt <best) best = akt;
}
}
cout << best << endl;
return 0;
}