hdu 2767 Proving Equivalences(求最少加几条边使图变为强连通图）

题目链接

思路：
先用tarjan缩点
然后说结论：
设in0为图中入度为0点的个数，out0为图中出度为0点的个数，最少需要加max(in0, out0)才能使图变为强连通图。当然，如果已经是强连通图的情况要特判一下。

个人的理解是这样的，因为强连通图每个点的入度和出度肯定是>=1的，所以目标就是让图中的每个点入度和出度都>=1就能变成强连通图, 而每次加边最多只能同时消灭一个入度为0和一个出度为0，所以最少加max(in0, out0)条边，图就能变成强连通图（如果已经是强连通图的情况要特判，因为此时不符合这个结论）。

#include <bits/stdc++.h>

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, a, b) for (int i = (int)(a); i >= (int)b; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, r, l) for (int i = (r); i >= (l); i--)
#define ms(x, y) memset(x, y, sizeof(x))
#define SZ(x) ((int)(x).size())

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;

template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }

const int maxn = 2*(int)1e4+100; //点数
int scc, top, tot;
vector<int> G[maxn];
int low[maxn], dfn[maxn], belong[maxn];
int stk[maxn], vis[maxn], in[maxn], out[maxn];
void init(int n) {
    for (int i = 1; i <= n; ++i) {
        G[i].clear();
        low[i] = 0;
        dfn[i] = 0;
        stk[i] = 0;
        vis[i] = 0;
        in[i] = 0;
        out[i] = 0;
    }
    scc = top = tot = 0;
}
void tarjan(int x) {
    stk[top++] = x;
    low[x] = dfn[x] = ++tot;
    vis[x] = 1;
    for (int to : G[x]) {
        if (!dfn[to]) {
            tarjan(to);
            low[x] = min(low[x], low[to]);
        } else if (vis[to]) {
            low[x] = min(low[x], dfn[to]);
        }
    }
    if (low[x] == dfn[x]) {
        ++scc;
        int temp;
        do {
            temp = stk[--top];
            belong[temp] = scc;
            vis[temp] = 0;
        } while (temp != x);
    }
}
int tc, n, m;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.precision(10);
    cout << fixed;
#ifdef LOCAL_DEFINE
    freopen("input.txt", "r", stdin);
#endif

    cin >> tc;
    while (tc--) {
        cin >> n >> m;
        init(n);
        forn(i, m) {
            int u, v;
            cin >> u >> v;
            G[u].eb(v);
        }
        for1(i, n) if (!dfn[i]) tarjan(i);
        if (scc == 1) cout << 0 << '\n';
        else {
            for (int i = 1; i <= n; ++i) {
                for (int j : G[i]) {
                    if (belong[i] == belong[j]) continue;
                    ++out[belong[i]];
                    ++in[belong[j]];
                }
            }
            int in0 = 0, out0 = 0;
            for1(i, scc) {
                if (!in[i]) ++in0;
                if (!out[i]) ++out0;
            }
            cout << max(in0, out0) << '\n';
        }
    }

#ifdef LOCAL_DEFINE
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
    return 0;
}