题目一:对于环的存在,只要换上的一个学校获得软件,那么整个环都会获得软件,可以使用tarjan对连通分量进行缩点,此时得到一个有向无环图,入度为0的点的数量就是答案。
题目二:设入度为0的点数量是a,出度为0的点数量是b,那么答案是max(a, b);
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define lowbit(x) (x&-x)
#define pf(a) printf("%d\n",a)
#define mem(x,y) memset(x,y,sizeof(x))
#define dbg(x) cout << #x << " = " << x << endl
#define rep(i,l,r) for(int i = l; i <= r; i++)
#define fep(i,a,b) for(int i=b; i>=a; --i)
#define PII pair<int,int>
//#define long long int
typedef long long ll;
const int N = 110, M = 10010;
int n, m;
int h[N], e[M], ne[M], p[N], idx;
int dfn[N], low[N], id[N], dout[N], din[N], cnt, Time;
vector<int> scc[N];
int stk[N], ins[N], top;
void add(int a, int b)
{
e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}
void tarjan(int x)
{
dfn[x] = low[x] = ++Time;
stk[++top] = x; ins[x] = 1;
for(int i = h[x]; ~i; i = ne[i]) {
int j = e[i];
if(!dfn[j]) {
tarjan(j);
low[x]= min(low[j], low[x]);
}
else if(ins[j]) {
low[x] = min(low[x], dfn[j]);
}
}
if(dfn[x] == low[x]) {
int y;
cnt++;
do{
y = stk[top--];
ins[y] = 0;
id[y] = cnt;
}while(x!=y);
}
}
int main()
{
mem(h,-1);
cin >> n;
rep(i,1,n) {
int u;
while(cin >> u, u) add(i,u);
}
rep(i,1,n) if(!dfn[i]) tarjan(i);
rep(i,1,n) {
for(int j = h[i]; ~j; j = ne[j]) {
int k = e[j];
int a = id[i], b = id[k];
if(a!=b) dout[a]++, din[b]++;
}
}
int src = 0, des = 0;
rep(i,1,cnt){
if(!din[i]) src++;
if(!dout[i]) des++;
}
pf(src);
if(cnt==1) puts("0");
else printf("%d",max(src,des));
return 0;
}