CodeForces - 844B Rectangles

You are given n × m table. Each cell of the table is colored white or black. Find the number of non-empty sets of cells such that:
All cells in a set have the same color.
Every two cells in a set share row or column.
Input
The first line of input contains integers n and m (1 ≤ n, m ≤ 50) — the number of rows and the number of columns correspondingly.
The next n lines of input contain descriptions of rows. There are m integers, separated by spaces, in each line. The number equals 0 if the corresponding cell is colored white and equals 1 if the corresponding cell is colored black.
Outpu
Output single integer  — the number of non-empty sets from the problem description.
Example
Input
1 1
0
Output
1
Input
2 3
1 0 1
0 1 0
Output
8
Note

In the second example, there are six one-element sets. Additionally, there are two two-element sets, the first one consists of the first and the third cells of the first row, the second one consists of the first and the third cells of the second row. To sum up, there are 8 sets.

给你一个n×m的棋盘，上面有0、1两种棋子。同种且同行（或同列）的棋子可以形成一个集合，一个棋子也可以看做一个集合。问你最多可以有多少种集合。

 #include <iostream>
 #include <algorithm>
 #include <cstdio>
 #include <cstring>
 #include <queue>
 using namespace std;
 typedef long long LL;
 int main()
 {
     int m,n;
        cin>>n>>m;
         int a[51][51];
         for(int i=0;i<n;++i)
         for(int j=0;j<m;++j)
         {
             scanf("%d",&a[i][j]);
         }
         int one,zero;
         long long  sum=0;
         for(int i=0;i<n;++i)
         {
             one=zero=0;
            for(int j=0;j<m;++j)
            if(a[i][j])
                one++;
            else
                zero++;
            sum+=(1LL<<one)-1;
            sum+=(1LL<<zero)-1;
         }
         for(int i=0;i<m;++i)
         {
             one=zero=0;
             for(int j=0;j<n;++j)
                if(a[j][i])
                    one++;
                else
                    zero++;
             sum+=(1LL<<one)-1;
             sum+=(1LL<<zero)-1;
         }
         cout<<sum-n*m<<endl;
     return 0;
 }

考虑到n和m都比较小，分别枚举每一行的0、1棋子，对于每个棋子有选和不选两种可能。比如说某一行有k个1棋子，那么这一行可以形成的集合的数目就是2k−1，减一是因为要减去一个棋子都不选的这种不合法状态。枚举完行之后列同理。

  枚举完行和列之后会发现每个集合只有一个一个棋子的情况都被枚举了两遍，所以最终答案再减去n×m即可。