いろはちゃんとマス目 / Iroha and a Grid （组合数学）

题目链接：http://abc042.contest.atcoder.jp/tasks/arc058_b

Time limit : 2sec / Memory limit : 256MB

Score : 400 points

Problem Statement

We have a large square grid with H rows and W columns. Iroha is now standing in the top-left cell. She will repeat going right or down to the adjacent cell, until she reaches the bottom-right cell.

However, she cannot enter the cells in the intersection of the bottom A rows and the leftmost B columns. (That is, there are A×B forbidden cells.) There is no restriction on entering the other cells.

Find the number of ways she can travel to the bottom-right cell.

Since this number can be extremely large, print the number modulo 109+7.

Constraints

• 1≦H,W≦100,000
• 1≦A<H
• 1≦B<W

---

Input

The input is given from Standard Input in the following format:

H W A B

Output

Print the number of ways she can travel to the bottom-right cell, modulo 109+7.

---

Sample Input 1

Copy

2 3 1 1

Sample Output 1

Copy

2

We have a 2×3 grid, but entering the bottom-left cell is forbidden. The number of ways to travel is two: "Right, Right, Down" and "Right, Down, Right".

---

Sample Input 2

Copy

10 7 3 4

Sample Output 2

Copy

3570

There are 12 forbidden cells.

---

Sample Input 3

Copy

100000 100000 99999 99999

Sample Output 3

Copy

1

---

Sample Input 4

Copy

100000 100000 44444 55555

Sample Output 4

Copy

738162020

题意:n*m矩阵 左下方A*B为禁区,每次可以走下或者左
n,m<=1e5,问从左上到右下不经过禁区时的方案数?

题解：就是找路吧 以为可以动态规划但是数据太大 数组开不了 看了下大佬的 原来可以用组合数

若无禁区,则方案数为C(n+m-2,n-1)
有禁区时 每个合法路径都会到达(n-A,i)i>B 即n-A行的某一列上.
则每个合法路径都可以分成两段,(1,1)->(n-A,i),(n-A,i)->(n,m) (i>B)
注意枚举到(n-A,i)不能向右移动,否则重复枚举.所以路径变为三段.

 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #include <cstdio>
 #include <vector>
 #include <cstdlib>
 #include <iomanip>
 #include <cmath>
 #include <ctime>
 #include <map>
 #include <set>
 #include <queue>
 using namespace std;
 #define lowbit(x) (x&(-x))
 #define max(x,y) (x>y?x:y)
 #define min(x,y) (x<y?x:y)
 #define MAX 100000000000000000
 #define MOD 1000000007
 #define pi acos(-1.0)
 #define ei exp(1)
 #define PI 3.141592653589793238462
 #define INF 0x3f3f3f3f3f
 #define mem(a) (memset(a,0,sizeof(a)))
 typedef long long ll;
 ll gcd(ll a,ll b){
     return b?gcd(b,a%b):a;
 }
 bool cmp(int x,int y)
 {
     return x>y;
 }
 const int N=2e5+;
 const ll mod=1e9+;
 ll f[N],n,m,A,B;
 ll powmod(ll x,ll n)
 {
     ll s=;
     while(n){
         if(n&)
             s=(s*x)%mod;
         x=(x*x)%mod;
         n>>=;
     }
     return s;
 }
 ll C(ll n,ll m)
 {
     ll a=f[n];
     ll b=(f[m]*f[n-m])%mod;
     return (a*powmod(b,mod-))%mod;
 }
 int main()
 {
     f[]=;
     for(ll i=;i<N;i++)
         f[i]=(f[i-]*i)%mod;
     while(cin>>n>>m>>A>>B){
         ll res=;
         for(ll i=B+;i<=m;i++){
             ll tmp=(C(i-+n-A-,n-A-)*C(m-i+A-,m-i))%mod;
             res=(res+tmp)%mod;
         }
         cout<<res<<endl;
     }
     return ;
 }