传送门1
传送门2
写在前面:本来就想做个每日任务打个卡,结果差点被毒死
思路:读明白题意了就是水题,子图中不必是个联通的,用并查集维护一下连通性,每次读入x,y如果在同一集合那么就会形成一个环,这个环可以加入之前全部的子图中从而使数目加倍,所以ans*2即可,如果不在同一集合那么光合并就行
注意:读优的C++在codevs评测比pascal快一倍,在tyvj就一直T,所以tyvj提交的时候建议做两件事
1.交pascal程序
2.给差评
C++ code
#include"cstdio"
#include"iostream"
#include"cstring"
using namespace std;
#define mod 1000000009
int p,q,x,y,n,m,ans=1;
int father[200010];
inline int find(int x)
{
if (father[x]!=x) father[x]=find(father[x]);
return father[x];
}
inline int in()
{
int f=1,t=0;
char ch=getchar();
while (ch>'9'||ch<'0')
{
if (ch=='-') f=-1;
ch=getchar();
}
while (ch>='0'&&ch<='9') t=t*10+ch-'0',ch=getchar();
return f*t;
}
main()
{
n=in();m=in();
for (int i=1;i<=n;i++) father[i]=i;
for (int i=1;i<=m;i++)
{
x=in();
y=in();
p=find(x);
q=find(y);
if (p!=q) father[p]=q;
else ans=(ans<<1);
if (ans>mod) ans-=mod;
printf("%d\n",ans-1);
}
}
pascal code
var
i,p,q,x,y,n,m,ans,t:longint;
father:array [1..200010]of longint;
function find(x:longint):longint;
begin
if (father[x]<>x) then father[x]:=find(father[x]);
exit(father[x]);
end;
begin
read(n,m);
t:=1000000009;
ans:=1;
for i:=1 to n do father[i]:=i;
for i:=1 to m do
begin
read(x,y);
p:=find(x);
q:=find(y);
if (p<>q) then father[p]:=q
else ans:=ans*2;
if (ans>t) then ans:=ans-t;
writeln(ans-1);
end;
end.