HDU2181 哈密顿绕行世界问题 简单DFS

http://acm.hdu.edu.cn/showproblem.php?pid=2181

Sample Input

2 5 20
1 3 12
2 4 10
3 5 8
1 4 6
5 7 19
6 8 17
4 7 9
8 10 16
3 9 11
10 12 15
2 11 13
12 14 20
13 15 18
11 14 16
9 15 17
7 16 18
14 17 19
6 18 20
1 13 19
5
0

 Sample Output

1:  5 1 2 3 4 8 7 17 18 14 15 16 9 10 11 12 13 20 19 6 5
2:  5 1 2 3 4 8 9 10 11 12 13 20 19 18 14 15 16 17 7 6 5
3:  5 1 2 3 10 9 16 17 18 14 15 11 12 13 20 19 6 7 8 4 5
4:  5 1 2 3 10 11 12 13 20 19 6 7 17 18 14 15 16 9 8 4 5
5:  5 1 2 12 11 10 3 4 8 9 16 15 14 13 20 19 18 17 7 6 5
6:  5 1 2 12 11 15 14 13 20 19 18 17 16 9 10 3 4 8 7 6 5
7:  5 1 2 12 11 15 16 9 10 3 4 8 7 17 18 14 13 20 19 6 5
8:  5 1 2 12 11 15 16 17 18 14 13 20 19 6 7 8 9 10 3 4 5
9:  5 1 2 12 13 20 19 6 7 8 9 16 17 18 14 15 11 10 3 4 5
10:  5 1 2 12 13 20 19 18 14 15 11 10 3 4 8 9 16 17 7 6 5
11:  5 1 20 13 12 2 3 4 8 7 17 16 9 10 11 15 14 18 19 6 5
12:  5 1 20 13 12 2 3 10 11 15 14 18 19 6 7 17 16 9 8 4 5
13:  5 1 20 13 14 15 11 12 2 3 10 9 16 17 18 19 6 7 8 4 5
14:  5 1 20 13 14 15 16 9 10 11 12 2 3 4 8 7 17 18 19 6 5
15:  5 1 20 13 14 15 16 17 18 19 6 7 8 9 10 11 12 2 3 4 5
16:  5 1 20 13 14 18 19 6 7 17 16 15 11 12 2 3 10 9 8 4 5
17:  5 1 20 19 6 7 8 9 10 11 15 16 17 18 14 13 12 2 3 4 5
18:  5 1 20 19 6 7 17 18 14 13 12 2 3 10 11 15 16 9 8 4 5
19:  5 1 20 19 18 14 13 12 2 3 4 8 9 10 11 15 16 17 7 6 5
20:  5 1 20 19 18 17 16 9 10 11 15 14 13 12 2 3 4 8 7 6 5
21:  5 4 3 2 1 20 13 12 11 10 9 8 7 17 16 15 14 18 19 6 5
22:  5 4 3 2 1 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5
23:  5 4 3 2 12 11 10 9 8 7 6 19 18 17 16 15 14 13 20 1 5
24:  5 4 3 2 12 13 14 18 17 16 15 11 10 9 8 7 6 19 20 1 5
25:  5 4 3 10 9 8 7 6 19 20 13 14 18 17 16 15 11 12 2 1 5
26:  5 4 3 10 9 8 7 17 16 15 11 12 2 1 20 13 14 18 19 6 5
27:  5 4 3 10 11 12 2 1 20 13 14 15 16 9 8 7 17 18 19 6 5
28:  5 4 3 10 11 15 14 13 12 2 1 20 19 18 17 16 9 8 7 6 5
29:  5 4 3 10 11 15 14 18 17 16 9 8 7 6 19 20 13 12 2 1 5
30:  5 4 3 10 11 15 16 9 8 7 17 18 14 13 12 2 1 20 19 6 5
31:  5 4 8 7 6 19 18 17 16 9 10 3 2 12 11 15 14 13 20 1 5
32:  5 4 8 7 6 19 20 13 12 11 15 14 18 17 16 9 10 3 2 1 5
33:  5 4 8 7 17 16 9 10 3 2 1 20 13 12 11 15 14 18 19 6 5
34:  5 4 8 7 17 18 14 13 12 11 15 16 9 10 3 2 1 20 19 6 5
35:  5 4 8 9 10 3 2 1 20 19 18 14 13 12 11 15 16 17 7 6 5
36:  5 4 8 9 10 3 2 12 11 15 16 17 7 6 19 18 14 13 20 1 5
37:  5 4 8 9 16 15 11 10 3 2 12 13 14 18 17 7 6 19 20 1 5
38:  5 4 8 9 16 15 14 13 12 11 10 3 2 1 20 19 18 17 7 6 5
39:  5 4 8 9 16 15 14 18 17 7 6 19 20 13 12 11 10 3 2 1 5
40:  5 4 8 9 16 17 7 6 19 18 14 15 11 10 3 2 12 13 20 1 5
41:  5 6 7 8 4 3 2 12 13 14 15 11 10 9 16 17 18 19 20 1 5
42:  5 6 7 8 4 3 10 9 16 17 18 19 20 13 14 15 11 12 2 1 5
43:  5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 3 4 5
44:  5 6 7 8 9 16 17 18 19 20 1 2 12 13 14 15 11 10 3 4 5
45:  5 6 7 17 16 9 8 4 3 10 11 15 14 18 19 20 13 12 2 1 5
46:  5 6 7 17 16 15 11 10 9 8 4 3 2 12 13 14 18 19 20 1 5
47:  5 6 7 17 16 15 11 12 13 14 18 19 20 1 2 3 10 9 8 4 5
48:  5 6 7 17 16 15 14 18 19 20 13 12 11 10 9 8 4 3 2 1 5
49:  5 6 7 17 18 19 20 1 2 3 10 11 12 13 14 15 16 9 8 4 5
50:  5 6 7 17 18 19 20 13 14 15 16 9 8 4 3 10 11 12 2 1 5
51:  5 6 19 18 14 13 20 1 2 12 11 15 16 17 7 8 9 10 3 4 5
52:  5 6 19 18 14 15 11 10 9 16 17 7 8 4 3 2 12 13 20 1 5
53:  5 6 19 18 14 15 11 12 13 20 1 2 3 10 9 16 17 7 8 4 5
54:  5 6 19 18 14 15 16 17 7 8 9 10 11 12 13 20 1 2 3 4 5
55:  5 6 19 18 17 7 8 4 3 2 12 11 10 9 16 15 14 13 20 1 5
56:  5 6 19 18 17 7 8 9 16 15 14 13 20 1 2 12 11 10 3 4 5
57:  5 6 19 20 1 2 3 10 9 16 15 11 12 13 14 18 17 7 8 4 5
58:  5 6 19 20 1 2 12 13 14 18 17 7 8 9 16 15 11 10 3 4 5
59:  5 6 19 20 13 12 11 10 9 16 15 14 18 17 7 8 4 3 2 1 5
60:  5 6 19 20 13 14 18 17 7 8 4 3 10 9 16 15 11 12 2 1 5

