Submission #3043444

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
using namespace std;


typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).rend()
#define PB push


#define MOD 1000000007LL
#define EPS 1e-8

int x[ 25 ];
int fix[ 26 ];
int dp[ 1 << 25 ];
vector<int> V;

int main()
{
	REP( i, 26 ) fix[ i ] = -1;
	REP( i, 25 )
	{
		cin >> x[ i ];
		if( x[ i ] == 0 ) V.push_back( i );
		else fix[ x[ i ] ] = i;
	}

	dp[ 0 ] = 1;

	for( int bits = 0; bits <= ( 1 << 25 ) - 1; ++bits )
	{
		if( dp[ bits ] )
		{
			int nextNum = __builtin_popcount( bits ) + 1;
			vector<int> v;
			if( fix[ nextNum ] >= 0 ) v.push_back( fix[ nextNum ] );
			else v = V;
			for( auto p : v )
			{
				if( ( bits & ( 1 << p ) ) == 0 )
				{
					int y = p / 5;
					int x = p % 5;
					if( y > 0 && y < 4 && ( ( ( bits >> ( p - 5 ) ) ^ ( bits >> ( p + 5 ) ) ) & 1 ) ) continue;
					if( x > 0 && x < 4 && ( ( ( bits >> ( p - 1 ) ) ^ ( bits >> ( p + 1 ) ) ) & 1 ) ) continue;
					dp[ bits | ( 1 << p ) ] += dp[ bits ];
					dp[ bits | ( 1 << p ) ] %= MOD;
				}
			}
		}
	}
	cout << dp[ ( 1 << 25 ) - 1 ] << endl;
	return 0;
}

Submission Info

Judge Result