#include #include #include using namespace std; using i64 = long long; using u64 = unsigned long long; using i32 = int; using u32 = unsigned int; #define rep(i,n) for(int i=0; i<(n); i++) vector> SCC(const vector>& E) { int n = E.size(); vector F(n, 0), St, I, perm, g; vector> R(n), G, res; rep(i, n) if (F[i] == 0) { St.push_back(i); while (St.size()) { int p = St.back(); St.pop_back(); if (p < 0) { I.push_back(-1 - p); continue; } if (F[p]) continue; F[p] = -1; St.push_back(-1 - p); for (int e : E[p]) St.push_back(e); } } rep(i, n) for (int e : E[i]) R[e].push_back(i); reverse(I.begin(), I.end()); for (int s : I) if (F[s] == -1) { g = { s }; F[s] = G.size(); rep(i, g.size()) { int p = g[i]; for (int e : R[p]) if (F[e] == -1) { F[e] = G.size(); g.push_back(e); } } G.emplace_back(move(g)); } I.assign(G.size(), 0); rep(i, n) for (int e : E[i]) if (F[i] != F[e]) I[F[e]]++; rep(i, G.size()) if (I[i] == 0) perm.push_back(i); rep(i, perm.size()) for (int p : G[i]) { for (int e : E[p]) if (--I[F[e]] == 0) perm.push_back(F[e]); } for (auto p : perm) res.emplace_back(move(G[p])); return res; } int main() { int N; cin >> N; int M; cin >> M; vector> E(N); rep(i,M){ int u,v; cin >> u >> v; u--; v--; E[u].push_back(v); } auto SCs = SCC(E); vector SCid(N, -1); rep(i,SCs.size()) for(int p : SCs[i]) SCid[p] = i; int nsc = SCs.size(); vector typesc(nsc, 0); rep(u,N) for(int v : E[u]) if(SCid[u] != SCid[v]){ typesc[u] |= 1; typesc[v] |= 2; } if(nsc == 1){ cout << "0\n"; return 0; } int typecnt[4] = {}; for(int t : typesc) typecnt[t]++; int ans = max(typecnt[0] + typecnt[1], typecnt[0] + typecnt[2]); cout << ans << endl; return 0; } struct ios_do_not_sync{ ios_do_not_sync(){ std::ios::sync_with_stdio(false); std::cin.tie(nullptr); } } ios_do_not_sync_instance;