Google Code Jam 2014 -- C

题目链接：https://code.google.com/codejam/contest/2974486/dashboard#s=p2

比赛的时候想出了小数据的处理办法， 位压缩然后枚举+BFS， 但是感觉枚举会超时就没写。

比赛之后发现了一种比较好的利用位运算快速求解全部组合数或者子集的方法

int comb = (1<<k) - 1;  
while(comb < 1<<(n))  
{  
    int x = comb & -comb, y = comb + x;  
    comb = ((comb & ~y) / x >> 1) | y;  
}  

这样就解决了枚举的效率问题，该题小数据的规模大概是R, C <= 5

所以枚举的次数最多为C(25，12). 

这种方法只能解决小数据部分，大的数据还不知道如何处理， 据说是要构造， 扫雷也是个充满神奇的游戏么？

//GCJ
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define lowbit(x) (x&(-x))
using namespace std;
typedef pair<int, int> PII;
queue<PII > q;
const int N = 6;
bool vis[N][N], flag[N][N];
int fx[8] = {0, 0, 1, 1, 1, -1, -1, -1};
int fy[8] = {1, -1, 0, 1, -1, 0, 1, -1};
int r, c, m;
int cnt;

bool check(int x, int y){
    if(x < 0 || x >= r) return 0;
    if(y < 0 || y >= c) return 0;
    return 1;
}

void bfs(int x, int y){
    while(!q.empty()){
        q.pop();
    }
    q.push(PII(x, y));
    vis[x][y] = 1;
    cnt = 1;

    while(!q.empty()){
        PII p = q.front();
        q.pop();
        int suc = 1;
        for(int i = 0; i < 8; ++i){
            int newx = p.first + fx[i];
            int newy = p.second + fy[i];
            if(check(newx , newy)){
                if(flag[newx][newy]){
                    suc = 0;
                    break;
                }
            }
        }
        if(suc == 0) continue;
        for(int i = 0; i < 8; ++i){
            int newx = p.first + fx[i];
            int newy = p.second + fy[i];
            if(check(newx, newy) && vis[newx][newy] == 0){
                vis[newx][newy] = 1;
                q.push(PII(newx, newy));
                ++cnt;
            }
        }
    }
}

bool gao(int src){
    memset(flag, 0, sizeof(flag));
    for(int i = 0; i < (r*c); ++i){
        if(src & (1<<i)){
            int x = i / c;
            int y = i % c;
            flag[x][y] = 1;
        }
    }

    for(int i = 0; i < r; ++i){
        for(int j = 0; j < c; ++j){
            if(flag[i][j] == 0){
                memset(vis, 0, sizeof(vis));
                bfs(i, j);
                if(cnt == r*c - m){
                    for(int p = 0; p < r; ++p){
                        for(int q = 0; q < c; ++q){
                            if(p == i && j == q) printf("c");
                            else if(flag[p][q] == 1) printf("*");
                            else printf(".");
                        }
                        printf("\n");
                    }
                    return 1;
                }
            }
        }
    }
    return 0;
}

int main(){
    int T, cases = 1;
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    scanf("%d", &T);
    while(T--){
        scanf("%d%d%d", &r, &c, &m);
        printf("Case #%d:\n", cases++);
        int sta = (1 << m) - 1;
        bool suc = 0;
        while(sta < (1 << (r*c))){
            if(gao(sta)){
                suc = 1;
                break;
            }
            int p1 = lowbit(sta), p2 = sta + p1;
            sta = ((sta & ~p2) / p1 >> 1) | p2;
        }
        if(suc == 0) printf("Impossible\n");
    }
    return 0;
}