题意:询问一个图中有多少个环与链。
其实跑一遍DFS+vis标记就行了,随手打上并查集。。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=200010;
const int mod=1000000007;
long long tot,ans=1;
int fa[N],sz[N],sum[N],n,m;
bool vis[N];
inline int find(int x){
return fa[x]==x?x:fa[x]=find(fa[x]);
}
inline void unionn(int x,int y){
register int fx=find(x),fy=find(y);
if(fx!=fy)fa[fx]=fy,sz[fy]+=sz[fx],sum[fy]+=sum[fx];
else ++sum[fx];
}
inline void read(int &res){
static char ch;int flag=1;
while((ch=getchar())<'0'||ch>'9')if(ch=='-')flag=-1;res=ch-48;
while((ch=getchar())>='0'&&ch<='9')res=res*10+ch-48;res*=flag;
}
int main(){
freopen("school.in","r",stdin);
freopen("school.out","w",stdout);
read(n),read(m);
for(register int i=1;i<=n;i++)fa[i]=i,sz[i]=1;
for(register int x,y,i=1;i<=m;i++)
read(x),read(y),unionn(x,y);
for(register int i=1;i<=n;i++){
int fx=find(i);
if(!vis[fx]){
vis[fx]=1;
if(sum[fx]==0)ans=(ans*sz[fx])%mod;//Á´
else if(sum[fx]==1)ans=(ans*2)%mod;//×Գɻ·
else ans=0;//Êý¾ÝÕæµÄºÏ·¨£¿
}
}
cout<<ans<<endl;
return 0;
}