一道简单的DFS，练手感用的，对于这个正十二面体，可以看做一个连通图，使用邻接表或者矩阵来存储就可以了。

 邻接表版本：

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

#define eps         (1e-6)
#define LL          long long
#define ll          long long
#define ZERO(a)     memset(a,0,sizeof(a))

const LL INF = 0x3f3f3f3f;
const int mod = 1e9+7;
const int maxn =  24;

bool vis[maxn];
vector<int> v[maxn];

struct Road{
    int steps[maxn];
};
vector<Road> ans;
int cnt, start;

void dfs(int deep, Road x, int fa){
    if(deep >= 21 || fa == start && deep!=1)
        return;
    if(deep == 20){
        x.steps[deep] = fa;
        for(int i=0; i<3; ++i){
            if(v[fa][i] == start){
                x.steps[++deep] = start;
                ans.push_back(x);
                return;
            }
        }
    }

    x.steps[deep] = fa;
    for(int i=0; i<3; ++i){
        int son = v[fa][i];
        if(!vis[son]){
            vis[son] = true;
            dfs(deep+1, x, son);
            vis[son] = false;
        }
    }
    return;
}
bool cmp(Road a, Road b){
    for(int i=1; i<=20; ++i){
        return a.steps[i] < b.steps[i];
    }
    return false;
}

int main()
{
    for(int i=1; i<=20; ++i){
        int a,b,c;
        scanf("%d%d%d", &a, &b, &c);
        v[i].push_back(a);
        v[i].push_back(b);
        v[i].push_back(c);
    }

    Road temp;
    while(scanf("%d",&start)!=EOF){
        if(start == 0) break;
        ZERO(vis);
        cnt = 1;
        ans.clear();
        dfs(1, temp, start);
        sort(ans.begin(), ans.end(), cmp);
        for(auto it = ans.begin(); it!=ans.end(); ++it){
            auto then = *it;
            printf("%d: ",it - ans.begin() +1);
            for(int i=1; i<=21; ++i)
                printf(" %d",then.steps[i]);
            puts("");
        }
    }
    return 0;
}

邻接矩阵版本

使用邻接矩阵的话，只要按顺序遍历图，就是按字典序输出的，省下排序的部分了。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

#define eps         (1e-6)
#define LL          long long
#define ll          long long
#define ZERO(a)     memset(a,0,sizeof(a))
const int maxn = 24;

bool city[maxn][maxn], vis[maxn];
int path[maxn], start, cnt;

void dfs(int fa, int deep){
    path[deep] = fa;
    if(deep == 20){
        if(city[fa][start]){
            printf("%d: ",cnt++);
            for(int i=1; i<=20; ++i)
                printf(" %d", path[i]);
            printf(" %d\n", start);
        }
        return;
    }
    //
    for(int i=1; i<=20; ++i){
        if(city[fa][i] && !vis[i]){
            vis[i] = 1;
            dfs(i, deep+1);
            vis[i] = 0;
        }
    }
    return;
}

int main()
{
    ZERO(city);
    for(int i=1; i<=20; ++i){
        int a,b,c;
        scanf("%d%d%d", &a, &b, &c);
        city[i][a] = 1, city[i][b] = 1, city[i][c] = 1;
    }

    while(scanf("%d",&start),start){
        ZERO(vis), ZERO(path), cnt = 1, vis[start] = 1;
        dfs(start, 1);
    }
    return 0;
}