UVA208 Firetruck 消防车（并查集，dfs）

要输出所有路径，又要字典序，dfs最适合了，用并查集判断1和目的地是否连通即可

#include<bits/stdc++.h>
using namespace std;
const int maxn = ;

int p[maxn],cnt[maxn];
void init(int n) {
    for(int i = ;i <= n; i++) p[i] = i,cnt[i] = ;
}
int Find(int x) { return p[x] == x ? x : p[x] = Find(p[x]); }

bool G0[maxn][maxn];
int G[maxn][maxn],deg[maxn];

int maxd;
int path[maxn];
bool vis[maxn];
int k,Count;
void dfs(int d,int cur)
{
    if(cur == k){
        printf("");
        for(int i = ; i < d; i++)
            printf(" %d",path[i]);
        puts("");
        Count++;
        return;
    }
    if(d == maxd) return;
    for(int i = ; i < deg[cur]; i++){
        int v = G[cur][i];
        if(vis[v]) continue;
        vis[v] = ;
        path[d] = v;
        dfs(d+,v);
        vis[v] = ;
    }
}

int main()
{
    //freopen("in.txt","r",stdin);
    int cas = ;
    while(~scanf("%d",&k)){
        printf("CASE %d:\n",++cas);
        int u,v,n = ;
        init();
        memset(G0,,sizeof(G0));
        memset(deg,,sizeof(deg));
        while(scanf("%d%d",&u,&v),u){
            G0[u][v] = G0[v][u] = ;
            n = max(n,v);
            n = max(n,u);
            int s1 = Find(u), s2 = Find(v);
            if(s1 != s2) {p[s1] = s2; cnt[s2] += cnt[s1];}
        }
        if(Find(k) != Find()) {printf("There are 0 routes from the firestation to streetcorner %d.\n",k); continue;}
        for(int i = ; i <= n; i++)
            for(int j = ; j <= n; j++) if(G0[i][j]){
                G[i][deg[i]++] = j;
            }
        maxd = cnt[Find()] ;
        memset(vis,,sizeof(vis));
        vis[] = ;
        Count = ;
        dfs(,);
        printf("There are %d routes from the firestation to streetcorner %d.\n",Count,k);
    }
    return ;
}