uva 12627 Erratic Expansion

原题：
Piotr found a magical box in heaven. Its magic power is that if you place any red balloon inside it
then, after one hour, it will multiply to form 3 red and 1 blue colored balloons. Then in the next hour,
each of the red balloons will multiply in the same fashion, but the blue one will multiply to form 4 blue
balloons. This trend will continue indefinitely. The arrangements of the balloons after the 0-th, 1-st, 2-nd and 3-rd hour are depicted in the following diagram.

As you can see, a red balloon in the cell (i,j) (that is i-th row and j-th column) will multiply to
produce 3 red balloons in the cells (i ∗ 2 − 1,j ∗ 2 − 1), (i ∗ 2 − 1,j ∗ 2), (i ∗ 2,j ∗ 2 − 1) and a blue
balloon in the cell (i∗2,j ∗2). Whereas, a blue balloon in the cell (i,j) will multiply to produce 4 blue
balloons in the cells (i∗2−1,j ∗2−1), (i∗2−1,j ∗2), (i∗2,j ∗2−1) and (i∗2,j ∗2). The grid size
doubles (in both the direction) after every hour in order to accommodate the extra balloons.
In this problem, Piotr is only interested in the count of the red balloons; more specifically, he would
like to know the total number of red balloons in all the rows from A to B after K-th hour.
Input
The first line of input is an integer T (T < 1000) that indicates the number of test cases. Each case
contains 3 integers K, A and B. The meanings of these variables are mentioned above. K will be in
the range [0,30] and 1 ≤ A ≤ B ≤ 2 K .
Output
For each case, output the case number followed by the total number of red balloons in rows [A,B] after
K-th hour.
Sample Input
3
0 1 1
3 1 8
3 3 7
Sample Output
Case 1: 1
Case 2: 27
Case 3: 14

中文：
给你一个二维网格，一开始有一个红气球，一个红球没隔一个小时可以分裂成三个红气球和一个蓝气球，蓝气球在右下角。
问你最后在k个小时以后，第a行到b行之间有多少个红气球。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll K,A,B;
ll power3[31],power2[31];ll dfs(ll i,ll j)//i小时  j行
{if(j<=0)return 0;if(i==0)return 1;if(j<=power2[i-1])return dfs(i-1,j)*2;elsereturn power3[i-1]*2+dfs(i-1,j-power2[i-1]);
}int main()
{ios::sync_with_stdio(false);power2[0]=power3[0]=1;for(int i=1;i<=30;i++){power3[i]=power3[i-1]*3;power2[i]=power2[i-1]*2;}int t;cin>>t;int k=1;while(t--){cin>>K>>A>>B;cout<<"Case "<<k++<<": "<<dfs(K,B)-dfs(K,A-1)<<endl;}return 0;
}

解答：

紫书上面的例题

规律很好找，设第n个图的样式为f(n)，那么如图，X代表蓝气球

由于n值可以取到30，所以没有办法打表，只能一个一个的算。

设dfs(i,j)为第i个小时的以后，前j行的红气球数。

分成两种情况，当j大于2n−12n−12^{n-1}时，红气球的个数可以递推给3n−1×2+dfs(i−1,j−2n−1)3n−1×2+dfs(i−1,j−2n−1)3^{n-1}×2+dfs(i-1,j-2^{n-1})

其中3n−13n−13^{n-1}是f(n-1)的图样式时红气球的个数，很好理解。

当j小于2n−12n−12^{n-1}时，红气球的个数可以递推为2×dfs(i−1,j)2×dfs(i−1,j)2×dfs(i-1,j)

uva 12627 Erratic Expansion相关推荐

Uva 12627 Erratic Expansion（不稳定膨胀）
题目链接 : Erratic Expansion 大致题意: 开始时有一个红气球,每过一段时间,气球会膨胀, 一个红气球膨胀成三个红气球,一个蓝气球膨胀成四个蓝气球(如图) 题目输入正整数n表示n组数 ...
UVa 12627 Erratic Expansion - 分治
因为不好复制题目,就出给出链接吧: Vjudge传送门[here] UVa传送门[here] 请仔细看原题上的那幅图,你会发现,在时间t(t > 0),当前的气球构成的一幅图,它是由三个时间为( ...
UVa 12627 - Erratic Expansion
链接: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem& ...
uva 12627——Erratic Expansion
题意:一开始有1个红气球,每小时一个红气球都会变成3个红气球和1个蓝气球,1个蓝气球会变成4个蓝气球,问k个小时后a行到b行的红气球的数量. 思路:递推.a为偶数时,计算a+1到b以及a本行的红气球数 ...
Uva 12627 Erratic Expansion
这道题大体意思是利用一种递归规则生成不同的气球,问在某两行之间有多少个红气球. 我拿到这个题,一开始想的是递归求解,但在如何递归求解的思路上我的方法是错误的.在研读了例题上给出的提示后豁然开朗(顺便吐 ...
UVA 12627 Erratic Expansion
题目大致意思为告诉你一个红球为0时状态,已知一个红球每过一个时间会变为文档所示图中的3红1蓝,而蓝球每过一个时间则会变为4个蓝球.问在某一时刻,h1与h2之间的红球有几个. RT,这一题刚看到的时候 ...
UVA - 12627 Erratic Expansion : 递归
题目点此跳转思路题目意思是(书上原话)一开始有一个红气球.每小时后,一个红气球会变成3个红气球和一个蓝气球,一个蓝气球会变成4个蓝气球,如图所示分别是经过0, 1, 2, 3小时后的情况.经过k ...
Uva - 12627 - Erratic Expansion
找到递推公式,题目就引刃而解了.数学公式博文没办法写,就写在了word上,切过来了: 用 f 或者 g 都能求出,我两个方法都试了,结果用 g 要比 f 快了近一倍,原本以为 f 会快些,可能是因为往 ...
UVA - 12627 - Erratic Expansion（找规律递归）
递归找规律即可,用前b行减去前a-1行的红气球个数求解,细节见代码 #include<cstdio> #include<cstring> #include<cstdlib ...

uva 12627 Erratic Expansion

uva 12627 Erratic Expansion相关推荐

最新文章

热门文章