-
Notifications
You must be signed in to change notification settings - Fork 0
/
loj1063.cpp
88 lines (70 loc) · 2.21 KB
/
loj1063.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
using namespace std;
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#define min(a,b) ((a<b)?(a):(b))
vector<int>graph[10000+10];
int back[10000+10],discovery[10000+10],cnt,seq;//,child[10000+10];
bool visited[10000+10],art_point[10000+10];
void dfs(int u)
{
//cout<<u<<endl;
int child=0;
visited[u]=true;
back[u]=discovery[u]=++seq;
//seq++;
for(int i=0;i<graph[u].size();i++)
{
int v = graph[u][i];
if(visited[v]==false)
{
dfs(v);
child++;
if(discovery[u]==1&&child>=2)
art_point[1]=true;//cnt++;
else
{
if(back[v]<discovery[u])
back[u]=min(back[u],back[v]);
if(discovery[u]>1&&back[v]>=discovery[u])
{
art_point[u]=true;//cnt++;
//cout<<back[v]<<" "<<discovery[u]<<" u: "<<u<<" v: "<<v<<endl;
}
}
}
else
back[u]=min(discovery[v],back[u]);
}
}
int main()
{
int t,n,m,i,u,v,Case=1;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(i=0;i<=n;i++)
{
art_point[i]=visited[i]=false;
graph[i].clear();
//child[i]=0;
}
while(m--)
{
scanf("%d%d",&u,&v);
graph[u].push_back(v);
graph[v].push_back(u);
}
seq=cnt=0;
dfs(1);
for(i=1;i<=n;i++){
if(art_point[i])
cnt++;
// cout<<art_point[i]<<endl;
}
printf("Case %d: %d\n",Case++,cnt);
}
return 0;
}