其实判奇偶环应该可以用带权并查集 不是很清楚 没有写过
二分图无奇环 非二分图必有奇环
偶环么 要是两个奇环有公共点必然可以变成一个偶环 那么在dfs树上打标记 看一个点被几个奇环包含
标记先差分再向上传递 老套路了
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#pragma comment(linker, "/STACK:102400000,102400000")
#define cl(x) memset(x,0,sizeof(x))
using namespace std;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(int &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
const int N=100005;
const int M=300005;
struct edge{
int u,v,next;
}G[M<<1];
int head[N],inum=1;
inline void add(int u,int v,int p){
G[p].u=u; G[p].v=v; G[p].next=head[u]; head[u]=p;
}
int tag[N],fat[N],clr[N],depth[N];
int Odd,Even;
#define V G[p].v
inline void dfs(int u,int fa){
for (int p=head[u];p;p=G[p].next)
if (p!=(fa^1)){
if (clr[V]==-1)
depth[V]=depth[u]+1,fat[V]=u,clr[V]=clr[u]^1,dfs(V,p),tag[u]+=tag[V];
else if (depth[V]<depth[u]){
if (clr[u]==clr[V])
tag[u]++,tag[fat[V]]--,Odd=1;
else
Even=1;
}
}
if (tag[u]>1)
Even=1;
}
int n,m;
int main(){
int Q,iu,iv;
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
read(Q);
while (Q--){
read(n); read(m);
for (int i=1;i<=m;i++)
read(iu),read(iv),add(iu,iv,++inum),add(iv,iu,++inum);
for (int i=1;i<=n;i++) clr[i]=-1,tag[i]=0;
for (int i=1;i<=n;i++)
if (clr[i]==-1)
clr[i]=0,dfs(i,0);
printf("%s\n",Odd?"YES":"NO");
printf("%s\n",Even?"YES":"NO");
for (int i=1;i<=n;i++) head[i]=0; inum=1;
Odd=Even=0;
}
return 0;
}