Submission #2168152

---

Source Code Expand

#include<iostream>
#include<vector>
using namespace std;
int M=1e9+7,dp[1<<25],x[26],a;
vector<int>G;
main()
{
	for(int i=0;i<25;i++)
	{
		cin>>a;
		if(a==0)G.push_back(i);
		else x[a]=i+1;
	}
	dp[0]=1;
	for(int i=0;i<1<<25;i++)
	{
		if(!dp[i])continue;
		int b=__builtin_popcount(i)+1;
		if(x[b])
		{
			int r=x[b]-1;
			int X=r/5,Y=r%5;
			if(!((i>>r)&1))
			{
				if(X>0&&X<4&&((i>>(r-5))^(i>>(r+5)))&1)continue;
				if(Y>0&&Y<4&&((i>>(r-1))^(i>>(r+1)))&1)continue;
				dp[i|(1<<r)]+=dp[i];
				if(dp[i|(1<<r)]>=M)dp[i|(1<<r)]-=M;
			}
		}
		else
		{
			for(int j=0;j<G.size();j++)
			{
				int r=G[j],X=G[j]/5,Y=G[j]%5;
				if(!((i>>r)&1))
				{
					if(X>0&&X<4&&((i>>(r-5))^(i>>(r+5)))&1)continue;
					if(Y>0&&Y<4&&((i>>(r-1))^(i>>(r+1)))&1)continue;
					dp[i|(1<<r)]+=dp[i];
					if(dp[i|(1<<r)]>=M)dp[i|(1<<r)]-=M;
				}
			}
		}
	}
	cout<<dp[(1<<25)-1]<<endl;
}

Submission Info

Judge Result