POJ 3279 Fliptile

题意：给出长宽分别为m*n的一个矩阵，矩阵中有0或1两个数字，0表示反面，1表示正面以( x, y )为中心，翻转( x, y, ) ( x-1, y )( x+1, y ) ( x, y+1) ( x, y-1 )五个点，是否存在翻转若干个点，将该矩阵中所有点翻转为0，若存在，输出翻转次数最少情况下每个点需要翻转的次数，若翻转次数相同，输出字典序较小的情况

链接：http://poj.org/problem?id=3279

思路：对第一行进行枚举，其他行进行翻转，判断最后一行是否都为0，记录字典序较小的情况

注意点：字典序较小可以通过自右向左进行枚举

以下为AC代码：

Run ID	User	Problem	Result	Memory	Time	Language	Code Length	Submit Time
13917584	luminous11	3279	Accepted	744K	532MS	G++	2819B	2015-02-27 22:33:02

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
const double pi = acos(-1);
int m, n;
int dir[5][2] = { 0,0, 0,1, 0,-1, 1,0, -1,0 };
int num[20][20];
int ans[20][20];
int vis[20][20];
int out[20][20];
int flag = 0;
int _min;
void print()
{
    for ( int i = 0; i < m; i ++ ){
        cout << out[i][0];
        for ( int j = 1; j < n; j ++ ){
            cout << ' ' << out[i][j];
        }
        cout << endl;
    }
}
void filp ( int x, int y )
{
    for ( int i = 0; i < 5; i ++ ){
        int xi = x + dir[i][0];
        int yi = y + dir[i][1];
        if ( xi >= 0 && yi >= 0 )
            ans[xi][yi] ^= 1;
    }
}

bool check ( int k )
{
    int cnt = 0;
    clr ( vis, 0 );
    memcpy ( ans, num, sizeof ( num ) );
    /*for ( int i = 0; i < n; i ++ ){
        int tmp = ( k >> i ) & 1;
        vis[0][n-i-1] = tmp;
        if ( tmp == 1 ){
            filp ( 0, n - i - 1 );
            cnt ++;
        }
    }*/
    for ( int i = n - 1; i >= 0; i -- ){
        vis[0][i] = k & 1;
        k >>= 1;
        if ( vis[0][i] ){
            filp ( 0, i );
            cnt ++;
        }
    }
    if ( cnt >= _min )return false;
    for ( int i = 1; i < m; i ++ ){
        for ( int j = 0; j < n; j ++ ){
            if ( ans[i-1][j] ){
                filp ( i, j );
                vis[i][j] = 1;
                cnt ++;
                if ( cnt >= _min )return false;
            }
        }
    }
    for ( int i = 0; i < n; i ++ ){
        if ( ans[m-1][i] == 1 )return false;
    }
    if ( cnt < _min ){
        _min = cnt;
        memcpy ( out, vis, sizeof ( out ) );
    }
    return true;
}
int main()
{
    ios::sync_with_stdio( false );
    while ( cin >> m >> n ){
        flag = 0;
        _min = 1 << 30;
        for ( int i = 0; i < m; i ++ ){
            for ( int j = 0; j < n; j ++ ){
                cin >> num[i][j];
            }
        }
        int len = 1 << ( n + 1 );
        for ( int i = 0; i < len; i ++ ){
            if ( check ( i ) ){
                flag = 1;
            }
        }
        if ( flag == 1 )
            print();
        else
            cout << "IMPOSSIBLE" << endl;
    }
    return 0;
}