标签：2014 multi-universit   acm   算法   水题   

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4925

Apple Tree

2
2 2
3 3

8
32

签道题，没啥好说的，黑白染色的方法是最优的，特判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;
}

hdu 4925 Apple Tree--2014 Multi-University Training Contest 6,布布扣,bubuko.com

hdu 4925 Apple Tree--2014 Multi-University Training Contest 6

标签：2014 multi-universit   acm   算法   水题   

原文地址：http://blog.csdn.net/asdfghjkl1993/article/details/38425007