POJ 3279 Fliptile

POJ 3279 Fliptile

WA代码及优化

就一个错误，很是憨批。

#include <iostream>
#include <cstdio>
#include <string>

using namespace std;
int const N = 20;
int g[N][N];
int turn[N][N];
int tmp[N][N];
int fin[N][N];
int n, m;

int f[4][2] = {
        {0,  1},
        {0,  -1},
        {1,  0},
        {-1, 0},
};

void solve() {
    int ans = INT_MAX;
    for (int p = 0; p < (1 << m); p++) {

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++)
                tmp[i][j] = g[i][j], turn[i][j] = 0;
        }

        int t = p, cnt = m - 1;
        while (t) {
            if (t & 1) {
                turn[0][cnt] += 1;
                tmp[0][cnt] ^= 1;
                for (int k = 0; k < 4; k++) {
                    int x = 0 + f[k][0], y = cnt + f[k][1];
                    if (x < 0 || y < 0 || x >= n || y >= m) continue;
                    tmp[x][y] ^= 1;
                }
            }
            // TODO: 憨批点1 
            // 这玩意你见过谁左移的？改了就ac，几个小时就用在这里了。
            t <<= 1;
            cnt -= 1;
        }

        for (int i = 1; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (tmp[i - 1][j] == 1) {
                    tmp[i][j] ^= 1;
                    turn[i][j] += 1;
                    for (int k = 0; k < 4; k++) {
                        int x = i + f[k][0], y = j + f[k][1];
                        if (x < 0 || y < 0 || x >= n || y >= m) continue;
                        tmp[x][y] ^= 1;
                    }
                }
            }
        }

        bool flag = true;
        for (int j = 0; j < m; j++) {
            if (tmp[n - 1][j] == 1) {
                flag = false;
                break;
            }
        }

        if (flag) {
            int ret = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    ret += (turn[i][j]);
                }
            }
            if (ret < ans) {
                ans = ret;
                for (int i = 0; i < n; i++) {
                    for (int j = 0; j < m; j++) {
                        fin[i][j] = turn[i][j];
                    }
                }
            }
        }
    }
    if (ans == INT_MAX) puts("IMPOSSIBLE\n");
    else {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                printf("%d ", fin[i][j]);
            }
            puts("");
        }
    }
}

int main() {

    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            scanf("%d", &g[i][j]);
        }
    }
    solve();
    return 0;
}

AC代码

#include <iostream>
#include <cstdio>

using namespace std;

int const N = 20;
int const INF = 0x3f3f3f3f;
int m, n;
int tmp[N][N], g[N][N], turn[N][N], ret[N][N];
int step;
int f[5][2] = {
        {0,  0},
        {0,  1},
        {0,  -1},
        {1,  0},
        {-1, 0}
};

void flip(int x, int y) {
    step += 1;
    turn[x][y] += 1;
    for (int i = 0; i < 5; i++) {
        int a = x + f[i][0], b = y + f[i][1];
        if (a < 0 || b < 0 || a >= n || b >= m) continue;
        tmp[a][b] ^= 1;
    }
}

void solve() {
    int ans = INF;
    for (int i = 0; i < (1 << m); i++) {
        step += 1;
        for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) tmp[i][j] = g[i][j], turn[i][j] = 0;

        for (int j = 0; j < m; j++) {
            if (i & (1 << j)) {
                flip(0, j);
            }
        }

        for (int i = 1; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (tmp[i - 1][j]) {
                    flip(i, j);
                }
            }
        }

        bool flag = true;
        for (int i = 0; i < m; i++)
            if (tmp[n - 1][i] == 1) {
                flag = false;
                break;
            }
        if ((step < ans) && flag) {
            ans = step;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    ret[i][j] = turn[i][j];
                }
            }
        }
    }
    if (ans == INF) cout << "IMPOSSIBLE\n";
    else {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) cout << ret[i][j] << ' ';
            cout << '\n';
        }
    }
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif

    ios::sync_with_stdio(false);

    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> g[i][j];
        }
    }
    solve();
    return 0;
}