hdu 4925 Apple Tree--2014 Multi-University Training Contest 6
来源:互联网 发布:tcp ip协议 端口 编辑:程序博客网 时间:2024/05/01 09:05
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4925
Apple Tree
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 188 Accepted Submission(s): 129
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.
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
22 23 3
Sample Output
832
Source
2014 Multi-University Training Contest 6
Recommend
hujie | We have carefully selected several similar problems for you: 4929 4928 4926 4924 4923
签道题,没啥好说的,黑白染色的方法是最优的,特判1*1的情况
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<string>#include<vector>#include<algorithm>#include<queue>#include<stack>#include<set>#include<map>using namespace std;#define CLR(A) memset(A,0,sizeof(A))int A[110][110];int main(){ int T,m,n; cin>>T; while(T--){ cin>>n>>m; if(n==1 && m==1){ cout<<1<<endl; continue; } for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) A[i][j]=1; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++){ if(A[i][j]==1){ A[i-1][j]<<=1; A[i+1][j]<<=1; A[i][j-1]<<=1; A[i][j+1]<<=1; } } long long sum=0; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++){ if(A[i][j]!=1){ sum+=A[i][j]; } } cout<<sum<<endl; } return 0;}
0 0
- hdu 4925 Apple Tree--2014 Multi-University Training Contest 6
- hdu 4925 Apple Tree 2014 Multi-University Training Contest 6
- hdu 4925 Apple Tree(2014 Multi-University Training Contest 6)
- 2014 Multi-University Training Contest 6 Apple Tree(数学题)
- hdu 4927 Series 1--2014 Multi-University Training Contest 6
- 2017 Multi-University Training Contest 1003(hdu 6035) Colorful Tree
- 2014 Multi-University Training Contest 6小记
- hdu 4861 Couple doubi ---2014 Multi-University Training Contest 1
- hdu 4864 Task---2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1 - 1004 / hdu 4864 Task
- hdu 4902 Nice boat--2014 Multi-University Training Contest 4
- [HDU 4862][2014 Multi-University Training Contest 1]Jump
- hdu 4915 Parenthese sequence--2014 Multi-University Training Contest 5
- hdu 4911 Inversion--2014 Multi-University Training Contest 5
- hdu 4920 Matrix multiplication--2014 Multi-University Training Contest 5
- hdu 4937 Lucky Number 2014 Multi-University Training Contest 7
- hdu 4941 Magical Forest--2014 Multi-University Training Contest 7
- hdu 4941 Magical Forest 2014 Multi-University Training Contest 7
- Tyvj 1004 滑雪~
- 【Linux】GDB调试演示过程
- 函数模板
- Android系统编译时遇到的几个.mk的疑惑。
- LightOJ 1216 圆锥体积
- hdu 4925 Apple Tree--2014 Multi-University Training Contest 6
- Fermat’s Chirstmas Theorem
- java多线程的实现
- Eclipse启动Tomcat错误:Several ports (8080, 8009) required by Tomcat v6.0 Server at localhost are already
- Eclipse + CVS 之 如何将文件加入版本控制和脱离版本控制
- C#接口的作用
- LeetCode OJ算法题(五十二):Maximum Subarray
- 划分树
- 新浪微博接口