Submission #1963949

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
using namespace std;

int r, c;

int senbei[10][10000];

int black[10000];
int white[10000];

int rec(vector<int> bl_ch,vector<int> wh_ch,int cou)
{
    if(cou == r)
    {
        int result = 0;
        for(int i = 0;i < c;i++)
        {
            result += max(black[i] + bl_ch[i],white[i] + wh_ch[i]);
        }
        return result;
    }
    int ans = 0;
    ans = rec(bl_ch,wh_ch,cou + 1);
    for(int i = 0;i < c;i++)
    {
        bl_ch[i] += (senbei[cou][i] == 0 ? -1 : 1);
        wh_ch[i] += (senbei[cou][i] == 1 ? -1 : 1);
    }
    ans = max(ans,rec(bl_ch,wh_ch,cou + 1));
    for(int i = 0;i < c;i++)
    {
        bl_ch[i] += (senbei[cou][i] == 1 ? -1 : 1);
        wh_ch[i] += (senbei[cou][i] == 0 ? -1 : 1);
    }
    return ans;
}

int main()
{
    cin >> r >> c;
    int tmp;
    for (int i = 0; i < r; i++)
    {
        for (int j = 0; j < c; j++)
        {
            cin >> tmp;
            senbei[i][j] = tmp;
            if(tmp == 0)
            {
                black[j]++;
            }
            else
            {
                white[j]++;
            }
        }
    }

    vector<int> bl(c);
    vector<int> wh(c);

    cout << rec(bl,wh,0) << endl;
    return 0;


}

Submission Info

Judge Result