2021.08.11【NOIP提高A、B组】模拟 总结

2021.08.11【NOIP提高A、B组】模拟 总结

懒得做。。。

第一题：显然状压dp。

第二题：显然二分最小生成树，讲题人有神奇做法。。

第三题：考虑结论：一定是回文串加上一些字符构成答案，偶数回文串最后一定是翻转。证明直接归纳。考虑PAM。在PAM上dp，显然分奇偶处理。

#include<bits/stdc++.h>
using namespace std;
int n,las,len[100005],ha[100005],fail[100005],fa[100005],tot,son[100005][27];
int la[100005],to[100005],ne[100005],go[100005],cnt,f[100005];
char s[100005];
void ins(register int i){
	int x=las,y=s[i]-'a';
	while (i-1-len[x]>=0&&s[i-1-len[x]]!=s[i])x=fail[x];
	if (son[x][y]){
		las=son[x][y];
		return;
	}
	int z=++tot;
	int p=fail[x];
	while (i-1-len[p]>=0&&s[i-1-len[p]]!=s[i])p=fail[p];
	fail[z]=son[p][y];
	len[z]=len[x]+2;
	son[x][y]=z;
	fa[z]=x;
	las=z;
	return;
}
void init(){
	for (register int i=0;i<=tot;i++)memset(son[i],0,sizeof(son[i])),fa[i]=0,len[i]=0,ha[i]=0,f[i]=0,fail[i]=0,la[i]=0;
	len[0]=0;
	len[1]=-1;
	tot=1;
	s[0]='&';
	fail[0]=fail[1]=1;
	las=0;
	for (register int i=1;i<=cnt;i++)to[i]=ne[i]=0;
	cnt=0;
	return;
}
inline void add(register int x,register int y){
	++cnt;
	to[cnt]=y;
	ne[cnt]=la[x];
	la[x]=cnt;
	return;
}
void calc(register int x,register int y){
	if (len[x]%2==0)ha[x]=y;
	for (register int i=la[x];i;i=ne[i]){
		int z=to[i];
		int yy=y;
		go[x]=z;
		if (len[z]%2==0){
			while (len[yy]<=len[z]/2)yy=go[yy];
			yy=fail[yy];
		}
		calc(z,yy);
	}
}
inline int min(register int x,register int y){
	return x<y?x:y;
}
inline void solve(){
	scanf("%s",s+1);
	n=strlen(s+1);
	init();
	for (register int i=1;i<=n;i++)ins(i);
	for (register int i=0;i<=tot;i++)if (i!=1)add(fail[i],i);
	for (register int i=0;i<=tot;i++)go[i]=la[i];
	calc(0,0);
	f[0]=1;
	f[1]=0;
	for (register int i=2;i<=tot;i++){
		if (len[i]&1)f[i]=min(f[fa[i]]+2,f[fail[i]]+len[i]-len[fail[i]]);
		else f[i]=min(f[fa[i]]+1,f[ha[i]]+(len[i]/2)-len[ha[i]]+1);
	}
	int ans=n;
	for (register int i=2;i<=tot;i++)ans=min(ans,f[i]+n-len[i]);
	printf("%d\n",ans);
	return;
}
int main(){
	int t;
	scanf("%d",&t);
	while (t--){
		solve();
	}
}