题意
你猜。
分析
注意到当k=0时,派系和阵营的限制是互不干扰的,我们可以对学校和城市分开处理,然后把方案乘起来即可。
多了限制之后,我们只要把被限制的城市和学校单独拿出来dp就好了。
代码
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<vector>
#define mp std::make_pair
#define pb push_back
typedef long long LL;
typedef std::pair<int,int> pi;
const int N=1005;
const int N1=2505;
const int N2=305;
const int MOD=998244353;
int n,m,K,M,c,b[N],s[N],po[N],g[N1],f[N1],h[35][N1][N2],tmp[N2],pre[N1][N1],sum1,sum2,id[35],C0,C1,D0,D1;
bool pd1[N],pd2[N];
std::vector<pi> vec[N];
void dp1()
{
g[0]=f[0]=1;
for (int i=1;i<=M;i++) f[i]=g[i]=0;
for (int i=1;i<=n;i++)
{
if (pd1[i]) continue;
for (int j=M;j>=s[i];j--)
(g[j]+=g[j-s[i]])%=MOD;
}
for (int i=1;i<=c;i++)
{
if(pd2[i]||!po[i]) continue;
for (int j=M;j>=po[i];j--)
(f[j]+=f[j-po[i]])%=MOD;
}
}
void dp2()
{
memset(h,0,sizeof(h));
h[0][0][0]=1;
for (int i=1;i<=m;i++)
for (int j=0;j<=M;j++)
{
for (int k=0;k<=K;k++) h[i][j][k]=h[i-1][j][k];
for (int k=0;k<vec[id[i]].size();k++)
{
int x=vec[id[i]][k].first,y=vec[id[i]][k].second;
if (y==2) continue;
else if (y==3)
{
for (int l=K;l>=s[x];l--) h[i][j][l]=h[i][j][l-s[x]];
for (int l=0;l<s[x];l++) h[i][j][l]=0;
}
else for (int l=K;l>=s[x];l--) (h[i][j][l]+=h[i][j][l-s[x]])%=MOD;
}
if (j<po[id[i]]) continue;
for (int k=0;k<=K;k++) tmp[k]=h[i-1][j-po[id[i]]][k];
for (int k=0;k<vec[id[i]].size();k++)
{
int x=vec[id[i]][k].first,y=vec[id[i]][k].second;
if (!y) continue;
else if (y==1)
{
for (int l=K;l>=s[x];l--) tmp[l]=tmp[l-s[x]];
for (int l=0;l<s[x];l++) tmp[l]=0;
}
else for (int l=K;l>=s[x];l--) (tmp[l]+=tmp[l-s[x]])%=MOD;
}
for (int k=0;k<=K;k++) (h[i][j][k]+=tmp[k])%=MOD;
}
}
void calc()
{
int ans=0;
pre[0][0]=1;
for (int i=1;i<=M;i++) pre[0][i]=(pre[0][i-1]+g[i])%MOD,pre[i][0]=(pre[i-1][0]+f[i])%MOD;
for (int i=1;i<=M;i++)
for (int j=1;j<=M;j++)
pre[i][j]=(pre[i][j-1]+pre[i-1][j])%MOD,(pre[i][j]+=MOD-pre[i-1][j-1])%=MOD,(pre[i][j]+=(LL)f[i]*g[j]%MOD)%=MOD;
for (int i=0;i<=M;i++)
for (int j=0;j<=K;j++)
{
int x2=C0-i,x1=sum1-(C1-(sum2-i)),y2=D0-j,y1=sum1-(D1-(sum2-j));
x2=std::min(x2,M);y2=std::min(y2,M);x1=std::max(x1,0);y1=std::max(y1,0);
if (x1>x2||y1>y2) continue;
int w=(pre[x2][y2]-(y1>0?pre[x2][y1-1]:0)-(x1>0?pre[x1-1][y2]:0)+(x1>0&&y1>0?pre[x1-1][y1-1]:0))%MOD;
w+=w<0?MOD:0;
(ans+=(LL)w*h[m][i][j]%MOD)%=MOD;
}
printf("%d\n",ans);
}
int main()
{
int T;scanf("%d",&T);
while (T--)
{
scanf("%d%d",&n,&c);
scanf("%d%d%d%d",&C0,&C1,&D0,&D1);
M=std::max(C0,std::max(C1,std::max(D0,D1)));
sum1=sum2=0;
for (int i=1;i<=std::max(n,c);i++) pd1[i]=pd2[i]=0,po[i]=0,vec[i].clear();
for (int i=1;i<=n;i++) scanf("%d%d",&b[i],&s[i]),po[b[i]]+=s[i],sum1+=s[i];
scanf("%d",&m);
for (int i=1;i<=m;i++)
{
int x,y;scanf("%d%d",&x,&y);
pd1[x]=1;pd2[b[x]]=1;
vec[b[x]].pb(mp(x,y));
}
K=m*10;
m=0;
for (int i=1;i<=c;i++)
if (pd2[i]) id[++m]=i,sum1-=po[i],sum2+=po[i];
dp1();
dp2();
calc();
}
return 0;
}