【HDU 4925】BUPT 2015 newbie practice #2 div2-C-HDU 4925 Apple Tree

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=102419#problem/C

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

题意：给你n×m的格子，每个格子你可以选择给1，或者使它上下左右（如果有）的数字乘2，你对每个格子操作的先后顺序是自由的，求所有格子数字总和的最大值。

t组（小于100）数据，n和m（1到100）

题解：要使总和最大，那就每隔一个格子给1，使得每个给1的格子周围都是乘2的格子，这样它就乘了最多次2，比如3行4列

1 0 1 0

0 1 0 1

1 0 1 0

这里0表示使周围的乘2，我们的顺序是先给1，再乘2，于是总和是4+8+16+8+4+8=48

法一。

模拟这些格子，根据n和m，构造出上述的01二维数组，再对每个格子判断周围几个0，然后乘几次2，累加答案

代码：

#include<cstdio>
#include<cstring>

int ma[][];
int main()
{
    int n,m,t,k,ans,u,h;
    int ma[][];
    scanf("%d",&t);

    while(t--)
    {
        memset(ma,,sizeof(ma));
        ans=;
        k=;
        scanf("%d%d",&n,&m);
        for(int i=; i<n; i++)
        {
            for(int j=+k; j<m; j+=)
                ma[i][j]=;//设置它为1
            k=!k;
        }
        for(int i=; i<n; i++)
        {
            for(int j=; j<m; j++)
            {
                if(ma[i][j])
                {
                    h=;
                    u=;
                    if(i->=)if(!ma[i-][j])u++;//如果为0,代表乘2
                    if(i+<n)if(!ma[i+][j])u++;
                    if(j->=)if(!ma[i][j-])u++;
                    if(j+<m)if(!ma[i][j+])u++;
                    for(int l=; l<=u; l++)h*=;
                    ans+=h;
                }
            }
        }
        printf("%d\n",ans);

    }
    return ;

}

法二。

如果行列数之和为奇数，则给1，并且使它周围为乘2，则这个1就要乘几次2了，根据是否在边缘，判断乘几次2，累加答案

代码：

//code from lyt
#include<cstdio>
using namespace std;
int T;
int n,m;
long long ans=;
long long now=;
int main()
{
    scanf("%d",&T);
    while(T)
    {
        scanf("%d%d",&n,&m);
        ans=;
        for(int i=; i<=n; i++)
        {
            for(int j=; j<=m; j++)
            {
                if((i+j)&)
                {
                    now=;
                    if(i>)
                        now<<=;
                    if(j>)
                        now<<=;
                    if(i<n)
                        now<<=;
                    if(j<m)
                        now<<=;
                    ans+=now;
                }
            }
        }
        printf("%lld\n",ans);
        T--;
    }
    return ;
}

法三。

通过分析推出公式（x表示n，y表示m）

ans=1，当x=1，y=1；

ans=2*(y-1)，当x=1，y>1；

ans=(x-1)*2，当x>1，y=1；

ans=(x-1)*8*(y-1)，当x>1，y>1；

具体怎么分析推出的，...不详

代码：

//code from zdh
#include<stdio.h>
int T,x,y,s;
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&x,&y);
        if(x>)
        {
            if(y==)
                s=(x-)*;
            else
                s=(x-)**(y-);
        }
        else
        {
            if(y==)
                s=;
            else
                s=*(y-);
        }
        printf("%d\n",s);
    }
    return ;
}