Pagini recente » Cod sursa (job #453454) | Cod sursa (job #434752) | Cod sursa (job #88653) | Cod sursa (job #1693509) | Cod sursa (job #1688429)
#include <bits/stdc++.h>
#define NMax 100005
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
int n,m,comp,x,y,top;
int viz[NMax],viz2[NMax],s[NMax];
vector<int> c[NMax],GT[NMax],G[NMax];
void dfs(int nod){
viz[nod] = 1;
for(int i = 0; i < G[nod].size(); ++i){
if(!viz[G[nod][i]]){
dfs(G[nod][i]);
}
}
s[++top] = nod;
}
void dfst(int nod){
viz2[nod] = 1;
c[comp].push_back(nod);
for(int i = 0; i < GT[nod].size(); ++i){
if(!viz2[GT[nod][i]]){
dfst(GT[nod][i]);
}
}
}
int main()
{
f >> n >> m;
for(int i = 1; i <= m; ++i){
f >> x >> y;
G[x].push_back(y);
GT[y].push_back(x);
}
for(int i = 1; i <= n; ++i){
if(!viz[i]){
dfs(i);
}
}
for(int i = top; i >= 1; --i){
if(!viz2[s[i]]){
comp++;
dfst(s[i]);
}
}
g << comp << '\n';
for(int i = 1; i <= comp; ++i){
for(int j = 0; j < c[i].size(); ++j){
g << c[i][j] << ' ';
}
g << '\n';
}
return 0;
}