【洛谷 P4921】—情侣？给我烧了！（加强版）(容斥+组合数学)

传送门

---

接着之前的思路继续推

瓶颈在于预处理$f(n)$

考虑化一下
$$\begin{gathered} f(n)=\sum _{j=0}^n(-1{)}^j\frac{1}{j!}{2}^j\frac{1}{(n-j){!}^2}(2n-2j)! \\ =\frac{1}{n{!}^2}\sum _{j=0}^n(-1{)}^{j}j!2^j\left(\genfrac{}{}{0ex}{}{n}{j}\right)(2n-2j)! \\ =\frac{1}{n{!}^2}\sum _{j=0}^n(-1{)}^j{g}_j \end{gathered}$$

考虑这个式子的意义容斥出来就是没有情侣坐一起的方案数
那考虑新加一对情侣
考虑把1个或2个人拿出来和别的换
即有$f_n=(2n-2)(f_{n-1}+f_{n-2})$
最后乘一个$2^{n}n!$即可

这样$O(n)$预处理出了$f$就做完了

#include<bits/stdc++.h>
using namespace std;
#define gc getchar
inline int read(){
	char ch=gc();
	int res=0,f=1;
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
	return f?res:-res;
}
#define re register
#define pb push_back
#define cs const
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long
#define poly vector<int>
#define bg begin
cs int mod=998244353,G=3;
inline int add(int a,int b){return (a+=b)>=mod?a-mod:a;}
inline void Add(int &a,int b){(a+=b)>=mod?(a-=mod):0;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline void Dec(int &a,int b){(a-=b)<0?(a+=mod):0;}
inline int mul(int a,int b){return 1ll*a*b>=mod?1ll*a*b%mod:a*b;}
inline void Mul(int &a,int b){a=mul(a,b);}
inline int ksm(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 chemx(int &a,int b){a<b?a=b:0;}
inline void chemn(int &a,int b){a>b?a=b:0;}
cs int N=5000005;
int fac[N],ifac[N],bin[N];
int n,f[N];
#define P(x) mul((x),(x))
inline int C(int n,int m){
	if(n<m)return 0;
	return mul(fac[n],mul(ifac[m],ifac[n-m]));
}
inline void init(int len=N-5){
	bin[0]=fac[0]=ifac[0]=f[0]=1;
	for(int i=1;i<=len;i++)fac[i]=mul(fac[i-1],i);
	ifac[len]=ksm(fac[len],mod-2);
	for(int i=len-1;i;i--)ifac[i]=mul(ifac[i+1],i+1);
	for(int i=1;i<=len;i++)bin[i]=mul(bin[i-1],2);
	for(int i=2;i<=len;i++)f[i]=mul(2*i-2,add(f[i-1],f[i-2]));
	for(int i=0;i<=len;i++)Mul(f[i],mul(mul(fac[i],bin[i]),P(ifac[i])));
}
int main(){
	init();
	int T=read();
	while(T--){
		int n=read(),k=read();
		cout<<mul(f[n-k],mul(ifac[k],mul(P(fac[n]),bin[k])))<<'\n';
	}
}