PKU1144 network

       本题考查的是寻找割点（也叫挂接点），运用DFS执行。

       每个节点我们除了需要用d来记录它的时间戳，还需要low来记录它及其后裔中最浅的反向边指向。对于一个图的割点，我们能发现如下充要条件：

（1）若u为图G搜索树的根，当且仅当u在这棵搜索树中有至少两个儿子。

（2） 若u为图G搜索树的非根结点，当且仅当u有一个子节点v，使其不存在从v或v的后裔中指向u的真祖先的反向边。

program network; const root=1; maxn=101; type pointer=^node; node=record next:pointer; data:longint; end; var edge:array[0..maxn] of pointer; vis:array[0..maxn] of longint; cut:array[0..maxn] of boolean; d,low:array[0..maxn] of longint; n,ans,time:longint; function getmin(a,b:longint):longint; begin if a<b then exit(a); exit(b); end; procedure prework; var i:longint; begin ans:=0; time:=0; fillchar(vis,sizeof(vis),0); fillchar(cut,sizeof(cut),0); for i:=0 to maxn do edge[i]:=nil; end; procedure link(a,b:longint); var p:pointer; begin new(p); p^.data:=b; p^.next:=edge[a]; edge[a]:=p; end; procedure init; var u,v:longint; begin read(u); while u<>0 do begin while not eoln do begin read(v); link(u,v); link(v,u); end; read(u); end; end; procedure dfs(father,u:longint); var tot,v:longint; p:pointer; begin inc(vis[u]); tot:=0; inc(time); d[u]:=time; low[u]:=time; p:=edge[u]; while p<>nil do begin v:=p^.data; if (vis[v]=1) and (v<>father) then low[u]:=getmin(low[u],d[v]); if (vis[v]=0) then begin dfs(u,v); inc(tot); low[u]:=getmin(low[u],low[v]); if (u=root) and (tot>1) then cut[u]:=true else if (u<>root) and (low[v]>=d[u]) then cut[u]:=true; end; p:=p^.next; end; inc(vis[u]); end; procedure outit; var i:longint; begin for i:=1 to n do if cut[i] then inc(ans); writeln(ans); end; procedure bigmain; begin readln(n); while n<>0 do begin prework; init; dfs(0,root); outit; readln(n); end; end; begin assign(input,'a.in'); reset(input); assign(output,'a.out'); rewrite(output); bigmain; close(input); close(output); end.