[容斥 DP] Topcoder SRM 498 DIV1 Hard. FoxJumping

容斥
令 $f_{i,j}$ 表示走了 $i$ 步不合法的，x和y都走了 $j$ 的方案数
$l_{i,j}$，$r_{i,j}$ 分别表示在x，y方向上随便走了 $i$ 步，走了 $j$ 的方案数

那么答案是

$$\sum_{d=0}^R(-1)^d{R\choose d}\sum_{i=0}^nf_{d,i}\times l_{R-d,n-i}\times r_{R-d,m-i}$$

// BEGIN CUT HERE  

// END CUT HERE  
#include <vector>  
#include <list>  
#include <map>  
#include <set>  
#include <deque>  
#include <stack>  
#include <bitset>  
#include <algorithm>  
#include <functional>  
#include <numeric>  
#include <utility>  
#include <sstream>  
#include <iostream>  
#include <iomanip>  
#include <cstdio>  
#include <cmath>  
#include <cstdlib>  
#include <ctime>  
#include <queue>
#include <assert.h>
#include <cstring>  
#define pb push_back
#define fi first
#define se second

using namespace std;  

const int N=1610,P=10007;

int n,m,t,a[N],f[N][N],l[N][N],r[N][N],C[N][N],tmp[N];

class FoxJumping{  
public:  
  int getCount(int Tx, int Ty, int Mx, int My, int R, vector <int> bad) {
    n=Tx; m=Ty; t=bad.size();
    for(int i=1;i<=t;i++) a[i]=bad[i-1];
    a[++t]=0; sort(a+1,a+1+t); t=unique(a+1,a+1+t)-a-1;
    memset(f,0,sizeof(f)); memset(l,0,sizeof(l)); memset(r,0,sizeof(r));
    f[0][0]=l[0][0]=r[0][0]=1;
    C[0][0]=1;
    for(int i=1;i<=R;i++){
      C[i][0]=1;
      for(int j=1;j<=i;j++) C[i][j]=(C[i-1][j-1]+C[i-1][j])%P;
    }
    for(int i=1;i<=R;i++)
      for(int j=0;j<=min(n,m);j++)
    for(int k=1;k<=t;k++)
      if(a[k]<=j) f[i][j]=(f[i][j]+f[i-1][j-a[k]])%P;
    for(int i=1;i<=R;i++){
      tmp[0]=l[i-1][0];
      for(int j=1;j<=n;j++) tmp[j]=(tmp[j-1]+l[i-1][j])%P;
      for(int j=0;j<=n;j++)
    l[i][j]=(tmp[j]+P-(j-Mx-1<0?0:tmp[j-Mx-1]))%P;
    }
    for(int i=1;i<=R;i++){
      tmp[0]=r[i-1][0];
      for(int j=1;j<=m;j++) tmp[j]=(tmp[j-1]+r[i-1][j])%P;
      for(int j=0;j<=m;j++)
    r[i][j]=(tmp[j]+P-(j-My-1<0?0:tmp[j-My-1]))%P;
    }
    int ans=0;
    for(int d=0;d<=R;d++){
      int cur=0;
      for(int i=0;10*i<=min(n,m);i++)
    cur=(cur+f[d][i*10]*l[R-d][n-i*10]%P*r[R-d][m-i*10])%P;
      if(d&1) ans=(ans-C[R][d]*cur)%P;
      else ans=(ans+C[R][d]*cur)%P;
    }
    return (ans+P)%P;
  }


  // BEGIN CUT HERE
public:
  void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); if ((Case == -1) || (Case == 5)) test_case_5(); }
private:
  template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
  void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
  void test_case_0() { int Arg0 = 2; int Arg1 = 2; int Arg2 = 1; int Arg3 = 1; int Arg4 = 2; int Arr5[] = {}; vector <int> Arg5(Arr5, Arr5 + (sizeof(Arr5) / sizeof(Arr5[0]))); int Arg6 = 1; verify_case(0, Arg6, getCount(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5)); }
  void test_case_1() { int Arg0 = 2; int Arg1 = 2; int Arg2 = 1; int Arg3 = 1; int Arg4 = 3; int Arr5[] = {}; vector <int> Arg5(Arr5, Arr5 + (sizeof(Arr5) / sizeof(Arr5[0]))); int Arg6 = 6; verify_case(1, Arg6, getCount(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5)); }
  void test_case_2() { int Arg0 = 10; int Arg1 = 10; int Arg2 = 10; int Arg3 = 10; int Arg4 = 1; int Arr5[] = {}; vector <int> Arg5(Arr5, Arr5 + (sizeof(Arr5) / sizeof(Arr5[0]))); int Arg6 = 1; verify_case(2, Arg6, getCount(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5)); }
  void test_case_3() { int Arg0 = 10; int Arg1 = 10; int Arg2 = 10; int Arg3 = 10; int Arg4 = 1; int Arr5[] = {10}; vector <int> Arg5(Arr5, Arr5 + (sizeof(Arr5) / sizeof(Arr5[0]))); int Arg6 = 0; verify_case(3, Arg6, getCount(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5)); }
  void test_case_4() { int Arg0 = 11; int Arg1 = 11; int Arg2 = 11; int Arg3 = 11; int Arg4 = 2; int Arr5[] = {10}; vector <int> Arg5(Arr5, Arr5 + (sizeof(Arr5) / sizeof(Arr5[0]))); int Arg6 = 140; verify_case(4, Arg6, getCount(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5)); }
  void test_case_5() { int Arg0 = 123; int Arg1 = 456; int Arg2 = 70; int Arg3 = 80; int Arg4 = 90; int Arr5[] = {30, 40, 20, 10, 50}; vector <int> Arg5(Arr5, Arr5 + (sizeof(Arr5) / sizeof(Arr5[0]))); int Arg6 = 6723; verify_case(5, Arg6, getCount(Arg0, Arg1, Arg2, Arg3, Arg4, Arg5)); }

  // END CUT HERE

};  

// BEGIN CUT HERE  
int main()  
{  
  FoxJumping ___test;  
  ___test.run_test(-1);  
  system("pause");  
}  
// END CUT HERE