-
Notifications
You must be signed in to change notification settings - Fork 11
/
Copy path1026 - Critical Links.cpp
110 lines (101 loc) · 2.2 KB
/
1026 - Critical Links.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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define vi vector<int>
#define vii vector < pii >
#define ll long long int
#define si set<int>
#define pb push_back
#define se second
#define fr first
#define mp make_pair
#define ll long long int
#define MOD 1e9+7
#define pb push_back
#define mp make_pair
#define vi vector <int>
const int MAX=1e4+5;
vi adj[MAX];
bool vis[MAX];
int disc[MAX];
int low[MAX];
int color[MAX];
int parent[MAX];
int col=0;
vector < pair < int,int > > ans;
void bridge (int u)
{
static int time=0;
vis[u] = true;
disc[u] = low[u] = ++time;
for (int i=0;i<adj[u].size();i++){
int v=adj[u][i];
if (!vis[v]){
parent[v]=u;
bridge(v);
low[u] = min(low[u],low[v]);
if (low[v] > disc[u]){
ans.pb(mp(min(u,v),max(u,v)));
//cout<<u<<" "<<v<<endl;
}
}
else if (v!=parent[u])
low[u]=min(low[u],disc[v]);
}
}
void func(int n)
{
for (int i=0;i<n;i++){
parent[i] = 0;
vis[i] = false;
}
for (int i=0;i<n;i++){
if (!vis[i])
bridge(i);
}
}
void clea()
{
col=0;
ans.clear();
for (int i=0;i<MAX;i++){
adj[i].clear();
vis[i]=false;
disc[i]=low[i]=color[i]=parent[i]=0;
}
}
int nn;
int main ()
{
//freopen("input.txt","r",stdin);
//ios_base::sync_with_stdio(false);
int t;
scanf("%d",&t);
int cas=1;
while(t--){
clea();
printf("Case %d:\n",cas++);
scanf("%d",&nn);
for (int i=0;i<nn;i++){
int u;
scanf("%d",&u);
char ss[10010];
scanf("%s",ss);
int kk=0;
for (int i=1;i<strlen(ss)-1;i++)
kk=kk*10+(ss[i]-'0');
//cout<<u<<" "<<kk<<endl;
for (int j=0;j<kk;j++){
int foo;
scanf("%d",&foo);
adj[u].pb(foo);
}
}
func(nn);
printf("%d critical links\n",ans.size());
sort(ans.begin(),ans.end());
for (int i=0;i<ans.size();i++)
printf("%d - %d\n",ans[i].fr,ans[i].se);
}
return 0;
}