一、题目描述
二、算法分析说明与代码编写指导
对输入的每个字符串,将它们的最小表示添加到 unordered_set 中,最后就可以直接统计出有多少同构的字符串。
字符串的长度似乎会达到 101,超出题目给的 100。
三、AC 代码
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<unordered_set>
#include<string>
#pragma warning(disable:4996)
using namespace std;
const unsigned lmax = 103;
unsigned n, p0, l[10000], p; char s[10000][lmax]; unordered_set<string> u; string t;
template<class _Ty> inline size_t minexp(const _Ty* const a, const size_t& n) {
size_t k = 0, i = 0, j = 1, p, q;
while (k < n && i < n && j < n) {
p = i + k >= n ? i + k - n : i + k; q = j + k >= n ? j + k - n : j + k;
if (a[p] == a[q])++k;
else {
a[p] > a[q] ? i += k + 1 : j += k + 1;
k = 0; if (i == j)++i;
}
}
return min(i, j);
}
int main() {
for (;;) {
if (scanf("%u", &n) == EOF)return 0;
getchar(); for (unsigned i = 0; i < n; ++i) { fgets(s[i], lmax, stdin); l[i] = strlen(s[i]) - 1; }
u.clear();
for (unsigned i = 0; i < n; ++i) {
p0 = minexp(s[i], l[i]); t.clear();
for (p = p0; p < l[i]; ++p)t += s[i][p];
for (p = 0; p < p0; ++p)t += s[i][p];
u.emplace(t);
}
printf("%llu\n", u.size());
}
}