UVALive 5412 Street Directions

Street Directions

Time Limit: 3000ms

Memory Limit: 131072KB

This problem will be judged on UVALive. Original ID: 5412
64-bit integer IO format: %lld      Java class name: Main

 

According to the Automobile Collision Monitor (ACM), most fatal traffic accidents occur on two-way streets. In order to reduce the number of fatalities caused by traffic accidents, the mayor wants to convert as many streets as possible into one-way streets. You have been hired to perform this conversion, so that from each intersection, it is possible for a motorist to drive to all the other intersections following some route.

You will be given a list of streets (all two-way) of the city. Each street connects two intersections, and does not go through an intersection. At most four streets meet at each intersection, and there is at most one street connecting any pair of intersections. It is possible for an intersection to be the end point of only one street. You may assume that it is possible for a motorist to drive from each destination to any other destination when every street is a two-way street.

 

Input

The input consists of a number of cases. The first line of each case contains two integers n and m. The number of intersections is n ( ), and the number of streets ism. The next m lines contain the intersections incident to each of the m streets. The intersections are numbered from 1 to n, and each street is listed once. If the pair  is present,  will not be present. End of input is indicated by n = m = 0.

 

Output

For each case, print the case number (starting from 1) followed by a blank line. Next, print on separate lines each street as the pair  to indicate that the street has been assigned the direction going from intersection i to intersection j. For a street that cannot be converted into a one-way street, print both  and  on two different lines. The list of streets can be printed in any order. Terminate each case with a line containing a single `#' character.

Note: There may be many possible direction assignments satisfying the requirements. Any such assignment is acceptable.

 

Sample Input

7 10
1 2
1 3
2 4
3 4
4 5
4 6
5 7
6 7
2 5
3 6
7 9
1 2
1 3
1 4
2 4
3 4
4 5
5 6
5 7
7 6
0 0

Sample Output

1

1 2
2 4
3 1
3 6
4 3
5 2
5 4
6 4
6 7
7 5
#
2

1 2
2 4
3 1
4 1
4 3
4 5
5 4
5 6
6 7
7 5
#

Source

Regionals 1998, North America - East Central NA

 

解题：题目的意思是说将一个无向图改成有向图，使其成为强连通，输出所有的边。我们可以求无向图的边双连通分量，对于同一个双连通分量，只需保留单边即可构成强连通，而不同的双连通分量则需保留双向边

 

边双连通分量

 

 #include <iostream>
 #include <cstring>
 #include <cstdio>
 #include <stack>
 using namespace std;
 const int maxn = ;
 struct arc {
     int to,next;
     bool vis;
     arc(int x = ,int y = -) {
         to = x;
         next = y;
         vis = false;
     }
 } e[];
 int dfn[maxn],low[maxn],belong[maxn],idx,bcc;
 int head[maxn],tot,n,m;
 void add(int u,int v) {
     e[tot] = arc(v,head[u]);
     head[u] = tot++;
 }
 stack<int>stk;
 void tarjan(int u,int fa) {
     dfn[u] = low[u] = ++idx;
     stk.push(u);
     bool flag = false;
     for(int i = head[u]; ~i; i = e[i].next) {
         if(e[i].to == fa && !flag) {
             flag = true;
             continue;
         }
         if(!dfn[e[i].to]) {
             tarjan(e[i].to,u);
             low[u] = min(low[u],low[e[i].to]);
         } else low[u] = min(low[u],dfn[e[i].to]);
     }
     if(low[u] == dfn[u]) {
         int v;
         bcc++;
         do {
             belong[v  = stk.top()] = bcc;
             stk.pop();
         } while(v != u);
     }
 }
 bool vis[maxn];
 void dfs(int u,int fa) {
     vis[u] = true;
     for(int i = head[u]; ~i; i = e[i].next) {
         if(e[i].to == fa) continue;
         if(belong[u] == belong[e[i].to] && !e[i].vis)
             printf("%d %d\n",u,e[i].to);
         else if(belong[u] != belong[e[i].to] && !e[i].vis) {
             printf("%d %d\n",u,e[i].to);
             printf("%d %d\n",e[i].to,u);
         }
         e[i].vis = e[i^].vis = true;
         if(!vis[e[i].to]) dfs(e[i].to,u);
     }
 }
 void init() {
     for(int i = ; i < maxn; ++i) {
         head[i] = -;
         dfn[i] = belong[i] = ;
         vis[i] = false;
     }
     tot = idx = bcc = ;
     while(!stk.empty()) stk.pop();
 }
 int main() {
     int u,v,kase = ;
     while(scanf("%d%d",&n,&m),n||m){
         init();
         for(int i = ; i < m; ++i){
             scanf("%d%d",&u,&v);
             add(u,v);
             add(v,u);
         }
         tarjan(,-);
         printf("%d\n\n",kase++);
         dfs(,-);
         puts("#");
     }
     return ;
 }