CF 271D Flowers

最新推荐文章于 2024-04-29 17:05:25 发布

Liao_Jingyi

最新推荐文章于 2024-04-29 17:05:25 发布

阅读量428

点赞数

分类专栏：动态规划数学

本文链接：https://blog.csdn.net/Liao_Jingyi/article/details/39852779

版权

动态规划同时被 2 个专栏收录

39 篇文章 0 订阅

订阅专栏

数学

22 篇文章 0 订阅

订阅专栏

We saw the little game Marmot made for Mole's lunch. Now it's Marmot's dinner time and, as we all know, Marmot eats flowers. At every dinner he eats some red and white flowers. Therefore a dinner can be represented as a sequence of several flowers, some of them white and some of them red.

But, for a dinner to be tasty, there is a rule: Marmot wants to eat white flowers only in groups of size k.

Now Marmot wonders in how many ways he can eat between a and b flowers. As the number of ways could be very large, print it modulo 1000000007 (10⁹ + 7).

Input

Input contains several test cases.

The first line contains two integers t and k (1 ≤ t, k ≤ 10⁵), where t represents the number of test cases.

The next t lines contain two integers a_i and b_i (1 ≤ a_i ≤ b_i ≤ 10⁵), describing the i-th test.

Output

Print t lines to the standard output. The i-th line should contain the number of ways in which Marmot can eat between a_i and b_i flowers at dinner modulo 1000000007 (10⁹ + 7).

Sample test(s)

Input

Output

6
5
5

Note

For K = 2 and length 1 Marmot can eat (R).
For K = 2 and length 2 Marmot can eat (RR) and (WW).
For K = 2 and length 3 Marmot can eat (RRR), (RWW) and (WWR).
For K = 2 and length 4 Marmot can eat, for example, (WWWW) or (RWWR), but for example he can't eat (WWWR).

解析

先说下题意：字符串中的W个数必须是K的整数倍（当然0也是K的倍数）这样Marmot才能把这一串花吃完。然后给定字符串的总长度，组合出所有的花的排列方式。

这个题其实又是一个找规律的题，打个表就可以发现显而易见的规律：dp[ i ] = dp[ i-1 ]+dp[ i-K ] ;

附打表代码：

#include<cstdio>

using namespace std;

int K;

int jie(int a)
{
	int ans=1;
	for(int i=2;i<=a;i++) ans*=i;
	return ans;
}

int cal(int n,int m)
{
	return jie(m+n)/jie(n)/jie(m);
}

int work(int x)
{
	int ans=0;
	for(int i=0;i<=x;i=i+K)//i-->white
		ans+=cal(i/K,x-i);
	return ans;
}

int pre[100100];

int main()
{
	freopen("Make.out","r",stdin);
	for(int i=1;i<=5;i++)
	{
		K=i;
		printf("\nK:%d\n",K);
		for(int i=1;i<=10;i++)
			printf("%d ",work(i));
	}
	while(1);
}

然后写dp的时候记得预处理个前缀和，因为涉及到多次询问，如果每次都相加会超时。

DP代码：

#include<cstdio>

using namespace std;

#define MOD 1000000007
typedef long long LL;

LL dp[100100];
LL pre[100100];
int main()
{
	int T,K;
	scanf("%d%d",&T,&K);
	for(int i=0;i<K;i++) dp[i]=1;
	for(int i=K;i<=100000;i++) dp[i]=(dp[i-1]+dp[i-K])%MOD;
	pre[1]=dp[1]; for(int i=2;i<=100000;i++) pre[i]=(pre[i-1]+dp[i])%MOD;

	for(int i=1;i<=T;i++)
	{
		int a,b;
		scanf("%d%d",&a,&b);
		if(pre[b]>=pre[a-1]) printf("%I64d\n",(pre[b]-pre[a-1])%MOD);
		else printf("%I64d\n",pre[b]-pre[a-1]+MOD);

	}

	//while(1);
	return 0;
}