【组合数】省赛CD题 SDUT_3895_fireworks SDUT_3896_HEX

最新推荐文章于 2019-04-03 20:02:21 发布

yiluuuuu

最新推荐文章于 2019-04-03 20:02:21 发布

阅读量442

点赞数

分类专栏：数学组合数学

本文链接：https://blog.csdn.net/yiluuuuu/article/details/71512122

版权

数学同时被 2 个专栏收录

8 篇文章 0 订阅

订阅专栏

组合数学

1 篇文章 0 订阅

订阅专栏

fireworks

Time Limit: 1000MS Memory Limit: 65536KB

Submit Statistic

Problem Description

Hmz likes to play fireworks, especially when they are put regularly.
Now he puts some fireworks in a line. This time he put a trigger on each firework. With that trigger, each firework will explode and split into two parts per second, which means if a firework is currently in position x, then in next second one part will be in position x−1 and one in x+1. They can continue spliting without limits, as Hmz likes.
Now there are n fireworks on the number axis. Hmz wants to know after T seconds, how many fireworks are there in position w?

Input

Input contains multiple test cases.
For each test case:

The first line contains 3 integers n,T,w(n,T,|w|≤10^5)
In next n lines, each line contains two integers xi and ci, indicating there are ci fireworks in position xi at the beginning(ci,|xi|≤10^5).

Output

For each test case, you should output the answer MOD 1000000007.

Example Input

Example Output

2
3

Hint

Author

“浪潮杯”山东省第八届ACM大学生程序设计竞赛（感谢青岛科技大学）

/*
SDUT 3895
题意：
位于x的烟花炸开到x-1,x+1
有n个位置的烟花，问t秒后w位置的烟花数
比如index(位置)=3,c(数量)=2的烟花
会炸到index=2 c=2 和index=4 c=2

思路：
对于x位置的烟花，t秒后烟花的位置左边界为x-t,右边界为x+t
而且每隔2个单位都有烟花
就是x-t,x-t+2,x-t+4...x+t-2,x+t
别的位置肯定没有烟花
假设最开始的烟花数量为1，最后*c就好
还可以看出t秒后这些位置的烟花数量分别为
C(t,0) C(t,1) C(t,2)...
所以对于t秒后位于x位置c数量的烟花爆炸后,w位置有的烟花数是
c*C(t,k) k为第几个有烟花的位置
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL p=1e9+7;
LL f[100010];
LL quickpow(LL x,LL n)
{
    LL ans=1;
    while(n)
    {
        if(n&1)
            ans=ans*x%p;
        x=x*x%p;
        n>>=1;
    }
    return ans;
}
void Init()
{
    f[0]=1;
    for(int i=1; i<=1e5; i++)
        f[i]=f[i-1]*i%p;
}
LL C(LL n,LL m)
{
    return f[n]*(quickpow(f[n-m],p-2)*quickpow(f[m],p-2)%p)%p;
}
LL Lucas(LL n,LL m)
{
    if(m==0)
        return 1;
    return C(n%p,m%p)*Lucas(n/p,m/p)%p;
}
int main()
{
    Init();
    LL n,t,w,x,c;
    while(~scanf("%lld%lld%lld",&n,&t,&w))
    {
        LL ans=0;
        while(n--)
        {
            scanf("%lld%lld",&x,&c);
            LL l=x-t;
            LL r=x+t;
            LL k=(w-l)/2;
            if((w-l)%2==1||w<l||w>r)
                continue;
            ans=(ans%p+c*Lucas(t,k)%p)%p;
        }
        printf("%lld\n",ans);
    }
    return 0;
}

HEX

Time Limit: 4000MS Memory Limit: 131072KB

Submit Statistic

Problem Description

On a plain of hexagonal grid, we define a step as one move from the current grid to the lower/lower-left/lower-right grid. For example, we can move from (1,1) to (2,1), (2,2) or (3,2).

In the following graph we give a demonstrate of how this coordinate system works.

Your task is to calculate how many possible ways can you get to grid(A,B) from gird(1,1), where A and B represent the grid is on the B-th position of the A-th line.