Cycle HDU - 5215(判环，等学了tarjan，再回来补思路)

Cycle HDU - 5215

题意：

要你判断是奇数环，还是偶数环。

思路：

传送门
tajan学习地址

AC

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#define For(i,x,y) for(int i=(x); i<=(y); i++)
#define fzhead EDGE(int _v, int _next)
#define fzbody v(_v), next(_next)
#define mst(x,a) memset(x,a,sizeof(x))
#pragma comment(linker,"/STACK:102400000,102400000")
using namespace std;
const int maxn=1e5+10;
int n,m,dfs_clock;
int head[maxn];
int tot,odd,even;
struct EDGE{
    int v,next;
    EDGE(){}
    fzhead:fzbody{}
}e[maxn*6];
int in[maxn];
int fa[maxn];
int pre[maxn],low[maxn],vis[maxn],dfn[maxn];
int bcc_cnt;
int bridge[maxn*6];
int dep[maxn];
stack<int> s;
void init(){
    tot=dfs_clock=bcc_cnt=0;
    mst(head,-1);
    mst(dfn,0);
    mst(pre,0);
    mst(vis,0);
    mst(bridge,0);
    mst(in,0);
    while(!s.empty())s.pop();
}
void add_edge(int u, int v){
    e[tot]=EDGE(v,head[u]);
    head[u]=tot++;
}
void tarjan(int u, int f){
    vis[u]=1;
    dfn[u]=low[u]=++dfs_clock;
    s.push(u);
    for(int i=head[u]; i!=-1; i=e[i].next){
        int v=e[i].v;
        if(!dfn[v]){
            pre[v]=(i^1);
            tarjan(v,u);
            low[u]=min(low[u],low[v]);
        }else if(v!=f&&dfn[v]<dfn[u])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;
        do{
            j=s.top();s.pop();
        }while(j!=u);
    }
}
int sum;
void dfs(int u, int deep){
    vis[u]=1;
    dep[u]=deep;in[u]=1;
    for(int i=head[u]; i!=-1; i=e[i].next){
        if(bridge[i])continue;
        int v=e[i].v;
        if(!vis[v]){
            fa[v]=u;
            dfs(v,deep+1);
        }else if(in[v]&&v!=fa[u]){
            int len=deep-dep[v]+1;
            if(len&1){
                odd=1;
                sum++;
                if(sum>1)even=1;
            }else even=1;
        }
    }
    in[u]=0;
}
void ans(int a){
    if(a)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
}
int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int tt,u,v;cin>>tt;
    while(tt--){
        cin>>n>>m;
        init();tot=2;
        odd=even=0;
        For(i,1,m){
            cin>>u>>v;
            add_edge(u,v);
            add_edge(v,u);
        }
        For(i,1,n)if(!pre[i])tarjan(i,0);
        mst(vis,0);
        For(i,1,n){
            if(!vis[i]){
                sum=0;
                fa[i]=0;
                dfs(i,1);
            }
        }
        ans(odd);
        ans(even);
    }
    return 0;
}