Pagini recente » Cod sursa (job #2111303) | Cod sursa (job #914107) | Cod sursa (job #2873191) | Cod sursa (job #4655) | Cod sursa (job #2884204)
#include <bits/stdc++.h>
using namespace std;
#ifndef HOME
ifstream fin("ctc.in");
ofstream fout("ctc.out");
#else
ifstream fin("ciorna.in");
ofstream fout("ciorna.out");
#endif
const int N = 1e5;
vector <int> g[N + 5], g_t[N + 5];
vector <int> traversal;
vector <vector <int>> cc;
bool vis[N + 5];
void dfs(int u) {
vis[u] = true;
for(int v : g[u]) if(!vis[v])
dfs(v);
traversal.push_back(u);
}
void dfs2(int u) {
vis[u] = true;
for(int v : g_t[u]) if(!vis[v])
dfs2(v);
cc.back().push_back(u);
}
int main()
{
int n, m;
fin >> n >> m;
for(int i = 1, u, v; i <= m; i++)
fin >> u >> v,
g[u].push_back(v),
g_t[v].push_back(u);
for(int i = 1; i <= n; i++) if(!vis[i])
dfs(i);
reverse(traversal.begin(), traversal.end());
fill(vis, vis + n + 1, false);
for(int u : traversal) if(!vis[u]) {
cc.push_back({});
dfs2(u);
}
fout << cc.size() << "\n";
for(auto& comp : cc) {
for(int u : comp)
fout << u << " ";
fout << "\n";
}
return 0;
}