Submission #123013

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <numeric>
#include <iterator>

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef istringstream ISS;
typedef ostringstream OSS;

#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )
#define FOR( v, c ) for ( auto &v : c )
#define EACH( it, c ) for ( auto it = c.begin(); it != c.end(); ++it )
#define ALL( c ) (c).begin(), (c).end()
#define DRANGE( c, p ) (c).begin(), (c).begin() + p, (c).end()

#define PB( n ) push_back( n )>> d >
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )

#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
#define DEBUG( x ) cerr << __FILE__ << ":" << __LINE__ << ": " << #x << " = " << ( x ) << endl

const int MOD = 1000000007;

int dp[ 30 * 30 + 1 ][ 30 * 30 + 2 ][ 1 << 4 ];

int solve2( const int N, const int A, const int B )
{
	VVI dp( N + 1, VI( A + 2, 0 ) );
	dp[0][0] = 1;

	REP( i, 0, N )
	{
		REP( a, 0, A + 1 )
		{
			const int b = i - a;

			if ( a < A )
			{
				( dp[ i + 1 ][ a + 1 ] += dp[i][a] ) %= MOD;
			}
			if ( b < B )
			{
				( dp[ i + 1 ][a] += dp[i][a] ) %= MOD;
			}
		}
	}

	return dp[N][A];
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int R, C, X, Y, D, L;
	cin >> R >> C >> X >> Y >> D >> L;

	dp[0][0][0] = 1;
	//dp[ i 箇所決定 ][ 何かを置いた数 ][ 上下左右のフラグ ] := 場合の数

	REP( i, 0, X * Y )
	{
		REP( j, 0, X * Y + 1 )
		{
			REP( k, 0, 1 << 4 )
			{
				int nk = k;
				nk |= i < Y;
				nk |= ( i % Y == 0 ) << 1;
				nk |= ( X * Y - Y <= i ) << 2;
				nk |= ( i % Y == Y - 1 ) << 3;

				{ // 何も置かない
					( dp[ i + 1 ][j][k] += dp[i][j][k] ) %= MOD;
				}
				{ // 何かを置く
					( dp[ i + 1 ][ j + 1 ][ nk ] += dp[i][j][k] ) %= MOD;
				}
			}
		}
	}


	LL res = (LL)dp[ X * Y ][ D + L ][ ( 1 << 4 ) - 1 ] * solve2( D + L, D, L );
	( res *= R - X + 1 ) %= MOD;
	( res *= C - Y + 1 ) %= MOD;

	cout << res << endl;

	return 0;
}

Submission Info

Judge Result