zoukankan      html  css  js  c++  java
  • HDU 4925 Apple Tree (瞎搞)

    找到规律,各一个种一棵树。或者施肥。先施肥,先种树一样。

    Apple Tree

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
    Total Submission(s): 197    Accepted Submission(s): 135


    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
     

    #include <algorithm>
    #include <iostream>
    #include <stdlib.h>
    #include <string.h>
    #include <iomanip>
    #include <stdio.h>
    #include <string>
    #include <queue>
    #include <cmath>
    #include <stack>
    #include <map>
    #include <set>
    #define eps 1e-12
    ///#define M 1000100
    #define LL __int64
    ///#define LL long long
    ///#define INF 0x7ffffff
    #define INF 0x3f3f3f3f
    #define PI 3.1415926535898
    #define zero(x) ((fabs(x)<eps)?0:x)
    
    using namespace std;
    
    
    const int maxn = 110;
    
    int mp[maxn][maxn];
    
    int main()
    {
        int n, m;
        int T;
        cin >>T;
        while(T--)
        {
            scanf("%d %d",&n, &m);
            memset(mp, 0, sizeof(mp));
            for(int i = 1; i <= n; i++)
            {
                if(i%2)
                {
                    for(int j = 1; j <= m; j += 2)
                        mp[i][j] = 1;
                }
                else
                {
                    for(int j = 2; j <= m; j+= 2)
                        mp[i][j] = 1;
                }
            }
            LL sum = 0;
            for(int i = 1; i <= n; i++)
            {
                for(int j = 1; j <= m; j++)
                {
                    if(mp[i][j]) continue;
                    int cnt = 0;
                    if(i-1 >= 1) if(mp[i-1][j]) cnt ++;
                    if(i+1 <= n) if(mp[i+1][j]) cnt ++;
                    if(j-1 >= 1) if(mp[i][j-1]) cnt++;
                    if(j+1 <= m) if(mp[i][j+1]) cnt++;
                    sum += (1LL<<cnt);
                }
            }
            if(sum == 0)
                sum++;
            cout<<sum<<endl;
        }
    }


  • 相关阅读:
    【原创】性能测试之——网络环境分析
    【转载】测试人员管理之——离职类型分析
    【转载】测试人员管理之——离职人员管理
    【转载】测试缺陷生命周期定义
    【转载】如何对软件测试方法分类
    【原创】Java批量反编译利器(jd-gui)介绍
    【原创】Linux常用管理命令总结
    shelve模块 xml模块
    json模块
    sys模块
  • 原文地址:https://www.cnblogs.com/slgkaifa/p/6800155.html
Copyright © 2011-2022 走看看