loj#2542. 「PKUWC2018」随机游走

题目
题解

Code

#include<cstdio>
const int M=998244353;
struct node{
	int to,ne;
}e[38];
int n,i,rt,x,y,h[18],S,tot,A[18],B[18],f[18][1<<18],d[18],q;
inline char gc(){
	static char buf[100000],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int rd(){
	int x=0,fl=1;char ch=gc();
	for (;ch<48||ch>57;ch=gc())if(ch=='-')fl=-1;
	for (;48<=ch&&ch<=57;ch=gc())x=(x<<3)+(x<<1)+(ch^48);
	return x*fl;
}
inline void wri(int a){if(a<0)a=-a,putchar('-');if(a>=10)wri(a/10);putchar(a%10|48);}
inline void wln(int a){wri(a);puts("");}
void ex_gcd(int a,int b,int &x,int &y){
	if (!b) x=1,y=0;
	else ex_gcd(b,a%b,y,x),y-=a/b*x;
}
void add(int x,int y){
	e[++tot]=(node){y,h[x]};
	h[x]=tot;
	d[x]++;
}
inline void ADD(int &x,int y){x+=y;if (x>=M) x-=M;}
void dfs1(int u,int fa){
	if (S&1<<u){
		A[u]=0,B[u]=0;
		if (S^1<<u){
			for (int i=h[u],t=S^(1<<u);i;i=e[i].ne) ADD(B[u],f[e[i].to][t]+1);
			ex_gcd(d[u],M,x,y),ADD(x,M);
			B[u]=1ll*x*B[u]%M;
		}
		for (int i=h[u],v;i;i=e[i].ne)
			if ((v=e[i].to)!=fa) dfs1(v,u);
	}else{
		int sa=0,sb=0;
		for (int i=h[u],v;i;i=e[i].ne)
			if ((v=e[i].to)!=fa) dfs1(v,u),ADD(sa,A[v]),ADD(sb,B[v]+1);
		sa=M-sa,ADD(sa,d[u]);
		ex_gcd(sa,M,x,y),ADD(x,M);
		if (u==rt) B[u]=1ll*x*sb%M;
		else A[u]=x,B[u]=1ll*x*(sb+1)%M;
	}
}
void dfs2(int u,int fa){
	f[u][S]=((u==rt?0:1ll*A[u]*f[fa][S]%M)+B[u])%M;
	for (int i=h[u],v;i;i=e[i].ne)
		if ((v=e[i].to)!=fa) dfs2(v,u);
}
int main(){
	n=rd(),q=rd(),rt=rd()-1;
	for (i=1;i<n;i++) x=rd()-1,y=rd()-1,add(x,y),add(y,x);
	for (S=1;S<1<<n;S++) dfs1(rt,n),dfs2(rt,n);
	for (;q--;){
		for (x=rd(),S=0;x--;) S|=1<<rd()-1;
		wln(f[rt][S]);
	}
}