链接:E. Rusty String
题意:
给出一个字符串,只包含三种字符 V, K , ?。? 可以替换为 V 或 K,求字符串可能的周期有哪些。
思路:
- 对于该字符串,如果所有的字符往右移动 t 位后都与原来相同 , 那么它就可以以 t 为周期。所以我们对于每一个字符都计算出右移后与原来形同的步数 , 也就是所有相同字符之间位置的两两之差,可以用FFT求出 。 如果最后所有字符都可以移动 k 位与原来形同,k就可能是周期。但这里存在问号,可能存在一种情况 S i ≠ S i + 2 t S_i\ne S_{i+2t} Si=Si+2t,但是 S i + t = ? S_{i+t} = ? Si+t=?,这样就会把 t 当成周期,对于这种情况 2t 不是字符串的周期 , 所以我们对于不是周期的 t 把它的因子也排除掉就好了。
- 我们也可以反着做 , 如果 S i ≠ S i + t S_{i} \ne S_{i+t} Si=Si+t,那么 t 肯定不是周期 , 所以我们用 FFT 求出每个字符右移 t 位后与本身不同的所有 t 。其实就是 V 和 K 配对 , K 和 V 配对。最后把这些 k 的因子也去掉就好了。
代码:
方法1:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e6 + 5;
const int num = 200002;
const double Pi = acos(-1.0);
int r[maxn];
int vis[maxn];
int T, n;
char s[maxn];
int cnt[maxn];
struct Complex{
double x, y;
Complex(double xx = 0, double yy = 0) : x(xx), y(yy) {}
Complex operator+(Complex b){
return Complex(x + b.x, y + b.y);
}
Complex operator-(Complex b){
return Complex(x - b.x, y - b.y);
}
Complex operator*(Complex b){
return Complex(x * b.x - y * b.y, x * b.y + y * b.x);
}
};
// 最高n,m次, 0次为常数
Complex a[maxn], b[maxn];
Complex c[maxn];
void fft(Complex *cm, int cnum, int tag){
for(int i = 0 ; i <= cnum - 1; i ++){
if (i < r[i]){
swap(cm[i], cm[r[i]]);
}
}
for (ll mid = 1; mid < cnum; mid <<= 1){
Complex wk = Complex(cos(2 * Pi / (2 * mid)), tag * sin(2 * Pi / (2 * mid)));
for (ll j = 0; j < cnum; j += 2 * mid) //枚举 cnum/2*mid个全长段
{
Complex w(1, 0);
for (ll k = 0; k < mid; k++) //每段里面进行fft,不是<=,因为只有一半,不能超出
{
Complex buf = w * cm[j + k + mid];
cm[j + k + mid] = cm[j + k] - buf; //在这一步cm[j + k] = cm[j + k] + buf上,否则cm[j+k]已被更改
cm[j + k] = cm[j + k] + buf;
w = w * wk;
}
}
}
}
int fft_init(int n){ //n是最高次幂
int maxx = 1, bits = 0;
while ((maxx) <= n) {
maxx <<= 1;
bits++;
}
for(int i = 0; i <= maxx - 1; i ++){
r[i] = (r[i >> 1] >> 1) | ((i & 1) << (bits - 1)); //求二进制反转结果
}
return maxx;
}
void work(char val , int maxx){
for(int i = 1; i <= n; i ++){
if(s[i] == val){
a[n + i].x = 1;
b[n - i].x = 1;
}
if(s[i] == '?'){
a[n + i].x = 1;
}
}
for(int i = (val == '?') ? 1 : n + 1; i <= 2 * n; i ++){
a[n + i].x = 1;
}
fft(a , maxx , 1);
fft(b , maxx , 1);
for(int i = 0; i <= maxx; i ++){
c[i] = a[i] * b[i];
}
fft(c , maxx , -1);
for(int i = 0; i <= n; i ++){
cnt[i] += (c[i + 2 * n].x / maxx + 0.5);
}
for(int i = 0; i <= maxx; i ++){
a[i].x = b[i].x = c[i].x = 0;
a[i].y = b[i].y = c[i].y = 0;
}
}
int main(){
int T;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
scanf("%s",s + 1);
for(int i = 1; i <= n; i ++){
vis[i] = 0;
cnt[i] = 0;
}
int maxx = fft_init(4 * n);
work('V' , maxx);
work('K' , maxx);
work('?' , maxx);
vector<int>ans;
for(int i = 1; i <= n; i ++){
if(cnt[i] != n) continue;
for(int j = i; j <= n; j += i){
if(cnt[j] != n){
cnt[i] = 0;
break;
}
}
if(cnt[i] == n) ans.push_back(i);
}
printf ("%d\n",ans.size());
for(int i = 0; i < ans.size(); i ++){
printf ("%d ",ans[i]);
}
printf ("\n");
}
return 0;
}
方法二:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e6 + 5;
const int num = 200002;
const double Pi = acos(-1.0);
int r[maxn];
int vis[maxn];
int T, n;
char s[maxn];
int cnt[maxn];
struct Complex{
double x, y;
Complex(double xx = 0, double yy = 0) : x(xx), y(yy) {}
Complex operator+(Complex b){
return Complex(x + b.x, y + b.y);
}
Complex operator-(Complex b){
return Complex(x - b.x, y - b.y);
}
Complex operator*(Complex b){
return Complex(x * b.x - y * b.y, x * b.y + y * b.x);
}
};
// 最高n,m次, 0次为常数
Complex a[maxn], b[maxn];
Complex c[maxn];
void fft(Complex *cm, int cnum, int tag){
for(int i = 0 ; i <= cnum - 1; i ++){
if (i < r[i]){
swap(cm[i], cm[r[i]]);
}
}
for (ll mid = 1; mid < cnum; mid <<= 1){
Complex wk = Complex(cos(2 * Pi / (2 * mid)), tag * sin(2 * Pi / (2 * mid)));
for (ll j = 0; j < cnum; j += 2 * mid) //枚举 cnum/2*mid个全长段
{
Complex w(1, 0);
for (ll k = 0; k < mid; k++) //每段里面进行fft,不是<=,因为只有一半,不能超出
{
Complex buf = w * cm[j + k + mid];
cm[j + k + mid] = cm[j + k] - buf; //在这一步cm[j + k] = cm[j + k] + buf上,否则cm[j+k]已被更改
cm[j + k] = cm[j + k] + buf;
w = w * wk;
}
}
}
}
int fft_init(int n){ //n是最高次幂
int maxx = 1, bits = 0;
while ((maxx) <= n) {
maxx <<= 1;
bits++;
}
for(int i = 0; i <= maxx - 1; i ++){
r[i] = (r[i >> 1] >> 1) | ((i & 1) << (bits - 1)); //求二进制反转结果
}
return maxx;
}
void work(char val1 , char val2 , int maxx){
for(int i = 1; i <= n; i ++){
if(s[i] == val1){
a[n + i].x = 1;
}
if(s[i] == val2){
b[n - i].x = 1;
}
}
fft(a , maxx , 1);
fft(b , maxx , 1);
for(int i = 0; i <= maxx; i ++){
c[i] = a[i] * b[i];
}
fft(c , maxx , -1);
for(int i = 0; i <= n; i ++){
cnt[i] += (c[i + 2 * n].x / maxx + 0.5);
}
for(int i = 0; i <= maxx; i ++){
a[i].x = b[i].x = c[i].x = 0;
a[i].y = b[i].y = c[i].y = 0;
}
}
int main(){
int T;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
scanf("%s",s + 1);
for(int i = 1; i <= n; i ++){
vis[i] = 0;
cnt[i] = 0;
}
int maxx = fft_init(3 * n);
work('K' , 'V' ,maxx);
work('V' , 'K' ,maxx);
vector<int>ans;
for(int i = 1; i <= n; i ++){
if(cnt[i]) continue;
for(int j = i; j <= n; j += i){
if(cnt[j]){
cnt[i] = 1;
break;
}
}
if(!cnt[i]) ans.push_back(i);
}
printf ("%d\n",ans.size());
for(int i = 0; i < ans.size(); i ++){
printf ("%d ",ans[i]);
}
printf ("\n");
}
return 0;
}
方法二的一点优化:
由于我们在FFT的时候是把匹配串的幂次当成负数,达到系数减法的效果,这样把所有的幂次整体右移一个 n ,这样最大幂次会达到 3 * n 。但我们只要把匹配串翻转一下,最后得到的值减去 n + 1可以达到算差值的效果 , 这样最大幂次只有 2 * n + 1。快了不少。
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e6 + 5;
const int num = 200002;
const double Pi = acos(-1.0);
int r[maxn];
int vis[maxn];
int T, n;
char s[maxn],t[maxn];
int cnt[maxn];
struct Complex{
double x, y;
Complex(double xx = 0, double yy = 0) : x(xx), y(yy) {}
Complex operator+(Complex b){
return Complex(x + b.x, y + b.y);
}
Complex operator-(Complex b){
return Complex(x - b.x, y - b.y);
}
Complex operator*(Complex b){
return Complex(x * b.x - y * b.y, x * b.y + y * b.x);
}
};
// 最高n,m次, 0次为常数
Complex a[maxn], b[maxn];
Complex c[maxn];
void fft(Complex *cm, int cnum, int tag){
for(int i = 0 ; i <= cnum - 1; i ++){
if (i < r[i]){
swap(cm[i], cm[r[i]]);
}
}
for (ll mid = 1; mid < cnum; mid <<= 1){
Complex wk = Complex(cos(2 * Pi / (2 * mid)), tag * sin(2 * Pi / (2 * mid)));
for (ll j = 0; j < cnum; j += 2 * mid) //枚举 cnum/2*mid个全长段
{
Complex w(1, 0);
for (ll k = 0; k < mid; k++) //每段里面进行fft,不是<=,因为只有一半,不能超出
{
Complex buf = w * cm[j + k + mid];
cm[j + k + mid] = cm[j + k] - buf; //在这一步cm[j + k] = cm[j + k] + buf上,否则cm[j+k]已被更改
cm[j + k] = cm[j + k] + buf;
w = w * wk;
}
}
}
}
int fft_init(int n){ //n是最高次幂
int maxx = 1, bits = 0;
while ((maxx) <= n) {
maxx <<= 1;
bits++;
}
for(int i = 0; i <= maxx - 1; i ++){
r[i] = (r[i >> 1] >> 1) | ((i & 1) << (bits - 1)); //求二进制反转结果
}
return maxx;
}
void work(char val1 , char val2 , int maxx){
for(int i = 1; i <= n; i ++){
if(s[i] == val1){
a[i].x = 1;
}
if(t[i] == val2){
b[i].x = 1;
}
}
fft(a , maxx , 1);
fft(b , maxx , 1);
for(int i = 0; i <= maxx; i ++){
c[i] = a[i] * b[i];
}
fft(c , maxx , -1);
for(int i = 0; i <= n; i ++){
cnt[i] += (c[i + n + 1].x / maxx + 0.5);
}
for(int i = 0; i <= maxx; i ++){
a[i].x = b[i].x = c[i].x = 0;
a[i].y = b[i].y = c[i].y = 0;
}
}
int main(){
int T;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
scanf("%s",s + 1);
for(int i = 1; i <= n; i ++){
t[i] = s[n - i + 1];
}
for(int i = 1; i <= n; i ++){
vis[i] = 0;
cnt[i] = 0;
}
int maxx = fft_init(2 * n + 1);
work('K' , 'V' ,maxx);
work('V' , 'K' ,maxx);
vector<int>ans;
for(int i = 1; i <= n; i ++){
if(cnt[i]) continue;
for(int j = i; j <= n; j += i){
if(cnt[j]){
cnt[i] = 1;
break;
}
}
if(!cnt[i]) ans.push_back(i);
}
printf ("%d\n",ans.size());
for(int i = 0; i < ans.size(); i ++){
printf ("%d ",ans[i]);
}
printf ("\n");
}
return 0;
}