D. Red-Green Towers(Codeforces Round #273)
来源:互联网 发布:php文章发布系统报告 编辑:程序博客网 时间:2024/05/16 11:23
There are r red and g green blocks for construction of the red-green tower. Red-green tower can be built following next rules:
- Red-green tower is consisting of some number of levels;
- Let the red-green tower consist of n levels, then the first level of this tower should consist of n blocks, second level — of n - 1 blocks, the third one — of n - 2 blocks, and so on — the last level of such tower should consist of the one block. In other words, each successive level should contain one block less than the previous one;
- Each level of the red-green tower should contain blocks of the same color.
Let h be the maximum possible number of levels of red-green tower, that can be built out of r red and g green blocks meeting the rules above. The task is to determine how many different red-green towers having h levels can be built out of the available blocks.
Two red-green towers are considered different if there exists some level, that consists of red blocks in the one tower and consists of green blocks in the other tower.
You are to write a program that will find the number of different red-green towers of height h modulo 109 + 7.
The only line of input contains two integers r and g, separated by a single space — the number of available red and green blocks respectively (0 ≤ r, g ≤ 2·105, r + g ≥ 1).
Output the only integer — the number of different possible red-green towers of height h modulo 109 + 7.
4 6
2
9 7
6
1 1
2
The image in the problem statement shows all possible red-green towers for the first sample.
dp,我的代码是枚举红色球的层数,当第i层为红色是,i层上面有[0,r]个 红色的,可推出dp[i+j]=dp[i+j]+dp[j],最后
再统计红色的个数就行了,红色最少为max(h*(h+1)/2-g,0)。
代码:
#include <iostream>#include <cstdio>#include <cmath>#include <algorithm>using namespace std;const int mod=1000000000+7;long long dp[500000];int main(){ int r,g; scanf("%d%d",&r,&g); int temp=r+g; int h=sqrt(temp*2); while(h*(h+1)/2>temp) h--; dp[0]=1; for(int i=1;i<=h;i++) { for(int j=r;j>=0;j--) { dp[i+j]=(dp[i+j]+dp[j])%mod; } } long long ans=0; for(int i=max(h*(h+1)/2-g,0);i<=r;i++) ans=(ans+dp[i])%mod; printf("%I64d\n",ans); return 0;}
- D. Red-Green Towers(Codeforces Round #273)
- Codeforces Round #273 (Div. 2) D. Red-Green Towers
- Codeforces Round #273 (Div. 2) D. Red-Green Towers
- Codeforces Round #273 (Div. 2)D. Red-Green Towers(背包)
- codeforces D - Red-Green Towers
- 【CODEFORCES】 D. Red-Green Towers
- Codeforces 478D Red-Green Towers dp
- codeforces 478D Red-Green Towers dp
- codeforces 478D Red-Green Towers (dp)
- Codeforces 478D Red-Green Towers (DP)
- Codeforces 478D Red-Green Towers (DP)
- CodeForces 478D-Red-Green Towers
- cf#273-D. Red-Green Towers-dp
- codeforces 478D D. Red-Green Towers(dp)
- D - Red-Green Towers dp
- codeforces 478D Red-Green Towers(dp)
- Codeforces 478D Red-Green Towers 构造+DP
- 【Codeforces Round 273 (Div 2)D】【DP 滚动数组】 Red-Green Towers 两种颜色积木拼搭最高锯齿楼每层颜色相同的总方案数
- 刚来
- nefu117 素数个数的位数,素数定理
- input子系统八之触摸屏驱动实例2(源码分析)
- HiveSQL工程化调用方案
- 关于能否使用2个zookeeper管理3节点storm集群的测试
- D. Red-Green Towers(Codeforces Round #273)
- Notification Center
- iOS- 利用AFNetworking(AFN) 1.1.0- 实现文件断点下载
- 为大家介绍一款Flash AS3 UI编辑器 ---- PSD2SWF
- Mysql查看sql是否走事务
- cmd启动Oracle服务和监听服务
- java.lang.NoClassDefFoundError: Could not initialize class的场景
- 黑马程序员--高效文件流读写
- SOCKS5中的UDP穿透