HDU 4925 Apple Tree（模拟题）

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 using namespace std;
 6 const int maxn = 100+5;
 7 int map[maxn][maxn];
 8 int _x[4] = {-1,0,1,0};
 9 int _y[4] = {0,1,0,-1};
10 int main()
11 {
12     int T,n,m;
13     scanf("%d",&T);
14     while(T--)
15     {
16         scanf("%d%d",&n,&m);
17         if(n == 1 && m == 1)
18         {
19             printf("1\n");
20             continue;
21         }
22         memset(map,0,sizeof(map));
23         for(int i = 1;i <= n;++i)
24         for(int j = 1;j <= m;++j)
25         if((i + j) & 1)
26         map[i][j] = 1;
27         for(int i = 1;i <= n;++i)
28         for(int j = 1;j <= m;++j)
29         if(!map[i][j])
30         for(int k = 0;k <  4;++k)
31         {
32             int x = i + _x[k];
33             int y = j + _y[k];
34             if(x >= 1 && x <= n && y >= 1 && y <= m)
35             map[x][y] *= 2;
36         }
37         int ans = 0;
38         for(int i = 1;i <= n;++i)
39         for(int j = 1;j <= m;++j)
40         ans += map[i][j];
41         printf("%d\n",ans);
42     }
43     return 0;
44 }