poj--1470--tarjan算法

来源：互联网发布：常州小河淘宝客服招聘编辑：程序博客网时间：2024/05/17 07:21
模板留着
#include<iostream>#include<cstring>#include<cstdio>#include<vector>#define maxn 10020using namespace std;vector<int> g[maxn];    //treevector<int> q[maxn];    //queryint n,m;int x,y;bool vis[maxn];int root;int f[maxn];int ant[maxn];int ans[maxn];bool init(){    char c;    int nc;    if(scanf("%d",&n)!=EOF)    {        for(int i=1;i<=n;i++)        {            g[i].clear();            q[i].clear();        }        memset(vis,0,sizeof(vis));        for(int i=1;i<=n;i++)        {            scanf("%d",&x);            while(c=getchar()!='(');            scanf("%d",&nc);            while(c=getchar()!=')');            for(int i=0;i<nc;i++)            {                scanf("%d",&y);                g[x].push_back(y);                vis[y]=1;            }        }        scanf("%d",&m);        for(int i=0;i<m;i++)        {            scanf(" (%d%d) ",&x,&y);            q[x].push_back(y);            q[y].push_back(x);        }        for(int i=1;i<=n;i++)        {            if(!vis[i])            {                root=i;                break;            }        }        memset(vis,0,sizeof(vis));        return true;    }    return false;}int find(int u){return f[u]==u?u:f[u]=find(f[u]);}void tarjan(int u){    int v;    f[u]=u;    ant[u]=u;    for(int i=0;i<g[u].size();i++)    {        v=g[u][i];        tarjan(v);        f[v]=u;        ant[find(u)]=u;    }    vis[u]=1;    for(int i=0;i<q[u].size();i++)    {        v=q[u][i];        if(vis[v])        {            ans[ant[find(v)]]++;        }    }}void solve(){    memset(vis,0,sizeof(vis));    memset(ans,0,sizeof(ans));    memset(f,-1,sizeof(f));    tarjan(root);    for(int i=1;i<=n;i++)    {        if(ans[i])        {            printf("%d:%d\n",i,ans[i]);        }    }}int main(){    freopen("1470.txt","r",stdin);    while(init())    solve();    return 0;}