51nod 1486 大大走格子

https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1486

容斥一下

把(h,w)看成黑格子
先按偏序对黑格子排序

然后对每个黑格子算出到不经过前面每个黑格子的方案数
最后的到(h,w)黑格子的方案数就是答案

因为对于每个方案数 都减去了前面不能走的方案
（另外，题目根本没说只能往右往下，还以为是插头什么的）

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ansn() printf("%d\n",ans)
#define lansn() printf("%lld\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp(aa,bb) make_pair(aa,bb)
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007 ;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
//const ll infl = 100000000000000000;//1e17
const int maxn=  2e5+20;
const int maxm = 3e2+20;
//muv[i]=(p-(p/i))*muv[p%i]%p;
int in(int &ret) {
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}


vector<pii>g;
ll f[maxn];
ll inv[maxn];
ll qpow(ll x,ll k) {
    ll res = 1;
    while(k) {
        if(k&1)res = res *x %mod;
        x = x*x%mod;
        k>>=1;
    }
    return res;
}
ll C(int n,int m) {
    return f[n]*inv[m]%mod*inv[n-m]%mod;
}
ll cal(int x,int y) {
    if(x<=0||y<=0)return 0;
    return C(x+y-2,y-1);
}
ll dp[maxn];
int main() {
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL

    int h,w,n;
    sddd(h,w,n);
    f[1] = 1;
    f[0] = 1;
    for(int i=2; i<maxn; ++i)f[i] = f[i-1]*i%mod;
    inv[maxn-1] = qpow(f[maxn-1],mod-2);
    for(int i=maxn-2; i>=0; --i)inv[i] = inv[i+1]*(i+1)%mod;
    r1(i,n){
        int a,b;
        sdd(a,b);
        g.pb(mp(a,b));
    }
    g.pb(mp(h,w));
    ++n;
    sort(all(g));
    for(int i=0;i<n;++i)
    {
        int x = g[i].X,y = g[i].Y;
        dp[i] = cal(x,y);
        ll q = 0;
        for(int j=0;j<i;++j)
        {
            q += dp[j]*cal(x-g[j].X+1,y-g[j].Y+1)%mod;
            q%=mod;
        }
        q = mod - q;
        q = (q+mod)%mod;
        dp[i] = (dp[i]+q)%mod;
    }
    ll ans = dp[n-1];
    lansn();
    return 0;
}