UVA610 Street Directions

题目链接

给定一个无向图，问这个无向图里面那些边变成有向边以后，该图还是一个强连通图。

求边-双连通分量，然后枚举所有边，如果边上两个点在同一个连通分量里面，就保留一个方向，否则的话就两个方向都保留，

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <stack>
using namespace std;
const int maxn = 1111;
struct edge{
    int u, v, next;
    bool vis;
}e[maxn * maxn];
int first[maxn], pre[maxn], bcc_cnt, bccno[maxn], dfs_clock, tot;
bool vis[maxn];
vector<int> P[maxn];
int dfs1(int u, int fa){
    int lowu = pre[u] = ++dfs_clock;
    for (int i = first[u]; i != -1; i = e[i].next){
        int v = e[i].v;
        if (!pre[v]){
            int lowv = dfs1(v, u);
            lowu = min(lowu, lowv);
            if (lowv > pre[u]){
                P[u].push_back(v);
                P[v].push_back(u);
            }
        }
        else if (pre[v] < pre[u] && v != fa)
            lowu = min(lowu, pre[v]);
    }
    return lowu;
}
void dfs2(int u, int fa){
    bccno[u] = bcc_cnt;
    for (int i = first[u]; i != -1; i = e[i].next){
        int v = e[i].v;
        bool f = 1;
        for (int j = 0; j < P[u].size(); j++){
            int vv = P[u][j];
            if (v == vv){
                f = 0; break;
            }
        }
        if (!f || bccno[v]) continue;
        dfs2(v, u);
    }
}
void find_bcc(int n){
    memset(pre, 0, sizeof(pre));
    memset(bccno, 0, sizeof(bccno));
    dfs_clock = bcc_cnt = 0;
    for (int i = 1; i <= n; i++)
        if (!pre[i]) dfs1(i, -1);
    for (int i = 1; i <= n; i++)
        if (!bccno[i]){
            bcc_cnt += 1;
            dfs2(i, -1);
        }
}
void add_edge(int x, int y){
    e[tot].u = x; e[tot].v = y; e[tot].vis = 0;
    e[tot].next = first[x]; first[x] = tot++;
}
void solve(int u,int fa){
    for(int i = first[u]; i != -1; i = e[i].next){
        int v = e[i].v;
        if(v != fa){
            if(bccno[u] == bccno[v] && !e[i].vis)
                printf("%d %d\n", u, v);
            else if(bccno[u] != bccno[v] && !e[i].vis){
                printf("%d %d\n", u, v);
                printf("%d %d\n", v, u);
            }
            e[i].vis = 1; e[i ^ 1].vis = 1;
            if(!vis[v]){
                vis[v] = 1;
                solve(v, u);
            }
        }
    }
}
int main(){
    //freopen("in.txt", "r", stdin);
    int p = 1, n, m;
    while(~scanf("%d%d", &n, &m)){
        if (!n && !m) break;
        memset(first, -1, sizeof(first));
        tot = 0;
        memset(vis, 0, sizeof(vis));
        for (int i = 0; i <= n; i++)
            P[i].clear();
        for (int i = 0; i < m; i++){
            int x, y;
            scanf("%d%d", &x, &y);
            add_edge(x, y); add_edge(y, x);
        }
        find_bcc(n);
        vis[1] = 1;
        printf("%d\n\n", p++);
        solve(1, 0);
        printf("#\n");
    }
    return 0;
}