题目链接
题意:一个求的是需要给出几个信息才能传到所有的学校;另一个求的是需要再添加几组边使得所有的学校之间的信息可以相互传递,也就是还需呀加几组边使得这幅图变成强连通图。
思路:首先写在前面的,如果它已经是一幅强连通图的话,那么我们就不需要再加边了,需要特判(WA了好几次的说)。再者,考虑需要给出几个消息,不就是问的是缩点之后入度为0的点的个数吗;需要再添加几条边,就是考虑入度为0和出度为0的点的个数的最大值,我们对应连边即可。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 105;
int N, head[maxN], cnt, dfn[maxN], low[maxN], Index, Belong[maxN], Bcnt, Stap[maxN], Stop, indu[maxN], oudu[maxN];
bool inStack[maxN];
struct Eddge
{
int nex, to;
Eddge(int a=-1, int b=0, int c=0):nex(a), to(b) {}
}edge[maxN * maxN];
inline void addEddge(int u, int v)
{
edge[cnt] = Eddge(head[u], v);
head[u] = cnt++;
}
inline void Tarjan(int u)
{
dfn[u] = low[u] = ++Index;
Stap[++Stop] = u;
inStack[u] = true;
int v;
for(int i=head[u]; ~i; i=edge[i].nex)
{
v = edge[i].to;
if(!dfn[v])
{
Tarjan(v);
low[u] = min(low[u], low[v]);
}
else if(inStack[v] && dfn[v] < low[u]) low[u] = dfn[v];
}
if(dfn[u] == low[u])
{
Bcnt++;
do
{
v = Stap[Stop--];
inStack[v] = false;
Belong[v] = Bcnt;
}
while(u != v);
}
}
inline void init()
{
cnt = Index = Bcnt = Stop = 0;
memset(head, -1, sizeof(head));
memset(dfn, 0, sizeof(dfn));
for(int i=1; i<=N; i++) inStack[i] = false;
for(int i=1; i<=N; i++) indu[i] = oudu[i] = 0;
}
int main()
{
while(scanf("%d", &N) != EOF)
{
init();
for(int i=1, v; i<=N; i++)
{
while(scanf("%d", &v) && v)
{
addEddge(i, v);
}
}
for(int i=1; i<=N; i++) if(!dfn[i]) Tarjan(i);
for(int u=1, v; u<=N; u++)
{
for(int i=head[u]; ~i; i=edge[i].nex)
{
v = edge[i].to;
if(Belong[u] != Belong[v])
{
oudu[Belong[u]]++;
indu[Belong[v]]++;
}
}
}
if(Bcnt == 1)
{
printf("1\n0\n");
continue;
}
int ans1 = 0, ans2 = 0;
for(int i=1; i<=Bcnt; i++)
{
if(!indu[i]) ans1++;
if(!oudu[i]) ans2++;
}
printf("%d\n%d\n", ans1, max(ans1, ans2));
}
return 0;
}