2014 Multi-University Training Contest 6 Apple Tree(数学题)
2014-08-07 20:29
537 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4925
Total Submission(s): 176 Accepted Submission(s): 120
Problem Description
I’ve bought an orchard and decide to plant some apple trees on it. The orchard seems like an N * M two-dimensional map. In each grid, I can either plant an apple tree to get one apple or fertilize the soil to speed up its neighbors’
production. When a grid is fertilized, the grid itself doesn’t produce apples but the number of apples of its four neighbor trees will double (if it exists). For example, an apple tree locates on (x, y), and (x - 1, y), (x, y - 1) are fertilized while (x +
1, y), (x, y + 1) are not, then I can get four apples from (x, y). Now, I am wondering how many apples I can get at most in the whole orchard?
Input
The input contains multiple test cases. The number of test cases T (T<=100) occurs in the first line of input.
For each test case, two integers N, M (1<=N, M<=100) are given in a line, which denote the size of the map.
Output
For each test case, you should output the maximum number of apples I can obtain.
Sample Input
Sample Output
Source
2014 Multi-University Training Contest 6
代码如下:
Apple Tree
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 176 Accepted Submission(s): 120
Problem Description
I’ve bought an orchard and decide to plant some apple trees on it. The orchard seems like an N * M two-dimensional map. In each grid, I can either plant an apple tree to get one apple or fertilize the soil to speed up its neighbors’
production. When a grid is fertilized, the grid itself doesn’t produce apples but the number of apples of its four neighbor trees will double (if it exists). For example, an apple tree locates on (x, y), and (x - 1, y), (x, y - 1) are fertilized while (x +
1, y), (x, y + 1) are not, then I can get four apples from (x, y). Now, I am wondering how many apples I can get at most in the whole orchard?
Input
The input contains multiple test cases. The number of test cases T (T<=100) occurs in the first line of input.
For each test case, two integers N, M (1<=N, M<=100) are given in a line, which denote the size of the map.
Output
For each test case, you should output the maximum number of apples I can obtain.
Sample Input
2 2 2 3 3
Sample Output
8 32
Source
2014 Multi-University Training Contest 6
代码如下:
#include <cstdio> #include <cstring> int mp[217][217]; int main() { int t; int n,i,a,ans,k,er,m,j; while(scanf("%d",&t)!=EOF) { while(t--) { scanf("%d%d",&n,&m); memset(mp,0,sizeof(mp)); if(n == 1 && m == 1) { printf("1\n"); continue; } for(i = 1; i <= n; i++) { for(j = 1; j <= m; j++) { if((i+j)&1) mp[i][j]=1; } } ans=0; for(i = 1; i <= n; i++) { for(j = 1; j <= m; j++) { if(mp[i][j] == 0) { if(mp[i-1][j]) { mp[i-1][j]*=2; } if(mp[i][j-1]) { mp[i][j-1]*=2; } if(mp[i][j+1]) { mp[i][j+1]*=2; } if(mp[i+1][j]) { mp[i+1][j]*=2; } } } } for(i = 1; i <= n; i++) { for(j = 1; j <= m; j++) { if(mp[i][j]) ans+=mp[i][j]; } } printf("%d\n",ans); } } return 0; }
相关文章推荐
- hdu 4925 Apple Tree 2014 Multi-University Training Contest 6
- hdu 4925 Apple Tree(2014 Multi-University Training Contest 6)
- HDU 4952 Number Transformation(数学)——2014 Multi-University Training Contest 8
- hdu 4968 Just a Joke 数学(积分) 2014 Multi-University Training Contest 9-1010
- hdu 4925 Apple Tree--2014 Multi-University Training Contest 6
- hdu 4864 Task 2014 Multi-University Training Contest 1
- hdu 5810 Balls and Boxes(2016 Multi-University Training Contest 7——数学题)
- 【hdu 4970】 Killing Monsters 【2014 Multi-University Training Contest 9 】
- HDU 4864 Task(2014 Multi-University Training Contest 1) 贪心算法
- 2014 Multi-University Training Contest 2 1011 ZCC Loves Codefires 解题报告
- 2014 Multi-University Training Contest 1 部分题目解题报告
- hdu 4902 Nice boat--2014 Multi-University Training Contest 4
- 2014 Multi-University Training Contest 5 1010 Matrix multiplication 涨姿势系列
- 2014-multi-university-training-contest-5-Inversion (离散化加线段树)
- [贪心+DFS序列维护树上前缀和]2014 Multi-University Training Contest 5 - 1002 Paths on the tree
- HDU 4940 Destroy Transportation system(2014 Multi-University Training Contest 7)
- hdu 4939 Stupid Tower Defens2014 Multi-University Training Contest 7
- hdu 4941 Magical Forest 2014 Multi-University Training Contest 7
- 2014 Multi-University Training Contest 8 1007 hdu 4951 Multiplication table
- 2014 Multi-University Training Contest 8 B Area of Mushroom解题报告