题意:在一个数轴上,一开始有n个位置上有烟花,每个位置上的烟花在下一秒会分裂到两边的位置,然后它们可以继续分裂,求t秒后在w位置烟花量
思路:我们先看一个烟花是如何分裂的
0 0 0 0 0 0 1 0 0 0 0 0 0
0 0 0 0 0 1 0 1 0 0 0 0 0
0 0 0 0 1 0 2 0 1 0 0 0 0
0 0 0 1 0 3 0 3 0 1 0 0 0
0 0 1 0 4 0 6 0 4 0 1 0 0
1 0 6 0 15 0 20 0 15 0 6 0 1
可以发现符合组合数的规律,当t为奇数时,离中心位置距离为奇数时才有烟花,当t为偶数时,离中心位置距离为偶数时才有烟花,因为数据范围为10^5,所以利用逆元来求组合数
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 100005;
ll f[maxn];
ll v[maxn];
ll q_pow(int a,int b,int m){
ll r = 1;
ll base = a % m;
while(b){
if(b & 1){
r = (r * base) % m;
}
base = (base * base) % m;
b >>= 1;
}
return r;
}
void init(){
f[0] = 1;
for(int i = 1; i < maxn; i++){
f[i] = (ll)(f[i - 1] * i) % mod;
}
for(int i = maxn - 1; i >= 0; i--){
v[i] = q_pow(f[i],mod - 2,mod) % mod;
}
}
ll C(int n,int m){
if(n == m || m == 0){
return 1;
}
return (ll)(f[n] * v[m]) % mod * v[n - m] % mod;
}
int main(void){
int n,t,w;
init();
while(scanf("%d%d%d",&n,&t,&w) != EOF){
ll ans = 0;
while(n--){
int pos,num;
scanf("%d%d",&pos,&num);
int diff = abs(pos - w);
if(diff <= t){
if(t % 2 && diff % 2){
ans += C(t,(t + 1) / 2 + diff / 2) * num % mod;
}
else if(t % 2 == 0 && diff % 2 == 0){
ans += C(t,t / 2 + diff / 2) * num % mod;
}
ans %= mod;
}
}
printf("%lld\n",ans);
}
return 0;
}