参照爱神的思路,先把矩阵的每行都hash,然后枚举子矩阵的宽度w,,按照从上到下,从左到右的顺序,把宽度为w的序列的hash值连在一起,注意不同的列起点之间用不同的字符隔开,然后统计有多少个不同的子串就有多少个不同的宽度为w的子矩阵,累加后就是答案
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>
#include <map>
#include <string>
#include <climits>
#include <set>
#include <string>
#include <sstream>
#include <utility>
#include <ctime>
using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::istringstream;
using std::make_pair;
using std::getline;
using std::greater;
using std::endl;
using std::multimap;
using std::deque;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PAIR;
typedef multimap<int, int> MMAP;
const int MAXN(20010);
const int SIGMA_SIZE(4);
const int MAXM(110);
const int MAXE(300010);
const int MAXH(18);
const int INFI((INT_MAX-1) >> 1);
const int MOD(2520);
const ULL BASE(31);
const ULL LIM(1000000000000000ull);
struct SA
{
int S[MAXN];
int sa[MAXN], t1[MAXN], t2[MAXN], cnt[MAXN], len, M;
void init(int tl, int tm = 128)
{
len = tl;
M = tm;
int *p1 = t1;
int *p2 = t2;
for(int i = 0; i < M; ++i) cnt[i] = 0;
for(int i = 0; i <= len; ++i) ++cnt[p1[i] = S[i]];
for(int i = 1; i < M; ++i) cnt[i] += cnt[i-1];
for(int i = len; i >= 0; --i) sa[--cnt[p1[i]]] = i;
int temp = 1;
for(int k = 1; temp <= len; k <<= 1)
{
temp = 0;
for(int i = len-k+1; i <= len; ++i) p2[temp++] = i;
for(int i = 0; i <= len; ++i)
if(sa[i] >= k)
p2[temp++] = sa[i]-k;
for(int i = 0; i < M; ++i) cnt[i] = 0;
for(int i = 0; i <= len; ++i) ++cnt[p1[p2[i]]];
for(int i = 1; i < M; ++i) cnt[i] += cnt[i-1];
for(int i = len; i >= 0; --i) sa[--cnt[p1[p2[i]]]] = p2[i];
swap(p1, p2);
temp = 1;
p1[sa[0]] = 0;
for(int i = 1; i <= len; ++i)
p1[sa[i]] = p2[sa[i-1]] == p2[sa[i]] && p2[sa[i-1]+k] == p2[sa[i]+k]? temp-1: temp++;
M = temp;
}
}
int rank[MAXN], height[MAXN];
void getHeight()
{
int k = 0;
for(int i = 0; i <= len; ++i)
rank[sa[i]] = i;
for(int i = 0; i < len; ++i)
{
if(k) --k;
int j = sa[rank[i]-1];
while(S[i+k] == S[j+k]) ++k;
height[rank[i]] = k;
}
}
int Log[MAXN];
int table[MAXH][MAXN];
void initLog()
{
Log[0] = -1;
for(int i = 1; i < MAXN; ++i)
Log[i] = (i&(i-1))? Log[i-1]: Log[i-1]+1;
}
void initRMQ()
{
for(int i = 1; i <= len; ++i)
table[0][i] = height[i];
for(int i = 1; (1 << i) <= len; ++i)
for(int j = 1; j+(1 << i)-1 <= len; ++j)
table[i][j] = min(table[i-1][j], table[i-1][j+(1 << (i-1))]);
}
int lcp(int a, int b)
{
a = rank[a];
b = rank[b];
if(a > b) swap(a, b);
++a;
int temp = Log[b-a+1];
return min(table[temp][a], table[temp][b-(1 << temp)+1]);
}
};
SA sa;
ULL XP[130];
static void initXP()
{
XP[0] = 1;
for(int i = 1; i < 130; ++i)
XP[i] = XP[i-1]*BASE;
}
struct HASH
{
ULL H[130];
int len;
void init(char *S, int tl)
{
len = tl;
H[len] = 0;
for(int i = len-1; i >= 0; --i)
H[i] = H[i+1]*BASE+(S[i]-'A');
}
ULL getValue(int ind, int l)
{
return H[ind]-H[ind+l]*XP[l];
}
};
HASH hash[129];
char str[130];
map<ULL, int> mp;
int main()
{
initXP();
int TC, n_case(0);
scanf("%d", &TC);
while(TC--)
{
int n, m;
LL ans = 0;
scanf("%d%d", &n, &m);
for(int i = 0; i < n; ++i)
{
scanf("%s", str);
hash[i].init(str, m);
}
ULL temp;
for(int w = 1; w <= m; ++w)
{
int lim = m-w;
mp.clear();
int ind = 1;
int len = 0;
for(int i = 0; i <= lim; ++i)
{
for(int j = 0; j < n; ++j)
{
temp = hash[j].getValue(i, w);
if(mp.find(temp) == mp.end())
mp.insert(make_pair(temp, ind++));
sa.S[len++] = mp[temp];
}
sa.S[len++] = ind++;
}
sa.S[--len] = 0;
sa.init(len, ind+1);
sa.getHeight();
LL tans = n*(n+1)/2*(m-w+1);
for(int i = 1; i <= len; ++i)
tans -= sa.height[i];
ans += tans;
}
printf("Case #%d: %I64d\n", ++n_case, ans);
}
return 0;
}