Apple Tree
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 198 Accepted Submission(s): 136
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
2 2 2 3 3
Sample Output
8 32
应该算是构造题吧. 如果坐标(x+y)&1 ==1 的点施肥, 也就是没有相邻的树,也没相邻的施肥点,都是间隔开的.
还有就是要注意下
输入 n=1 m=1 时, 要输出1 才行.
#include <stdio.h>
#include <algorithm>
#include <map>
using namespace std;
int mp[200][200];
int main()
{
int n,i,a,ans,k,er,m,j,t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
memset(mp,0,sizeof(mp));
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)
{
k=1;
if(mp[i-1][j])
k*=2;
if(mp[i][j-1])
k*=2;
if(mp[i][j+1])
k*=2;
if(mp[i+1][j])
k*=2;
ans+=k;
}
}
}
printf("%d\n",ans);
}
return 0;
}