Pagini recente » Cod sursa (job #1555625) | Cod sursa (job #1933402) | Cod sursa (job #195240) | Cod sursa (job #2871034) | Cod sursa (job #2403785)
#include <fstream>
#include <vector>
#define Nmax 100005
using namespace std;
ifstream fin ("ctc.in");
ofstream fout ("ctc.out");
vector <int> v[Nmax];
vector <int> vt[Nmax];
vector <int> c[Nmax];
vector <int> nod;
bool viz[Nmax];
int n, m, i, j, k, x, y;
void dfs(int x)
{
int i;
viz[x]=1;
for(i=0;i<v[x].size();i++)
if(viz[v[x][i]]==0)
dfs(v[x][i]);
nod.push_back(x);
}
void dfs2(int x)
{
int i;
viz[x]=1;
for(i=0;i<vt[x].size();i++)
if(viz[vt[x][i]]==0)
dfs2(vt[x][i]);
c[k].push_back(x);
}
int main()
{
fin >> n >> m;
for(i=1;i<=m;i++)
{
fin >> x >> y;
v[x].push_back(y);
vt[y].push_back(x);
}
for(i=1;i<=n;i++)
if(viz[i]==0)
dfs(i);
for(i=1;i<=n;i++)
viz[i]=0;
for(i=n-1;i>=0;i--)
if(viz[nod[i]]==0)
{
k++;
dfs2(nod[i]);
}
fout << k << '\n';
for(i=1;i<=k;i++)
{
for(j=0;j<c[i].size();j++)
fout << c[i][j] << ' ';
fout << '\n';
}
return 0;
}