Critical Links UVA - 796
题意&&思路:
就是求桥。
反思:
对于(%d)。可以先scanf("%s")。
之后sscanf(s,"(%d)", &tmp)(字符串输入函数)
对于桥的理解。
可以用一个pre去存储边的编号。
假如当前结点 u是一个强联通的祖先,那么该结点u的前驱(即边就是一个桥)。(tot设置为2,是为了防止根是强联通祖先的情况)
AC
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <vector>
#define For(i,x,y) for(int i=(x); i<=(y); i++)
#define mst(x,a) memset(x,a,sizeof(x))
#define fzhead EDGE(int _from,int _to, int _next)
#define fzbody from(_from),to(_to), next(_next)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#pragma comment(linker,"/STACK:102400000,102400000")
using namespace std;
const int maxn=505;
typedef pair<int,int>pa;
struct EDGE{
int from,to,next;
EDGE(){}
fzhead:fzbody{}
}e[maxn*maxn];
int head[maxn],vis[maxn],pre[maxn],low[maxn],dfn[maxn];
int bridge[maxn*maxn];
int tot,bcc_cnt,dfs_clock;
int n;
stack<int>s;
void init(){
bcc_cnt=tot=dfs_clock=0;
mst(head,-1);
mst(vis,0);
mst(pre,0);
mst(low,0);
mst(dfn,0);
mst(bridge,0);
while(!s.empty())s.pop();
}
void add(int bg, int to){
e[tot]=EDGE(bg,to,head[bg]);
head[bg]=tot++;
}
void tarjan(int u, int f){
vis[u]=1;
low[u]=dfn[u]=++dfs_clock;
s.push(u);
for(int i=head[u]; i!=-1; i=e[i].next){
int v=e[i].to;
if(!dfn[v]){
pre[v]=i^1;
tarjan(v,u);
low[u]=min(low[u],low[v]);
}else if(v!=f&&dfn[u]>dfn[v])low[u]=min(low[u],dfn[v]);
}
if(dfn[u]==low[u]){
bcc_cnt++;
int j;
bridge[pre[u]]=1;
bridge[pre[u]^1]=1;
///left stack is......
}
}
int main()
{
//ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
while(~scanf("%d", &n)){//cin>>n,n){
vector<pa>ans;
int u,v,num;
init();tot=2;
For(i,0,n-1){
scanf("%d", &u);//cin>>u;
char s[1000];
scanf("%s",s);
sscanf(s,"(%d)", &num);//cout<<"num------"<<num<<endl;
For(j,1,num)scanf("%d", &v),add(u,v),add(v,u);//cout<<"v-----"<<v<<endl;
}
For(i,0,n-1)if(!dfn[i])dfs_clock=0,tarjan(i,-1);
For(u,0,n-1){
for(int i=head[u]; i!=-1; i=e[i].next){
if(bridge[i]){
int a=e[i].from,b=e[i].to;
if(a>b)swap(a,b);
ans.push_back(mp(a,b));
bridge[i]=bridge[i^1]=0;
}
}
}
sort(ans.begin(),ans.end());
cout<<ans.size()<<" critical links"<<endl;
pa x;
for(auto x:ans)cout<<x.fi<<" - "<<x.se<<endl;
cout<<endl;
}
return 0;
}
/*
3 critical links
0 - 1
*/