牛客网暑期ACM多校训练营（第二场）A .run

2024-06-15 04:37:09

链接：https://www.nowcoder.com/acm/contest/140/A
来源：牛客网

题目描述

White Cloud is exercising in the playground.
White Cloud can walk 1 meters or run k meters per second.
Since White Cloud is tired,it can't run for two or more continuous seconds.
White Cloud will move L to R meters. It wants to know how many different ways there are to achieve its goal.
Two ways are different if and only if they move different meters or spend different seconds or in one second, one of them walks and the other runs.

输入描述:

The first line of input contains 2 integers Q and k.Q is the number of queries.(Q<=100000,2<=k<=100000)
For the next Q lines,each line contains two integers L and R.(1<=L<=R<=100000)

输出描述:

For each query,print a line which contains an integer,denoting the answer of the query modulo 1000000007.

示例1

输入

复制

输出

复制

2
7
11

思路：

1. dp[i][0]表示到达走着到达i dp[i][1]表示跑着到达i

ACcode:

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>using namespace std;const int maxn = 1e5+5;
const int mod = 1000000007;int dp[maxn][2];int main(){int K,Q;while(cin>>Q>>K){memset(dp,0,sizeof(dp));for (int i = 1;i<maxn;i++){if ( i<K ) {dp[i][0] = dp[i-1][0] + 1;} else {dp[i][0] = (dp[i-1][0] + dp[i-1][1] + 1) % mod;dp[i][1] = (dp[i-K][0] + 1) % mod;}}int l,r;while(Q--){scanf("%d %d",&l,&r);printf("%d\n",((dp[r][0] + dp[r][1]) % mod - (dp[l-1][0] + dp[l-1][1]) % mod + mod) % mod);}}return 0;
}

牛客网暑期ACM多校训练营（第二场）A .run相关推荐

牛客网暑期ACM多校训练营(第二场)：J. farm（暴力）
链接:https://www.nowcoder.com/acm/contest/140/J 来源:牛客网题目描述 White Rabbit has a rectangular farmland of ...
2018牛客网暑期ACM多校训练营第二场 D - money（贪心）
题目链接 https://www.nowcoder.com/acm/contest/140#question [题目描述] White Cloud is exercising in the playg ...
牛客网暑期ACM多校训练营（第十场）F.Rikka with Line Graph
牛客网暑期ACM多校训练营(第十场)F.Rikka with Line Graph 做法:\(G'\) 中的对应原图两条边(a,b) (c,d)的最短路为: \[ w[a][b] + w[c][d] ...
牛客网暑期ACM多校训练营（第九场）
牛客网暑期ACM多校训练营(第九场) A. Circulant Matrix 做法:看到下标 \(xor\) 这种情况就想 \(FWT\),可是半天没思路,于是放弃了..其实这个 \(n\) 疯狂暗示 ...
牛客网暑期ACM多校训练营（第五场）
牛客网暑期ACM多校训练营(第五场) A. gpa 二分答案,然后就转化为是否满足 \(\frac {\sum s[i]c[i]}{\sum s[i]} ≥ D\), \(\sum s[i]c[i] ...
牛客网暑期ACM多校训练营（第三场）
牛客网暑期ACM多校训练营(第三场) A. PACM Team 01背包,输出方案,用bool存每种状态下用的哪一个物品,卡内存.官方题解上,说用char或者short就行了.还有一种做法是把用的物品 ...
牛客网暑期ACM多校训练营（第一场）
牛客网暑期ACM多校训练营(第一场) A. Monotonic Matrix 考虑0和1的分界线,1和2的分界线,发现问题可以转化为两条不互相穿过的路径的方案数(可重叠),题解的做法就是把一条路径斜着 ...
牛客网暑期ACM多校训练营（第十场）D Rikka with Prefix Sum
链接:https://www.nowcoder.com/acm/contest/148/D 来源:牛客网题目描述 Prefix Sum is a useful trick in data struc ...
牛客网暑期ACM多校训练营（第三场）A.PACM Team(多重01背包)
链接:https://www.nowcoder.com/acm/contest/141/A 来源:牛客网题目描述 Eddy was a contestant participating in ACM ...
2018牛客网暑期ACM多校训练营（第十场）A Rikka with Lowbit (树状数组）
链接:https://ac.nowcoder.com/acm/contest/148/A 来源:牛客网 Rikka with Lowbit 时间限制:C/C++ 5秒,其他语言10秒空间限制:C/C ...

最新文章

热门文章