[ZROI322]C酱的表格 组合数学

[ZROI322]

• 考虑贡献即可

 

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int mod=998244353;
const int N=1e7+2e5;
int f[N],fact[N],ifact[N],inva[N],ans=0,n,m,a,b,p,q,x,y;
inline int read(){
	int num=0;char ch=getchar();
	while(!isdigit(ch))ch=getchar();
	while(isdigit(ch))num=num*10+ch-'0',ch=getchar();
	return num;
}
inline void Print(int x){if(x>9)Print(x/10);putchar(x%10+'0');}
int power(int a,int b)
{int ans=1;for(;b;b>>=1,a=1LL*a*a%mod)if(b&1)ans=1LL*ans*a%mod;return ans;}

inline int C(int n,int m){
	if(n<0||m<0||n<m)return 0;
	return 1LL*fact[n]*ifact[m]%mod*ifact[n-m]%mod;
} 
void subtask2(int x,int y){
	int ans=0;
	rep(i,max(1,y-x+p),y)ans=(ans+1LL*C(x-p,y-i)*f[i]%mod*power(b,y-i)%mod*power(a,x-p-y+i)%mod)%mod;
	Print(ans);puts("");
}
void subtask1(int x,int y){
	int ans=0;
	rep(i,1,y)ans=(ans+1LL*f[i]*inva[p-x+y-i]%mod*power(-b,y-i)%mod*C(y-i+p-x-1,p-x-1)%mod+mod)%mod;
	Print(ans);puts("");
}
int main()
{

	m=read(),n=read(),a=read(),b=read(),p=read(),q=read();
	fact[0]=1;rep(i,1,n+m)fact[i]=1LL*i*fact[i-1]%mod;
	ifact[0]=ifact[1]=1;rep(i,2,n+m)ifact[i]=(-1LL*mod/i*ifact[mod%i]%mod+mod)%mod;
	rep(i,1,n+m)ifact[i]=1LL*ifact[i]*ifact[i-1]%mod;
	int fuck=power(a,mod-2);inva[0]=1;rep(i,1,n+m)inva[i]=1LL*fuck*inva[i-1]%mod;
	rep(i,1,n)f[i]=read();
	while(q--){
		x=read(),y=read();
		if(x>=p)subtask2(x,y);
		else subtask1(x,y);
	}
	return 0;
}