传送门
题解:
当时做ZJOI的时候Day1就这一道不会,只写了70pts暴力(当时连DDP都不知道是什么东西)。
首先和ZJOI2019 D1T1一样的转化思想,并不好计算稳定度为 k k k的集合,考虑计算稳定度不超过 k k k的。
首先我们知道初始状态有一条唯一的答案链。
链上任何一个节点的权值改变都会导致答案改变,并且链上所有点的权值在初始情况下都等于答案。
对于深度奇偶性分类讨论,然后补集转化就能 O ( n ) O(n) O(n)算出不超过 k k k的集合个数。
显然是一个DDP。发现维护其实就是直接一次函数复合后在 0 0 0的点值。
用全局平衡二叉树会很麻烦,需要对删去答案链后的所有连通块建立全局平衡二叉树。
直接链分治+线段树搞定了。
代码(70pts暴力):
#include<bits/stdc++.h>
#define ll long long
#define re register
#define gc get_char
#define cs const
namespace IO{
inline char get_char(){
static cs int Rlen=1<<20|1;
static char buf[Rlen],*p1,*p2;
return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;
}
inline int getint(){
re char c;
while(!isdigit(c=gc()));re int num=c^48;
while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
return num;
}
}
using namespace IO;
using std::cout;
using std::cerr;
inline void ckmax(int &a,int b){a<b?a=b:a;}
inline void ckmin(int &a,int b){a>b?a=b:a;}
cs int mod=998244353;
inline int add(int a,int b){return a+b>=mod?a+b-mod:a+b;}
inline void Inc(int &a,int b){(a+=b)>=mod?a-=mod:a;}
inline int dec(int a,int b){return a<b?a-b+mod:a-b;}
inline int mul(int a,int b){return (ll)a*b%mod;}
inline int quickpow(int a,int b,int res=1){
while(b){
res=mul(res,a);
a=mul(a,a);
b>>=1;
}
return res;
}
cs int N=2e5+5;
int n;
int p2[N];
std::vector<int> G[N];
inline void addedge(int u,int v){
G[u].push_back(v);
G[v].push_back(u);
}
int val[N],siz[N],dep[N];
void dfs(int u,int fa){
if(dep[u]&1)val[u]=1;
else val[u]=n;
bool leaf=true;
for(re int v:G[u])if(v^fa){
leaf=false;
dep[v]=dep[u]+1;
dfs(v,u);
siz[u]+=siz[v];
if(dep[u]&1)ckmax(val[u],val[v]);
else ckmin(val[u],val[v]);
}
if(leaf){
siz[u]=1;
val[u]=u;
}
}
int get_max(int u,int fa,int d,int aim){
if(G[u].size()==1)return (int)(val[u]<=aim)+(int)(val[u]+d<=aim);
if(dep[u]&1){
int res=1;
for(re int v:G[u])if(v!=fa)
res=mul(res,get_max(v,u,d,aim));
return res;
}
else {
int res=1;
for(re int v:G[u])if(v!=fa)
res=mul(res,dec(p2[siz[v]],get_max(v,u,d,aim)));
return dec(p2[siz[u]],res);
}
}
int get_min(int u,int fa,int d,int aim){
if(G[u].size()==1)return (int)(val[u]>=aim)+(int)(val[u]-d>=aim);
if(dep[u]&1){
int res=1;
for(re int v:G[u])if(v!=fa)
res=mul(res,dec(p2[siz[v]],get_min(v,u,d,aim)));
return dec(p2[siz[u]],res);
}
else {
int res=1;
for(re int v:G[u])if(v!=fa)
res=mul(res,get_min(v,u,d,aim));
return res;
}
}
int get_ans(int u,int fa,int d){
int res=1;
for(re int v:G[u])if(v!=fa){
if(val[u]==val[v])res=mul(res,get_ans(v,u,d));
else if(dep[u]&1)res=mul(res,get_max(v,u,d,val[u]));
else res=mul(res,get_min(v,u,d,val[u]));
}
return res;
}
inline int get_ans(int w){
if(!w)return 0;
if(w==n)return p2[siz[1]]-1;
return dec(p2[siz[1]],get_ans(1,0,w));
}
int l,r;
int ans[N];
signed main(){
// freopen("lx.in","r",stdin);
n=getint(),l=getint(),r=getint();
for(int re i=1;i<n;++i)addedge(getint(),getint());
dep[1]=1;dfs(1,0);
p2[0]=1;
for(int re i=1;i<=n;++i)p2[i]=add(p2[i-1],p2[i-1]);
for(int re i=l-1;i<=r;++i)
ans[i]=get_ans(i);
for(int re i=l;i<=r;++i)
cout<<dec(ans[i],ans[i-1])<<" ";
return 0;
}
代码(链分治):
#include<bits/stdc++.h>
#define ll long long
#define re register
#define gc get_char
#define cs const
namespace IO{
inline char get_char(){
static cs int Rlen=1<<22|1;
static char buf[Rlen],*p1,*p2;
return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;
}
template<typename T>
inline T get(){
char c;
while(!isdigit(c=gc()));T num=c^48;
while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
return num;
}
inline int gi(){return get<int>();}
}
using namespace IO;
using std::cerr;
using std::cout;
cs int mod=998244353;
inline int add(int a,int b){a+=b-mod;return a+(a>>31&mod);}
inline int dec(int a,int b){a-=b;return a+(a>>31&mod);}
inline int mul(int a,int b){ll r=(ll)a*b;return r>=mod?r%mod:r;}
inline int power(int a,int b,int res=1){
for(;b;b>>=1,a=mul(a,a))(b&1)&&(res=mul(res,a));
return res;
}
inline void Inc(int &a,int b){a+=b-mod;a+=a>>31&mod;}
inline void Dec(int &a,int b){a-=b;a+=a>>31&mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
struct num{
int x,y;
num(){*this=1;}
void operator=(int v){v?(x=v,y=0):(x=y=1);}
void operator*=(int v){v?x=mul(x,v):++y;}
void operator/=(int v){v?x=power(v,mod-2,x):--y;}
operator int()cs{return y?0:x;}
};
struct func{
int k,b;
func(){}
func(int _k,int _b):k(_k),b(_b){}
func operator()(cs func &y)cs{
return func(mul(k,y.k),add(mul(k,y.b),b));
}
};
cs int N=2e5+5;
namespace SGT{
#define lc k<<1
#define rc k<<1|1
func f[N<<2];
inline void pushup(int k){
f[k]=f[lc](f[rc]);
}
inline void build(int k,int l,int r){
f[k]=func(1,0);
if(l==r)return ;
int mid=l+r>>1;
build(lc,l,mid);
build(rc,mid+1,r);
}
inline void modify(int k,int l,int r,int p,func v){
if(l==r){f[k]=v;return ;}
int mid=l+r>>1;
if(p<=mid)modify(lc,l,mid,p,v);
else modify(rc,mid+1,r,p,v);
pushup(k);
}
inline func query(int k,int l,int r,int ql,int qr){
if(ql<=l&&r<=qr)return f[k];
int mid=(l+r)>>1;
if(qr<=mid)return query(lc,l,mid,ql,qr);
if(mid<ql)return query(rc,mid+1,r,ql,qr);
return query(lc,l,mid,ql,qr)(query(rc,mid+1,r,ql,qr));
}
#undef lc
#undef rc
}
int n,L,R;
std::vector<int> G[N];
bool leaf[N],typ[N];
int key[N],lf[N],val[N],dep[N],fa[N];
int siz[N],son[N],top[N],bot[N],in[N],dfn;
int dp[N],ans[N],all=1;
num prod[N];
std::vector<int> modi[N];
void pre_dfs(int u,int p){
leaf[u]=true;
lf[u]=siz[u]=1;
dep[u]=dep[p]+1;
val[u]=dep[u]&1?1:n;
for(int re v:G[u])if(v!=p){
leaf[u]=false;
pre_dfs(v,u);
siz[u]+=siz[v],Mul(lf[u],lf[v]);
if(siz[v]>siz[son[u]])son[u]=v;
if(dep[u]&1){
if(val[v]>val[u])val[u]=val[v],key[u]=v;
}
else {
if(val[v]<val[u])val[u]=val[v],key[u]=v;
}
}
if(leaf[u]){
lf[u]=2;
val[u]=u;
}
}
void dfs(int u,int p,int tp,bool t,bool mx){
fa[u]=p,in[u]=++dfn;
typ[u]=t,prod[u]=1,top[u]=tp;
if(leaf[u]){
if(mx){
dp[u]=2*(val[u]<=val[1]);
if(val[u]<=val[1])modi[val[1]-val[u]+1].push_back(u);
}
else {
dp[u]=2*(val[u]>=val[1]);
if(val[u]>=val[1])modi[val[u]-val[1]+1].push_back(u);
}
SGT::modify(1,1,n,in[u],func(0,dp[u]));
}
if(son[u]){
dfs(son[u],u,tp,!t,mx);
bot[u]=bot[son[u]];
}else bot[u]=u;
for(int re v:G[u])if(v!=p&&v!=son[u]){
dfs(v,u,v,!t,mx);
if(t)prod[u]*=dp[v];
else prod[u]*=dec(lf[v],dp[v]);
}
if(son[u]){
if(t){
dp[u]=mul(prod[u],dp[son[u]]);
SGT::modify(1,1,n,in[u],func(prod[u],0));
}
else {
dp[u]=mul(prod[u],dec(lf[son[u]],dp[son[u]]));
dp[u]=dec(lf[u],dp[u]);
SGT::modify(1,1,n,in[u],func(prod[u],lf[u]-mul(prod[u],lf[son[u]])));
}
}
}
void get_dfn(int u,int p){
if(key[u]){
get_dfn(key[u],u);
for(int re v:G[u])if(v!=p&&v!=key[u]){
dfs(v,u,v,false,dep[u]&1);
Mul(all,dp[v]);fa[v]=0;
}
}
}
inline void modify(int u){
SGT::modify(1,1,n,in[u],func(0,dec(dp[u],1)));
int tmp=SGT::query(1,1,n,in[top[u]],in[bot[u]]).b;
u=top[u];
while(fa[u]){
int p=fa[u];
if(typ[p])prod[p]*=tmp,prod[p]/=dp[u];
else prod[p]*=dec(lf[u],tmp),prod[p]/=dec(lf[u],dp[u]);
dp[u]=tmp,u=p;
if(typ[u])SGT::modify(1,1,n,in[u],func(prod[u],0));
else SGT::modify(1,1,n,in[u],func(prod[u],dec(lf[u],mul(prod[u],lf[son[u]]))));
tmp=SGT::query(1,1,n,in[top[u]],in[bot[u]]).b;
u=top[u];
}
Mul(all,power(dp[u],mod-2,tmp));
dp[u]=tmp;
}
signed main(){
#ifdef zxyoi
freopen("minimax.in","r",stdin);
#endif
n=gi(),L=gi(),R=gi();
for(int re i=1;i<n;++i){
int u=gi(),v=gi();
G[u].push_back(v);
G[v].push_back(u);
}
SGT::build(1,1,n);
pre_dfs(1,0);get_dfn(1,0);
for(int re i=1;i<n;++i){
for(int re u:modi[i])modify(u);
ans[i]=dec(lf[1],all);
}
ans[n]=dec(lf[1],1);
for(int re i=n;i;--i)Dec(ans[i],ans[i-1]);
for(int re i=L;i<=R;++i)cout<<ans[i]<<" ";
return 0;
}