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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
#include <stdio.h>
#include <string.h>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
int n,m, head[105],head1[105], cnt,cnt1, sccnum,t, low[105], timestamp[105], belong[105], indeg[105],outdeg[105];
vector<int> scc[105];
stack<int> s;
bool ins[105];
struct Arc
{
int from, to, nxt;
}g[10005],g1[10005];
void addArc(int a, int b)
{
g[cnt].from = a, g[cnt].to = b, g[cnt].nxt = head[a];
head[a] = cnt++;
}
void dfs(int i)
{
timestamp[i] = low[i] = ++t;
s.push(i), ins[i] = true;
for (int h = head[i],to; ~h; h = g[h].nxt)
{
to = g[h].to;
if (!timestamp[to])
{
dfs(to);
low[i] = min(low[i], low[to]);
}
else if (ins[to])
{
low[i] = min(low[i], low[to]);
}
}
if (timestamp[i] ==low[i])
{
sccnum++;
int j;
do
{
j = s.top(),s.pop(), ins[j] = false;
scc[sccnum].push_back(j), belong[j] = sccnum;
} while (j!=i);
}
}
void tarjan()
{
for (int i = 1; i<=n; i++)
{
if (!timestamp[i])
{
dfs(i);
}
}
}
void addArc1(int from, int to)
{
g1[cnt1].from = from, g1[cnt1].to = to, g1[cnt1].nxt = head1[from];
head1[from] = cnt1++;
}
void rebuild()
{
for (int i = 0, from, to; i<cnt; i++)
{
from = belong[g[i].from], to = belong[g[i].to];
if (from!=to)
{
addArc1(from, to);
indeg[to]++;
outdeg[from]++;
}
}
}
int main() {
#ifdef LOCAL
freopen("d:\\data.in", "r", stdin);
#endif
scanf("%d", &n);
memset(head, -1, sizeof(head));
memset(head1, -1, sizeof(head));
for(int i = 1,a; i<=n; i++)
{
while(scanf("%d", &a),a)
{
addArc(i,a);
}
}
tarjan();
if (sccnum==1)
{
puts("1\n0");
return 0;
}
rebuild();
int ans1 = 0, ans2 = 0;
for (int i = 1; i<=sccnum;i++)
{
if (!indeg[i])
{
ans1++;
}
if (!outdeg[i])
{
ans2++;
}
}
printf("%d\n%d\n", ans1, max(ans1, ans2));
return 0;
}
|