pku2186 popular cows

         期末考试刚刚结束，这也意味着我今年的Noip之旅开始了。

         今天复习了一下强连通分量。这道popular cows是非常经典的强连通分量题目。这个求强连通分量在去年的Noip也是用得上的，可惜我悲剧了。这道题的思路是先缩圈，再找出度为零的点，按要求输出答案。

         对于强连通分量这个东西，经典题目是不少的，比如还可以用floyd的school net等等。这道题我用的是kosaraju。虽然复杂度比如tarjan但是也不差，应该说我更喜欢它的简单方便。

program popular_cows; type rec=record u,v:longint; end; var g:array[0..60000] of rec; f,order,sum,fill:array[0..60000] of longint; vis:array[0..60000] of boolean; counta,countb,i,a,b,n,m,time,color:longint; procedure qsorta(s,t:longint); var l,r,key:longint; tt:rec; begin l:=s; r:=t; key:=g[random(t-s+1)+s].u; while l<=r do begin while g[l].u<key do inc(l); while g[r].u>key do dec(r); if l<=r then begin tt:=g[l]; g[l]:=g[r]; g[r]:=tt; inc(l); dec(r); end; end; if s<r then qsorta(s,r); if l<t then qsorta(l,t); end; procedure qsortb(s,t:longint); var l,r,key:longint; tt:rec; begin l:=s; r:=t; key:=g[random(t-s+1)+s].v; while l<=r do begin while g[l].v<key do inc(l); while g[r].v>key do dec(r); if l<=r then begin tt:=g[l]; g[l]:=g[r]; g[r]:=tt; inc(l); dec(r); end; end; if s<r then qsortb(s,r); if l<t then qsortb(l,t); end; procedure forthdfs(x:longint); var i:longint; begin vis[x]:=true; for i:=f[x] to f[x+1]-1 do if not vis[g[i].v] then forthdfs(g[i].v); inc(time); order[time]:=x; end; procedure backdfs(x:longint); var i:longint; begin vis[x]:=true; for i:=f[x] to f[x+1]-1 do if not vis[g[i].u] then backdfs(g[i].u); inc(sum[color]); fill[x]:=color; end; procedure init; begin readln(n,m); for i:=1 to m do begin readln(a,b); g[i].u:=a; g[i].v:=b; end; end; procedure kosaraju; begin randomize; qsorta(1,m); fillchar(f,sizeof(f),0); f[n+1]:=m+1; for i:=m downto 1 do f[g[i].u]:=i; for i:=n downto 1 do if f[i]=0 then f[i]:=f[i+1]; fillchar(vis,sizeof(vis),0); time:=0; for i:=1 to n do if not vis[i] then forthdfs(i); qsortb(1,m); fillchar(f,sizeof(f),0); f[n+1]:=m+1; for i:=m downto 1 do f[g[i].v]:=i; for i:=n downto 1 do if f[i]=0 then f[i]:=f[i+1]; fillchar(vis,sizeof(vis),0); color:=0; for i:=time downto 1 do if not vis[order[i]] then begin inc(color); sum[color]:=0; backdfs(order[i]); end; end; procedure findout; begin fillchar(vis,sizeof(vis),1); counta:=color; countb:=(1+color)*color div 2; for i:=1 to m do if (fill[g[i].u]<>fill[g[i].v]) and vis[fill[g[i].u]] then begin dec(counta); dec(countb,fill[g[i].u]); vis[fill[g[i].u]]:=false; end; if counta<>1 then writeln(0) else writeln(sum[countb]); end; begin assign(input,'a.in'); reset(input); assign(output,'a.out'); rewrite(output); init; kosaraju; findout; close(input); close(output); end.