ZOJ 2588 双连通分量

Burning Bridges

---

Time Limit: 5 Seconds Memory Limit: 32768 KB

---

Ferry Kingdom is a nice little country located on N islands that are connected by M bridges. All bridges are very beautiful and are loved by everyone in the kingdom. Of course, the system of bridges is designed in such a way that one can get from any island to any other one.

But recently the great sorrow has come to the kingdom. Ferry Kingdom was conquered by the armies of the great warrior Jordan and he has decided to burn all the bridges that connected the islands. This was a very cruel decision, but the wizards of Jordan have advised him no to do so, because after that his own armies would not be able to get from one island to another. So Jordan decided to burn as many bridges as possible so that is was still possible for his armies to get from any island to any other one.

Now the poor people of Ferry Kingdom wonder what bridges will be burned. Of course, they cannot learn that, because the list of bridges to be burned is kept in great secret. However, one old man said that you can help them to find the set of bridges that certainly will not be burned.

So they came to you and asked for help. Can you do that?

Input

The input contains multiple test cases. The first line of the input is a single integer T (1 <= T <= 20) which is the number of test cases. T test cases follow, each preceded by a single blank line.

The first line of each case contains N and M - the number of islands and bridges in Ferry Kingdom respectively (2 <= N <= 10 000, 1 <= M <= 100 000). Next M lines contain two different integer numbers each and describe bridges. Note that there can be several bridges between a pair of islands.

Output

On the first line of each case print K - the number of bridges that will certainly not be burned. On the second line print K integers - the numbers of these bridges. Bridges are numbered starting from one, as they are given in the input.

Two consecutive cases should be separated by a single blank line. No blank line should be produced after the last test case.

Sample Input

2

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

10 16
2 6
3 7
6 5
5 9
5 4
1 2
9 8
6 4
2 10
3 8
7 9
1 4
2 4
10 5
1 6
6 10

Sample Output

2
3 7

1
4 

解法就是比较普通的强连通分量

不过要注意没有关键边的情况

我的代码：

#pragma warning(disable:4786) #include<stdio.h> #include<algorithm> #include<vector> #include<string.h> #include<iostream> #include<map> #define maxn 10005 using namespace std; struct node { int u; int v; }; int n,m,cnt; map<pair<int,int>,int>my; bool used[maxn]; vector<int>g[maxn]; vector<node>out; int col[maxn],low[maxn],dfn[maxn]; int Index=0,ans=0; void init() { int i; for(i=0;i<=n;i++) g[i].clear(); my.clear(),out.clear(); memset(used,0,sizeof(used)); memset(col,0,sizeof(col)); memset(low,0,sizeof(low)); memset(dfn,0,sizeof(dfn)); Index=0,cnt=0,ans=0; } int min(int a,int b) { if(a>b) return b; else return a; } void tarjan(int u,int v) { int i; bool flag=true; col[u]=1; Index++; dfn[u]=Index; low[u]=Index; for(i=0;i<g[u].size();i++) { if(flag&&g[u][i]==v) { flag=false; continue; } if(col[g[u][i]]==0) tarjan(g[u][i],u); low[u]=min(low[u],low[g[u][i]]); if(low[g[u][i]]>dfn[u]) { if(my[make_pair(g[u][i],u)]==-1) continue; else { node p; p.u=g[u][i]; p.v=u; out.push_back(p); } } } col[u]=2; } int main() { int t,i; int a,b; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); init(); for(i=1;i<=m;i++) { scanf("%d%d",&a,&b); if(!my[make_pair(a,b)]) { my[make_pair(a,b)]=i; my[make_pair(b,a)]=i; g[a].push_back(b); g[b].push_back(a); } else { my[make_pair(a,b)]=-1; my[make_pair(b,a)]=-1; } } tarjan(1,-1); printf("%d\n",out.size()); if(out.size()==0) { printf("\n"); continue; } int output[maxn]; for(i=0;i<out.size();i++) { a=out[i].u; b=out[i].v; output[i]=my[make_pair(a,b)]; } sort(output,output+out.size()); for(i=0;i<out.size()-1;i++) { printf("%d ",output[i]); } printf("%d\n",output[out.size()-1]); if(t) printf("\n"); } return 0; }