Description A Telephone Line Company (TLC) is establishing a new
telephone cable network. They are connecting several places numbered
by integers from 1 to N . No two places have the same number. The
lines are bidirectional and always connect together two places and in
each place the lines end in a telephone exchange. There is one
telephone exchange in each place. From each place it is possible to
reach through lines every other place, however it need not be a direct
connection, it can go through several exchanges. From time to time the
power supply fails at a place and then the exchange does not operate.
The officials from TLC realized that in such a case it can happen that
besides the fact that the place with the failure is unreachable, this
can also cause that some other places cannot connect to each other. In
such a case we will say the place (where the failure occured) is
critical. Now the officials are trying to write a program for finding
the number of all such critical places. Help them.Input
The input file consists of several blocks of lines. Each block
describes one network. In the first line of each block there is the
number of places N < 100. Each of the next at most N lines contains
the number of a place followed by the numbers of some places to which
there is a direct line from this place. These at most N lines
completely describe the network, i.e., each direct connection of two
places in the network is contained at least in one row. All numbers in
one line are separated by one space. Each block ends with a line
containing just 0. The last block has only one line with N = 0;
The output contains for each block except the last in the input
file one line containing the number of critical places.
tarjan求割点模板题。
不要忘记特殊判断dfs树根。
#include<cstdio>
#include<cstring>
#define M(a) memset(a,0,sizeof(a))
int fir[110],ne[30010],to[30010],dfn[110],low[110],n,m,ans,cnt;
bool b[110];
void init()
{
int i,j,k,x,y,z;
char c;
M(fir);
M(ne);
M(to);
M(dfn);
M(low);
M(b);
ans=cnt=m=0;
while (scanf("%d",&x)&&x)
{
while (scanf("%c",&c)&&c==' ')
{
scanf("%d",&y);
ne[++m]=fir[x];
fir[x]=m;
to[m]=y;
ne[++m]=fir[y];
fir[y]=m;
to[m]=x;
}
}
}
void dfs(int p)
{
int i,j,k,x,y,z,t=0;
dfn[p]=low[p]=++cnt;
for (i=fir[p];i;i=ne[i])
if (!dfn[to[i]])
{
t++;
dfs(to[i]);
if (low[to[i]]<low[p]) low[p]=low[to[i]];
if ((p==1&&t>=2)||(p!=1&&low[to[i]]>=dfn[p])) b[p]=1;
}
else
{
if (dfn[to[i]]<low[p]) low[p]=dfn[to[i]];
}
}
int main()
{
while (scanf("%d",&n)&&n)
{
init();
dfs(1);
for (int i=1;i<=n;i++)
if (b[i]) ans++;
printf("%d\n",ans);
}
}