Codeforces1168 简要题解

传送门

A

考虑到答案一定不会超过$m$次，于是二分答案+贪心$check$即可。
代码：

#include<bits/stdc++.h>
#define ri register int
#define fi first
#define se second
using namespace std;
inline int read(){
	#define gc getchar
	int ans=0;
	bool f=1;
	char ch=gc();
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
	return f?ans:-ans;
	#undef gc
}
typedef pair<int,int> pii;
typedef long long ll;
const int mod=998244353;
typedef vector<int> poly;
inline int add(int a,int b){return (a+=b)<mod?a:a-mod;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){return (ll)a*b%mod;}
inline void Add(int&a,int b){(a+=b)<mod?a:a-=mod;}
inline void Dec(int&a,int b){(a-=b)<0?a+=mod:a;}
inline void Mul(int&a,int b){a=(ll)a*b%mod;}
inline int ksm(int a,int p){int ret=1;for(;p;p>>=1,Mul(a,a))if(p&1)Mul(ret,a);return ret;}
const int N=3e5+5;
int n,m,a[N];
inline bool check(int x){
	int mn=0;
	for(ri i=1;i<=n;++i){
		if(a[i]+x<m){
			if(mn>a[i]+x)return 0;
			mn=max(a[i],mn);
		}
		else{
			if(mn>a[i]+x-m)mn=max(mn,a[i]);
		}
	}
	return 1;
	
}
int main(){
	#ifdef ldxcaicai
	freopen("lx.in","r",stdin);
	#endif
	n=read(),m=read();
	for(ri i=1;i<=n;++i)a[i]=read();
	int l=0,r=m-1,res=m-1;
	while(l<=r){
		int mid=l+r>>1;
		if(check(mid))r=mid-1,res=mid;
		else l=mid+1;
	}
	cout<<res;
	return 0;
}

---

B

经过手玩搜索发现一个长度大于$8$的串一定存在一个合法的子串，于是瞎暴力写一写就能过了。
代码：

#include<bits/stdc++.h>
#define ri register int
#define fi first
#define se second
using namespace std;
inline int read(){
	#define gc getchar
	int ans=0;
	bool f=1;
	char ch=gc();
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
	return f?ans:-ans;
	#undef gc
}
typedef pair<int,int> pii;
typedef long long ll;
const int mod=998244353;
typedef vector<int> poly;
inline int add(int a,int b){return (a+=b)<mod?a:a-mod;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){return (ll)a*b%mod;}
inline void Add(int&a,int b){(a+=b)<mod?a:a-=mod;}
inline void Dec(int&a,int b){(a-=b)<0?a+=mod:a;}
inline void Mul(int&a,int b){a=(ll)a*b%mod;}
inline int ksm(int a,int p){int ret=1;for(;p;p>>=1,Mul(a,a))if(p&1)Mul(ret,a);return ret;}
const int N=3e5+5;
char s[N];
int n;
inline bool check(int l,int r){
	for(ri len=1;len*2<=r-l+1;++len)for(ri i=l;i+len*2<=r;++i)if(s[i]==s[i+len]&&s[i+len]==s[i+len*2])return 1;
	return 0;
}
inline ll solve(int L,int R){
	ll ret=0;
	if(L>R)return 0;
	if(R-L+1<=10){
		for(ri i=L;i<=R;++i)for(ri j=L+1;j<=R;++j)if(check(i,j))++ret;
		return ret;
	}
	for(ri i=L;i<=R;++i){
		if(check(L,i)){
			int j=L;
			for(;j<=i;++j)if(!check(j,i))break;
			return solve(j,R)+(ll)(R-i+1)*(j-L);
		}
	}
	return 0;
}
int main(){
	#ifdef ldxcaicai
	freopen("lx.in","r",stdin);
	#endif
	scanf("%s",s+1),n=strlen(s+1);
	cout<<solve(1,n);
	return 0;
}

---

C

