POJ 1187 陨石的秘密 G++ 巧妙 dfs dp 真没掌握

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
//看博友分析     抄博友程序     巧妙      dfs     dp     真没掌握 
int mod=11380;
int l1,l2,l3,d;
int dp[12][12][12][34];//抄博友程序    dp[a][b][c][d]表示{}[]()分别有a b c个形成最大嵌套深度小于等于d的方法数
int dfs(int x,int y,int z,int deep)
{
	if(x==0 && y==0 && z==0)
	{
		return dp[x][y][z][deep]=1;//抄博友程序  没掌握 
	}
	if(deep==0)
	{
		return dp[x][y][z][deep]=0;
	}
	if(dp[x][y][z][deep]!=-1)
	{
		return dp[x][y][z][deep];
	}
	int ans=0; 
	
	for(int k=0;k<=z;k++)
	{
		if(k)
		{
			ans=(ans+(dfs(0,0,k-1,deep-1)*dfs(x,y,z-k,deep))%mod)%mod;//没掌握 
		}
		for(int j=0;j<=y;j++)
		{
			if(j)
			{
				ans=(ans+(dfs(0,j-1,k,deep-1)*dfs(x,y-j,z-k,deep))%mod)%mod;//没掌握 
			}
			for(int i=0;i<=x;i++)
			{
				if(i)
				{
					ans=(ans+(dfs(i-1,j,k,deep-1)*dfs(x-i,y-j,z-k,deep)%mod))%mod;
				}
			} 			
		}
	}
	/*
	for(int i=0;i<=z;i++)
	{
		if(i)
		{
			ans+=(dfs(0,0,i-1,deep-1)*dfs(x,y,z-i,deep))%mod;
			ans=ans%mod;
		}
		for(int j=0;j<=y;j++)
		{
			if(j)
			{
				ans+=(dfs(0,j-1,i,deep-1)*dfs(x,y-j,z-i,deep))%mod;
				ans=ans%mod;
			}
			for(int k=1;k<=x;k++)
			{
				ans+=(dfs(k-1,j,i,deep-1)*dfs(x-k,y-j,z-i,deep))%mod;
				ans=ans%mod;
			}
		}
	}*/
	//cout<<x<<" "<<y<<" "<<z<<" "<<deep<<" "<<ans<<endl; 	
	return dp[x][y][z][deep]=ans;
}
int main()
{
	cin>>l1>>l2>>l3>>d;
	memset(dp,-1,sizeof(dp));
	dfs(l1,l2,l3,d);
	if(d)//抄博友程序 
	{
		dfs(l1,l2,l3,d-1);
	}
	if(d==0)
	{
		cout<<dp[l1][l2][l3][d]<<endl;
		//cout<<0<<endl;//wa
	}else
	{
		//cout<<(dp[l1][l2][l3][d]-dp[l1][l2][l3][d-1]+mod)%mod<<endl;
		cout<<((dp[l1][l2][l3][d] - dp[l1][l2][l3][d-1]) % mod + mod) % mod<<endl;
	}
	return 0;
}