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
| #include <iostream>
#include <cstdio>
#include <stack>
using namespace std;
const int N = 1e4 + 10, M = 5e6 + 10;
bool vis[N];
int n, din[N], dout[N];
int idx = -1, hd[N], nxt[M], edg[M];
int cnt, timestamp, id[N], dfn[N], low[N];
stack <int> stk;
void tarjan(int x)
{
dfn[x] = low[x] = ++timestamp;
stk.push(x);
vis[x] = true;
for (int i = hd[x]; ~i; i = nxt[i])
if (!dfn[edg[i]])
{
tarjan(edg[i]);
low[x] = min(low[x], low[edg[i]]);
}
else if (vis[edg[i]])
low[x] = min(low[x], dfn[edg[i]]);
if (dfn[x] == low[x])
{
cnt++;
int y;
do
{
y = stk.top();
stk.pop();
vis[y] = false;
id[y] = cnt;
} while (y != x);
}
}
void add(int x, int y)
{
nxt[++idx] = hd[x];
hd[x] = idx;
edg[idx] = y;
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
hd[i] = -1;
for (int i = 1, a; i <= n; i++)
while (cin >> a, a)
add(i, a);
for (int i = 1; i <= n; i++)
if (!dfn[i])
tarjan(i);
for (int i = 1; i <= n; i++)
for (int j = hd[i]; ~j; j = nxt[j])
if (id[i] != id[edg[j]])
{
dout[id[i]]++;
din[id[edg[j]]]++;
}
int x = 0, y = 0;
for (int i = 1; i <= cnt; i++)
{
if (!din[i])
x++;
if (!dout[i])
y++;
}
cout << x << endl;
if (cnt == 1)
cout << 0;
else
cout << max(x, y);
return 0;
}
|