HDU 3394

N 点击打开链接

#include<stdio.h>
#include<string.h>
#include<stack>
#include<string>
#include<math.h>
#include<queue>
#include<set>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
using namespace std;
#define LL long long
#define inf 199999999
#define N 10005
int low[N],dfn[N],num[N],b[N],belong[N];
vector<int>edge[N];
stack<int>s;
int cnt,n,m,Index,ans1,ans2,sum,flag;
bool vis[N],mark[N];
void init()
{
    memset(low,0,sizeof(low));
    memset(dfn,0,sizeof(dfn));
    memset(vis,0,sizeof(vis));
    memset(belong,0,sizeof(belong));
    for(int i=1;i<=n;i++) edge[i].clear();
    while(!s.empty()) s.pop();
    flag=Index=ans1=ans2=0;
}
void solve()
{
    int Nedge=0,v,i,u,j;
    for(i=1;i<=cnt;i++)
    {
        u=b[i];
        for(j=0;j<edge[u].size();j++)
        {
            v=edge[u][j];
            if(mark[v])
                Nedge++;
        }
    }
    Nedge/=2;
    if(Nedge>cnt) ans2+=Nedge;
    if(Nedge<cnt) ans1+=Nedge;
}
void tarjan(int u)
{
    low[u]=dfn[u]=++Index;
    vis[u]=1;s.push(u);
    int i,v,vv;
    for(i=0;i<edge[u].size();i++)
    {
        v=edge[u][i];
        if(!dfn[v])
        {
            tarjan(v);
            low[u]=min(low[u],low[v]);
            if(dfn[u]<=low[v])
            {
                cnt=0;
                memset(mark,0,sizeof(mark));
                do
                {
                    vv=s.top();s.pop();
                    vis[vv]=0;
                    b[++cnt]=vv;
                    mark[vv]=1;
                }while(vv!=v);
                b[++cnt]=u;mark[u]=1;
                solve();
            }
        }
        else if(vis[v])
            low[u]=min(low[u],dfn[v]);
    }
}
int main()
{
    int i,j,u,v;
    while(scanf("%d%d",&n,&m),n+m)
    {
        init();
        for(i=1;i<=m;i++)
        {
            scanf("%d%d",&u,&v);
            u++;v++;
            edge[u].push_back(v);
            edge[v].push_back(u);
        }
        for(i=1;i<=n;i++)
        {
            if(!dfn[i])
                tarjan(i);
        }
        printf("%d %d\n",ans1,ans2);
    }
}