1286: [蓝桥杯2016初赛]剪邮票【四种方案，好题一道】

本题体会
如下图, 有12张连在一起的12生肖的邮票。现在你要从中剪下5张来，要求必须是连着的。（仅仅连接一个角不算相连）

比如，下面两张图中，粉红色所示部分就是合格的剪取


请你计算，一共有多少种不同的剪取方法。
输出
请填写表示方案数目的整数。

---

方案一：dfs遍历所有方案，判断是否合法

#include <iostream>
#include <cstring>
#include <ctime>
#include <set>
 
using namespace std;

const int N = 15;

int res;
int g[N][N];
int a[12] = {0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1};
//第一种dfs方式
void dfs(int i, int j){
    g[i][j] = 0;
    int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};
    for (int k = 0; k < 4; k ++ ){
        int x = i + dx[k], y = j + dy[k];
        if (x >= 0 && x < 3 && y >= 0 && y < 4 && g[x][y] == 1)
            dfs(x, y);
    } 
}
bool check(){
    for (int i = 0; i < 3; i ++ )
        for (int j = 0; j < 4; j ++ )
            if (a[i * 4 + j] == 1) g[i][j] = 1;
            else g[i][j] = 0;
    
    int cnt = 0;
    for (int i = 0; i < 3; i ++ )
        for (int j = 0; j < 4; j ++ )
            if (g[i][j] == 1){
                dfs(i, j);
                cnt ++;
            }
            
    return cnt == 1;
}

set<string> s1;

void a2s(string &s){
    for (int i = 0; i < 12; i ++ )
        s.insert(s.end(), a[i] + '0');
}

bool isExist(){
    string a_str;
    a2s(a_str);
    if (s1.find(a_str) == s1.end()){
        s1.insert(a_str);
        return false;
    }else return true;
}
void df(int u){
    if (u == 12){
        if (!isExist() && check()) res ++;
        return;
    }
    
    for (int i = u; i < 12; i ++ ){
        swap(a[i], a[u]);
        df(u + 1);
        swap(a[i], a[u]);
    }
}

int main(){
    df(0);
    
    cout << res << endl;
    cout << clock() << "ms" << endl;
    return 0;
}

---------
结果
116
873337ms
-------

---

方案二：提前判重

#include <iostream>
#include <cstring>
#include <ctime>
#include <set>
 
using namespace std;

const int N = 15;

int res;
int g[N][N];
int a[12] = {0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1};
bool st[N];
//第二种dfs方式
void dfs(int i, int j){
    g[i][j] = 0;
    if (i - 1 >= 0 && i - 1 < 3 && g[i - 1][j] == 1) dfs(i - 1, j);
    if (i + 1 >= 0 && i + 1 < 3 && g[i + 1][j] == 1) dfs(i + 1, j);
    if (j - 1 >= 0 && j - 1 < 4 && g[i][j - 1] == 1) dfs(i, j - 1);
    if (j + 1 >= 0 && j + 1 < 4 && g[i][j + 1] == 1) dfs(i, j + 1);
    
}
bool check(int path[12]){
    for (int i = 0; i < 3; i ++ )
        for (int j = 0; j < 4; j ++ )
            if (path[i * 4 + j] == 1) g[i][j] = 1;
            else g[i][j] = 0;
    
    int cnt = 0;
    for (int i = 0; i < 3; i ++ )
        for (int j = 0; j < 4; j ++ )
            if (g[i][j] == 1){
                dfs(i, j);
                cnt ++;
            }
            
    return cnt == 1;
}

void df(int u, int path[12]){
    if (u == 12){
        if (check(path)) res ++;
        return;
    }
    
    for (int i = 0; i < 12; i ++ ){
       if (i > 0 && a[i] == a[i - 1] && !st[i - 1]) continue;
       
       if (!st[i]){
           st[i] = true;
           path[u] = a[i];
           df(u + 1, path);
           st[i] = false;
       }
    }
}

int main(){
    int path[12];
    df(0, path);
    
    cout << res << endl;
    cout << clock() << "ms" << endl;
    return 0;
}

--------------
结果
116
2ms
-------------

---

方案三：用next_permutation()遍历所有可能，判断是否合法

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 15;

int res;
int g[N][N];
int a[12] = {0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1};

void dfs(int i, int j){
    g[i][j] = 0;
    if (i - 1 >= 0 && i - 1 < 3 && g[i - 1][j] == 1) dfs(i - 1, j);
    if (i + 1 >= 0 && i + 1 < 3 && g[i + 1][j] == 1) dfs(i + 1, j);
    if (j - 1 >= 0 && j - 1 < 4 && g[i][j - 1] == 1) dfs(i, j - 1);
    if (j + 1 >= 0 && j + 1 < 4 && g[i][j + 1] == 1) dfs(i, j + 1);
    
}
bool check(){
    for (int i = 0; i < 3; i ++ )
        for (int j = 0; j < 4; j ++ )
            if (a[i * 4 + j] == 1) g[i][j] = 1;
            else g[i][j] = 0;
    
    int cnt = 0;
    for (int i = 0; i < 3; i ++ )
        for (int j = 0; j < 4; j ++ )
            if (g[i][j] == 1){
                dfs(i, j);
                cnt ++;
            }
            
    return cnt == 1;
}

int main(){
    do{
        if (check()) res ++;
    }
    while (next_permutation(a, a + 12));
    
    cout << res << endl;
    
    return 0;
}

-----------
结果
116
----------

---

方案四：dfs组合型枚举
每次枚举5个数，对应了5个位置，然后我们对这5个位置遍历，判断是否合法。

#include <iostream>
#include <cstring>
#include <ctime>
#include <set>
 
using namespace std;

const int N = 15;

int res;
int g[N][N];
int a[12];

void dfs(int i, int j){
    g[i][j] = 0;
    int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};
    for (int k = 0; k < 4; k ++ ){
        int x = i + dx[k], y = j + dy[k];
        if (x >= 0 && x < 3 && y >= 0 && y < 4 && g[x][y] == 1)
            dfs(x, y);
    }
}

bool check(){
    memset(g, 0, sizeof g);
    for (int i = 0; i < 5; i ++ ){
        g[(a[i] - 1) / 4][(a[i] - 1) % 4] = 1;
    }
    
    int cnt = 0;
    for (int i = 0; i < 3; i ++ )
        for (int j = 0; j < 4; j ++ )
            if (g[i][j] == 1){
                dfs(i, j);
                cnt ++;
            }
            
    return cnt == 1;
}

void df(int u, int t){//u为当前枚举到的层数，t为从哪个数开始枚举
    if (u == 5){
        if (check()) res ++;
        return;
    }
    
    for (int i = t; i <= 12; i ++ ){
        a[u] = i;
        df(u + 1, i + 1)；//从下一个开始枚举
    }
}

int main(){
    df(0, 1);
    
    cout << res << endl;
    cout << clock() << "ms" << endl;
    return 0;
}