题意:给出n个节点m条边的有向图,要求添加尽量少的边,使得新图强连通。
分析:求出所有强连通分量缩点后,再求出所有入度出度为0的点的个数,输出其最大值即可,注意强连通分量个数为1时输出0。
#include <cstdio>
#include <stack>
#include <queue>
#include <vector>
#include <cstdio>
#include <utility>
#include <cstring>
#include <iostream>
#include <algorithm>
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define MAXN 20010
#define MAXM 50000
using namespace std;
int T,n,m,scc_cnt,sccno[MAXN],rd[MAXN],cd[MAXN];
vector<int> G[MAXN],G2[MAXN],S;
bool vis[MAXN];
void dfs1(int u)
{
if(vis[u]) return;
vis[u] = true;
for(int v : G[u]) dfs1(v);
S.push_back(u);
}
void dfs2(int u)
{
if(sccno[u]) return;
sccno[u] = scc_cnt;
for(int v : G2[u]) dfs2(v);
}
int main()
{
scanf("%d",&T);
while(T--)
{
memset(rd,0,sizeof(rd));
memset(cd,0,sizeof(cd));
memset(sccno,0,sizeof(sccno));
memset(vis,0,sizeof(vis));
scc_cnt = 0;
S.clear();
scanf("%d%d",&n,&m);
for(int i = 1;i <= n;i++)
{
G[i].clear();
G2[i].clear();
}
for(int i = 1;i <= m;i++)
{
int x,y;
scanf("%d%d",&x,&y);
G[x].push_back(y);
G2[y].push_back(x);
}
for(int i = 1;i <= n;i++) dfs1(i);
for(int i = n-1;i >= 0;i--)
if(!sccno[S[i]])
{
scc_cnt++;
dfs2(S[i]);
}
for(int u = 1;u <= n;u++)
for(int v : G[u])
if(sccno[u] != sccno[v])
{
rd[sccno[v]]++;
cd[sccno[u]]++;
}
int ans1 = 0,ans2 = 0;
for(int i = 1;i <= scc_cnt;i++)
{
if(rd[i] == 0) ans1++;
if(cd[i] == 0) ans2++;
}
if(scc_cnt == 1) cout<<0<<endl;
else cout<<max(ans1,ans2)<<endl;
}
}