考虑定义$f_{i,j}$表示二进制第$j$位为$1$且与$i$连通的数的下标最小值，转移可以从后向前，并利用一个辅助数组$las{t}_i$记录上一个二进制位为$i$的出现位置来优化转移，这样只用看是否存在$y\&2^i̸=0\&\&f_{x,i}\le y$的$i$即可。
代码：

#include<bits/stdc++.h>
#define ri register int
#define fi first
#define se second
using namespace std;
inline int read(){
	#define gc getchar
	int ans=0;
	bool f=1;
	char ch=gc();
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
	return f?ans:-ans;
	#undef gc
}
typedef pair<int,int> pii;
typedef long long ll;
const int mod=998244353;
typedef vector<int> poly;
inline int add(int a,int b){return (a+=b)<mod?a:a-mod;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){return (ll)a*b%mod;}
inline void Add(int&a,int b){(a+=b)<mod?a:a-=mod;}
inline void Dec(int&a,int b){(a-=b)<0?a+=mod:a;}
inline void Mul(int&a,int b){a=(ll)a*b%mod;}
inline int ksm(int a,int p){int ret=1;for(;p;p>>=1,Mul(a,a))if(p&1)Mul(ret,a);return ret;}
const int N=3e5+5;
int n,m,a[N],f[N][20],last[20];
int main(){
	#ifdef ldxcaicai
	freopen("lx.in","r",stdin);
	#endif
	n=read(),m=read();
	for(ri i=1;i<=n;++i)a[i]=read();
	memset(f,0x3f,sizeof(f));
	for(ri i=n;i;--i){
		for(ri j=19;~j;--j){
			if(a[i]>>j&1){
				for(ri k=19;~k;--k)f[i][k]=min(f[i][k],f[last[j]][k]);
				f[i][j]=last[j]=i;
				continue;
			}
			
		}
	}
	for(ri x,y,tt=1;tt<=m;++tt){
		x=read(),y=read();
		bool ff=0;
		for(ri i=19;~i;--i){
			if(!(a[y]>>i&1))continue;
			if(f[x][i]>y)continue;
			ff=1;
			break;
		}
		puts(ff?"Shi":"Fou");
	}
	return 0;
}

---

D

考虑把二度点压起来，然后树高变成了$O(\sqrt{n})$的，每次暴力跳树简单$ddp$一下即可。
代码：

#include<bits/stdc++.h>
#define ri register int
using namespace std;
const int rlen=1<<18|1;
inline char gc(){
	static char buf[rlen],*ib,*ob;
	(ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin));
	return ib==ob?-1:*ib++;
}
inline int read(){
	int ans=0;
	char ch=gc();
	while(!isdigit(ch))ch=gc();
	while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
	return ans;
}
inline int gcr(){
	char ch=gc();
	while(!isalpha(ch)&&ch!='?')ch=gc();
	return ch=='?'?26:ch-'a';
}
const int N=150005;
int n,m,fa[N],f[N],dep[N],cnt[N][27],ss[N],mx[N][27],all[N],vl[N],mxdep,du[N],ban=0;
vector<int>e[N];
inline int find(const int&x){return x^f[x]?f[x]=find(f[x]):x;}
void dfs(int p){
	for(ri i=0,v;i<e[p].size();++i){
		dfs(v=e[p][i]);
		for(ri j=0;j<26;++j)mx[p][j]=max(mx[p][j],mx[v][j]+cnt[v][j]);
	}
	for(ri i=0;i<26;++i)ss[p]+=mx[p][i];
	ban+=ss[p]>(mxdep-dep[p]);
}
inline void update(int p,int V,int type){
	cnt[p][V]+=type;
	for(ri i=fa[p];i;i=fa[i]){
		ban-=ss[i]>mxdep-dep[i];
		ss[i]-=mx[i][V];
		mx[i][V]=0;
		for(ri j=0,v;j<e[i].size();++j){
			v=e[i][j];
			mx[i][V]=max(mx[i][V],mx[v][V]+cnt[v][V]);
		}
		ss[i]+=mx[i][V];
		ban+=ss[i]>mxdep-dep[i];
	}
}
inline void query(){
	if(ban){
		puts("Fou");
		return;
	}
	int res=0;
	for(ri i=0;i<26;++i)res+=(i+1)*(mxdep-ss[1]+mx[1][i]);
	cout<<"Shi "<<res<<'\n';
}
int main(){
	#ifdef ldxcaicai
	freopen("lx.in","r",stdin);
	#endif
	n=read(),m=read();
	for(ri i=2;i<=n;++i)fa[i]=read(),vl[i]=gcr(),dep[i]=dep[fa[i]]+1,++du[fa[i]];
	for(ri i=1;i<=n;++i){
		if(du[i])continue;
		if(!mxdep)mxdep=dep[i];
		if(mxdep^dep[i]){
			while(m--)puts("Fou");
			return 0;
		}
	}
	for(ri i=1;i<=n;++i){
		f[i]=i;
		if(fa[i]>1&&du[fa[i]]<2){
			f[fa[i]]=i;
			fa[i]=fa[fa[i]];
		}
	}
	for(ri i=2;i<=n;++i){
		f[i]=find(i);
		if(f[i]==i)e[fa[i]].push_back(i);
		if(vl[i]<26)++cnt[f[i]][vl[i]];
	}
	dfs(1);
	for(ri i=1,x;i<=m;++i){
		x=read();
		if(vl[x]^26)update(f[x],vl[x],-1);
		vl[x]=gcr();
		if(vl[x]^26)update(f[x],vl[x],1);
		query();
	}
	return 0;
}

