codeforces 559C Gerald and Giant Chess
来源:互联网 发布:淘宝男士机械手表 编辑:程序博客网 时间:2024/06/04 21:12
Giant chess is quite common in Geraldion. We will not delve into the rules of the game, we'll just say that the game takes place on anh × w field, and it is painted in two colors, but not like in chess. Almost all cells of the field are white and only some of them are black. Currently Gerald is finishing a game of giant chess against his friend Pollard. Gerald has almost won, and the only thing he needs to win is to bring the pawn from the upper left corner of the board, where it is now standing, to the lower right corner. Gerald is so confident of victory that he became interested, in how many ways can he win?
The pawn, which Gerald has got left can go in two ways: one cell down or one cell to the right. In addition, it can not go to the black cells, otherwise the Gerald still loses. There are no other pawns or pieces left on the field, so that, according to the rules of giant chess Gerald moves his pawn until the game is over, and Pollard is just watching this process.
The first line of the input contains three integers: h, w, n — the sides of the board and the number of black cells (1 ≤ h, w ≤ 105, 1 ≤ n ≤ 2000).
Next n lines contain the description of black cells. Thei-th of these lines contains numbersri, ci (1 ≤ ri ≤ h, 1 ≤ ci ≤ w) — the number of the row and column of the i-th cell.
It is guaranteed that the upper left and lower right cell are white and all cells in the description are distinct.
Print a single line — the remainder of the number of ways to move Gerald's pawn from the upper left to the lower right corner modulo109 + 7.
3 4 22 22 3
2
100 100 315 1616 1599 88
545732279~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
DP+组合数~
同样的题再更一遍……详见51nod 大大走格子2333
啊♂,水博的快感~
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;#define ll long longconst int mod=1e9+7;int n,m,tot,f[2010],sheng[200005],jiang[200005],k;struct node{int x,y;bool operator < (const node&u){return x==u.x ? y<u.y:x<u.x;}}a[2010];int c(int n,int m){return n>=m ? (ll)sheng[n]*jiang[m]%mod*jiang[n-m]%mod:0;}int mi(int u,int v){int now=1;for(;v;v>>=1,u=(ll)u*u%mod) if(v&1) now=(ll)now*u%mod;return now;}void jian(int &a,int b){a=a<b ? a-b+mod:a-b;}int main(){scanf("%d%d%d",&n,&m,&tot);sheng[0]=jiang[0]=1;k=n+m;for(int i=1;i<=k;i++) sheng[i]=(ll)sheng[i-1]*i%mod;jiang[k]=mi(sheng[k],mod-2);for(int i=k-1;i;i--) jiang[i]=(ll)jiang[i+1]*(i+1)%mod;for(int i=1;i<=tot;i++) scanf("%d%d",&a[i].x,&a[i].y),a[i].x--,a[i].y--;a[++tot]=(node){n-1,m-1};sort(a+1,a+tot);for(int i=1;i<=tot;i++){f[i]=c(a[i].x+a[i].y,a[i].x);for(int j=1;j<i;j++) if(a[i].y>=a[j].y) f[i]=(f[i]-(ll)f[j]*c(a[i].y-a[j].y+a[i].x-a[j].x,a[i].y-a[j].y)%mod)%mod;f[i]=(f[i]+mod)%mod;}printf("%d\n",f[tot]);return 0;}
- codeforces 559C Gerald and Giant Chess
- codeforces(559C)--C. Gerald and Giant Chess(组合数学)
- codeforces 559C Gerald and Giant Chess(dp+组合数学)
- codeforces 559C Gerald and Giant Chess(组合数学)
- Codeforces 559C Gerald and Giant Chess 组合数学 DP
- Gerald and Giant Chess (CodeForces
- codeforce 559 C Gerald and Giant Chess
- Codeforces Round #313 (Div. 1) C. Gerald and Giant Chess
- Codeforces Round #313 (Div. 1) C. Gerald and Giant Chess
- 【Codeforces Round #313 (Div. 1) C】 CodeForces 559C Gerald and Giant Chess
- Codeforces 560E Gerald and Giant Chess
- Codeforces 664A Gerald and Giant Chess
- Codeforces 559C Gerald and Giant Chess(DP+乘法逆元求大组合数)
- Codeforces 559C Gerald and Giant Chess (dp+组合数+逆元)
- 【CodeForces】559C - Gerald and Giant Chess(dp & 逆元 & 容斥原理)
- 【Codeforces Round #313 Div. 1】 559C Gerald and Giant Chess
- codeforces 559C|51nod1486 Gerald and Giant Chess(组合数学+逆元)
- CF 559C. Gerald and Giant Chess 组合数学+DP
- LeetCode 71. Simplify Path
- 一个整型数组里除了两个数字之外,其他的数字都出现了两次
- STL vector学习笔记
- Android Studio下 NDK配置与Jni开发流程
- C-C++语言结构体中定义另一个结构体指针的经验
- codeforces 559C Gerald and Giant Chess
- PHP 面向对象
- 输一个递增排序的数组和一个数字 s,在数组中查找两个数使得它们的 和正好是 s
- Bootstrap:表单和图片
- 28303 篇 arXiv 论文看深度学习 6 大趋势
- 虚拟机的linux和Windows建立共享文件
- 动态加载类并实例化对象
- C表白程序
- 类实现一维数组正负数交换