可以知道横竖是没有影响的,那么分别dp出横竖的情况
r[k]表示竖着走k次有多少种情况
c[k]表示横着走k次有多少种情况
然后最后的结果是 C[K][i] * r[i] * c[K-i] 的求和
AC代码如下:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define MOD 9999991
long long r[1100], c[1100];
long long biao[1100][1100];
int N, M, K, X0, Y0;
long long temp[2][1100], now, pre;
int main(){
int T, Case = 1;
biao[0][0] = 1;
for( int i = 1; i <= 1000; i++ ){
biao[i][0] = biao[i][i] = 1;
for( int j = 1; j < i; j++ ){
biao[i][j] = ( biao[i-1][j-1] + biao[i-1][j] ) % MOD;
}
}
cin >> T;
while( T-- ){
cin >> N >> M >> K >> X0 >> Y0;
memset( r, 0, sizeof( r ) );
memset( c, 0, sizeof( c ) );
r[0] = c[0] = 1;
now = 0;
pre = 1;
memset( temp, 0, sizeof( temp ) );
temp[now][X0] = 1;
for( int i = 1; i <= K; i++ ){
swap( now, pre );
memset( temp[now], 0, sizeof( temp[now] ) );
long long sum = 0;
for( int j = 1; j <= N; j++ ){
if( j + 1 <= N ) temp[now][j] = ( temp[now][j] + temp[pre][j+1] ) % MOD;
if( j + 2 <= N ) temp[now][j] = ( temp[now][j] + temp[pre][j+2] ) % MOD;
if( j - 1 >= 1 ) temp[now][j] = ( temp[now][j] + temp[pre][j-1] ) % MOD;
if( j - 2 >= 1 ) temp[now][j] = ( temp[now][j] + temp[pre][j-2] ) % MOD;
sum = ( sum + temp[now][j] ) % MOD;
}
r[i] = sum;
}
now = 0;
pre = 1;
memset( temp, 0, sizeof( temp ) );
temp[now][Y0] = 1;
for( int i = 1; i <= K; i++ ){
swap( now, pre );
memset( temp[now], 0, sizeof( temp[now] ) );
long long sum = 0;
for( int j = 1; j <= M; j++ ){
if( j + 1 <= M ) temp[now][j] = ( temp[now][j] + temp[pre][j+1] ) % MOD;
if( j + 2 <= M ) temp[now][j] = ( temp[now][j] + temp[pre][j+2] ) % MOD;
if( j - 1 >= 1 ) temp[now][j] = ( temp[now][j] + temp[pre][j-1] ) % MOD;
if( j - 2 >= 1 ) temp[now][j] = ( temp[now][j] + temp[pre][j-2] ) % MOD;
sum = ( sum + temp[now][j] ) % MOD;
}
c[i] = sum;
}
long long ans = 0;
for( int i = 0; i <= K; i++ ){
ans = ( ans + ( ( biao[K][i] * r[i] % MOD ) * c[K-i] % MOD ) ) % MOD;
}
printf( "Case #%d:\n%I64d\n", Case++, ans );
}
return 0;
}