---

E

先令$va{l}_i=0,p_i=q_i=i$，我们要使得最后的$p_{i}xor{q}_i=va{l}_i=a_i$
于是每次如果$va{l}_i̸=a_i$我们就通过一次$fix$操作令$va{l}_{i+1}xor$上$va{l}_{i}xor{a}_i$且$va{l}_i$变成$a_i$。
考虑暴力找到一个合法的$p_k$然后和$p_i$,$q_{i+1}$和$q_k$换位置，然后调用$fix(i+1,k)$即可。
代码：

#include<bits/stdc++.h>
#define ri register int
using namespace std;
const int rlen=1<<18|1;
inline char gc(){
	static char buf[rlen],*ib,*ob;
	(ib==ob)&&(ob=(ib=buf)+fread(buf,1,rlen,stdin));
	return ib==ob?-1:*ib++;
}
inline int read(){
	int ans=0;
	char ch=gc();
	while(!isdigit(ch))ch=gc();
	while(isdigit(ch))ans=((ans<<2)+ans<<1)+(ch^48),ch=gc();
	return ans;
}
const int N=5005;
int k,a[N],n,p[N],q[N],idx[N],vl[N];
inline void fix(int x,int y){
	int k=idx[vl[x]^q[x]];
	if(k==x)return;
	if(k==y){
		swap(idx[p[x]],idx[p[y]]);
		swap(p[x],p[y]);
		return;
	}
	swap(idx[p[x]],idx[p[k]]);
	swap(p[x],p[k]),swap(q[y],q[k]);
	fix(k,y);
}
int main(){
	#ifdef ldxcaicai
	freopen("lx.in","r",stdin);
	#endif
	n=1<<(k=read());
	int ss=0;
	for(ri i=0;i<n;++i)ss^=(a[i]=read()),p[i]=q[i]=idx[i]=i;
	if(ss)return puts("Fou"),0;
	puts("Shi");
	for(ri i=0,dt;i<n-1;++i){
		if(a[i]^vl[i]){
			vl[i+1]^=vl[i]^a[i];
			vl[i]=a[i];
			fix(i,i+1);
		}
	}
	for(ri i=0;i<n;++i)cout<<p[i]<<' ';
	puts("");
	for(ri i=0;i<n;++i)cout<<q[i]<<' ';
	return 0;
}