ZOJ_4006 Travel along the Line(组合数学)

Travel along the Line

Time Limit: 1000 ms Memory Limit: 65536 KB

Problem Description

BaoBao is traveling along a line with infinite length.

At the beginning of his trip, he is standing at position 0. At the beginning of each second, if he is standing at position x, with $\frac{1}{4}$ probability he will move to position (x-1), with $\frac{1}{4}$ probability he will move to position (x-1), and with $\frac{1}{2}$ probability he will stay at position x. Positions can be positive, 0, or negative.

DreamGrid, BaoBao’s best friend, is waiting for him at position m. BaoBao would like to meet DreamGrid at position m after exactly n seconds. Please help BaoBao calculate the probability he can get to position m after exactly n seconds.

It’s easy to show that the answer can be represented as $\frac{P}{Q}$, where P and Q are coprime integers, and Q is not divisible by $10^9+7$ . Please print the value of $P{Q}^{-1}$ modulo $10^9+7$, where $Q^{-1}$ is the multiplicative inverse Q of modulo $10^9+7$.

Input

There are multiple test cases. The first line of the input contains an integer T (about 10), indicating the number of test cases. For each test case:

The first and only line contains two integers n and m($0\le n,|m|\le 10^5$). Their meanings are described above.

Output

For each test case output one integer, indicating the answer.

Sample Input

3
2 -2
0 0
0 1

Sample Output

562500004
1
0

题意

在位置x，下一秒有$\frac{1}{4}$的概率移动至x-1,有$\frac{1}{4}$的概率移动至x+1，有$\frac{1}{2}$的概率留在原地。初始位置在0，求n秒处于m的概率。

题解：

设n秒向$x-1$方向移动了$i$次，向$x+1$方向移动了$j$次，停留在原地$k$次($i\ge 0,j\ge 0,k\ge 0,i+j+k=n$)。要停留在位置m，则显然$i-j=m$。
则概率为$\frac{\sum C_{i+j}^n\ast C_{i+j}^j\ast 2^k}{4^n}$，暴力所有的i，求和即可。

#include<stdio.h>
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<ctype.h>
#include<cstring>
#include<map>
#include<vector>
#include<queue>
#define dbg(x) cout<<#x<<" = "<<x<<endl;r
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define eps 1e-6
 
using namespace std;
typedef long long LL;   
typedef pair<int, int> P;
const int maxn = 100200;
const int mod = 1000000007;
LL jie[maxn];
LL Pow(LL a, LL b);
LL C(LL n, LL m);

int main()
{
    int t, n, m, i, j, k;
    jie[0] = 1;
    for(i=1;i<=100004;i++)
        jie[i] = jie[i-1]*i%mod;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d %d", &n, &m);
        LL up = 0, dn = Pow(4, n);
        m = abs(m);     
        for(i=0;2*i+m<=n;i++)
            up = (up+(C(2*i+m, i)*C(n, n-2*i-m)%mod)*Pow(2, n-2*i-m)%mod)%mod;
        printf("%lld\n", up*Pow(dn, mod-2)%mod);
    }
    return 0;
}

LL C(LL n, LL m)
{
    LL ans = (jie[n]*Pow(jie[m], mod-2)%mod) * Pow(jie[n-m], mod-2)%mod;
    return ans;
}

LL Pow(LL a, LL b)
{
    LL n = 1;
    while(b)
    {
        if(b&1)n = n*a%mod;
        a = a*a%mod;
        b/=2;
    }
    return n;
}