bzoj 3120: Line

这道题，摆着它40s的时限，隐藏着卡常数的真面目。180个点的矩乘，我默上了板子，却t成狗，加了一些常数优化才过。

f[i][a][b][c][j]表示前i列，有a行结尾是011 b行结尾是01 c行结尾是0，出现j列全是男生的方案数

转移 f[i][a][b][c][j]*C[c][e]*C[b][d]->f[i+1][d][e][f][j+(f==0)]

常数优化:

1.不要 ll *operator [] (int x) { return a[x];} 这句话

2.矩乘时加一个if a.a[i][k] 再枚举j

另，开始看反nm的数据范围了。

   
   

    
    

     
     #include<cstdio>
    
    
    
    

     
     #include<cstdlib>
    
    
    
    

     
     #include<cstring>
    
    
    
    

     
     #include<algorithm>
    
    
    
    

     
      
    
    
    
    

     
     #define ll long long
    
    
    
    

     
     #define inf 1e9
    
    
    
    

     
     #define eps 1e-8
    
    
    
    

     
     #define md 1000000007
    
    
    
    

     
     using namespace std;
    
    
    
    

     
      
    
    
    
    

     
     struct Ju
    
    
    
    

     
     {
    
    
    
    

     
     	ll a[200][200];
    
    
    
    

     
     	int x,y;
    
    
    
    

     
     	//ll *operator [] (int x) { return a[x];}
    
    
    
    

     
     } A,ju,mid,ans;
    
    
    
    

     
     ll C[10][10];
    
    
    
    

     
     int g[10][10][5];
    
    
    
    

     
     void operator *= (Ju &a,Ju &b)
    
    
    
    

     
     {
    
    
    
    

     
     	memset(mid.a,0,sizeof(mid.a));
    
    
    
    

     
     	mid.x=a.x; mid.y=b.y;
    
    
    
    

     
     	for (int i=1;i<=a.x;i++)
    
    
    
    

     
     	  for (int k=1;k<=a.y;k++)
    
    
    
    

     
     		if (a.a[i][k])
    
    
    
    

     
     		{
    
    
    
    

     
     			for (int j=1;j<=b.y;j++)
    
    
    
    

     
     		      mid.a[i][j]=(mid.a[i][j]+a.a[i][k]*b.a[k][j])%md;
    
    
    
    

     
     		  }
    
    
    
    

     
     	a=mid;
    
    
    
    

     
     }
    
    
    
    

     
      
    
    
    
    

     
     void kpow(Ju &a,ll b)
    
    
    
    

     
     {
    
    
    
    

     
     	ans.x=a.x; ans.y=a.y;
    
    
    
    

     
     	memset(ans.a,0,sizeof(ans.a));
    
    
    
    

     
     	for (int i=1;i<=ans.x;i++) ans.a[i][i]=1;
    
    
    
    

     
     	while (b)
    
    
    
    

     
     	{
    
    
    
    

     
     		if (b&1) ans*=a;
    
    
    
    

     
     		a*=a; b>>=1;
    
    
    
    

     
     	}
    
    
    
    

     
     	a=ans;
    
    
    
    

     
     }
    
    
    
    

     
      
    
    
    
    

     
      
    
    
    
    

     
     int main()
    
    
    
    

     
     {
    
    
    
    

     
     	int n,P,Q,cnt=0; ll m;
    
    
    
    

     
     	scanf("%d%lld%d%d",&n,&m,&P,&Q);
    
    
    
    

     
     	C[0][0]=1;
    
    
    
    

     
     	for (int i=1;i<=n;i++)
    
    
    
    

     
     	{
    
    
    
    

     
     		C[i][0]=1;
    
    
    
    

     
     		for (int j=1;j<=i;j++)
    
    
    
    

     
     		  C[i][j]=(C[i-1][j-1]+C[i-1][j])%md;
    
    
    
    

     
     	}
    
    
    
    

     
     	for (int a=0;a<=n;a++)
    
    
    
    

     
     	{
    
    
    
    

     
     		if (P<3&&a>0) continue;
    
    
    
    

     
     		for (int b=0;a+b<=n;b++)
    
    
    
    

     
     		{
    
    
    
    

     
     			if (P<2&&b>0) continue;
    
    
    
    

     
     			for (int j=0;j<=Q;j++) g[a][b][j]=++cnt;
    
    
    
    

     
     		}
    
    
    
    

     
     	}
    
    
    
    

     
     	for (int a=0;a<=n;a++)
    
    
    
    

     
     	{
    
    
    
    

     
     		for (int b=0;a+b<=n;b++)
    
    
    
    

     
     		{
    
    
    
    

     
     			if (!g[a][b][0]) continue;
    
    
    
    

     
     			int c=n-a-b;
    
    
    
    

     
     			for (int d=0;d<=b;d++)
    
    
    
    

     
     			  for (int e=0;e<=c;e++)
    
    
    
    

     
     			  {
    
    
    
    

     
     			  	if (!g[d][e][0]) continue;
    
    
    
    

     
     			  	int f=n-d-e;
    
    
    
    

     
     			  	for (int j=Q-(f==0);j>=0;j--)
    
    
    
    

     
     				  ju.a[g[a][b][j]][g[d][e][j+(f==0)]]=C[c][e]*C[b][d]%md;
    
    
    
    

     
     			  }
    
    
    
    

     
     		}
    
    
    
    

     
     	}
    
    
    
    

     
     	ju.x=ju.y=cnt; kpow(ju,m);
    
    
    
    

     
     	A.x=1; A.y=cnt; A.a[1][g[0][0][0]]=1; A*=ju;
    
    
    
    

     
     	ll ans=0;
    
    
    
    

     
     	for (int i=1;i<=cnt;i++) ans=(ans+A.a[1][i])%md;
    
    
    
    

     
     	printf("%lld\n",ans);
    
    
    
    

     
     	return 0;
    
    
    
    

     
     }