草地鉴赏家(Grass Cownoisseur G) 题解

思路分析

按题目要求使用对应数据结构与算法模拟/递推求解，注意数据范围边界与时间复杂度。

参考代码

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    if (!(cin >> n >> m)) return 0;
    vector<vector<int>> adj(n + 1);
    vector<pair<int, int>> edges(m);
    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        edges[i] = {u, v};
    }
    vector<int> dfn(n + 1, 0), low(n + 1, 0), in_stk(n + 1, 0), scc(n + 1, 0), sz_scc(n + 1, 0);
    vector<int> stk, call_u, call_idx;
    int timer = 0, scc_cnt = 0;
    for (int i = 1; i <= n; ++i) {
        if (!dfn[i]) {
            call_u.push_back(i);
            call_idx.push_back(0);
            dfn[i] = low[i] = ++timer;
            stk.push_back(i);
            in_stk[i] = 1;
            while (!call_u.empty()) {
                int u = call_u.back();
                int& idx = call_idx.back();
                if (idx < (int)adj[u].size()) {
                    int v = adj[u][idx++];
                    if (!dfn[v]) {
                        dfn[v] = low[v] = ++timer;
                        stk.push_back(v);
                        in_stk[v] = 1;
                        call_u.push_back(v);
                        call_idx.push_back(0);
                    } else if (in_stk[v]) {
                        low[u] = min(low[u], dfn[v]);
                    }
                } else {
                    if (low[u] == dfn[u]) {
                        ++scc_cnt;
                        while (true) {
                            int x = stk.back();
                            stk.pop_back();
                            in_stk[x] = 0;
                            scc[x] = scc_cnt;
                            sz_scc[scc_cnt]++;
                            if (x == u) break;
                        }
                    }
                    call_u.pop_back();
                    call_idx.pop_back();
                    if (!call_u.empty()) {
                        low[call_u.back()] = min(low[call_u.back()], low[u]);
                    }
                }
            }
        }
    }
    vector<vector<int>> dag(scc_cnt + 1), rdag(scc_cnt + 1);
    for (auto& e : edges) {
        int u = scc[e.first], v = scc[e.second];
        if (u != v) {
            dag[u].push_back(v);
            rdag[v].push_back(u);
        }
    }
    int c1 = scc[1];
    vector<int> dp1(scc_cnt + 1, -1), dp2(scc_cnt + 1, -1);
    dp1[c1] = sz_scc[c1];
    dp2[c1] = sz_scc[c1];
    // Topological order is scc_cnt down to 1
    for (int u = c1; u >= 1; --u) {
        if (dp1[u] < 0) continue;
        for (int v : dag[u]) {
            dp1[v] = max(dp1[v], dp1[u] + sz_scc[v]);
        }
    }
    for (int u = c1; u <= scc_cnt; ++u) {
        if (dp2[u] < 0) continue;
        for (int v : rdag[u]) {
            dp2[v] = max(dp2[v], dp2[u] + sz_scc[v]);
        }
    }
    int ans = sz_scc[c1];
    for (auto& e : edges) {
        int u = scc[e.first], v = scc[e.second];
        if (dp1[v] > 0 && dp2[u] > 0) {
            ans = max(ans, dp1[v] + dp2[u] - sz_scc[c1]);
        }
    }
    cout << ans << "\n";
    return 0;
}