Pagini recente » Cod sursa (job #1929549) | Cod sursa (job #3281351) | test1241 | Cod sursa (job #1682346) | Cod sursa (job #1760282)
#include <fstream>
#include <vector>
using namespace std;
int n,m,i,x,y,postordine[100001],nr,t,j;
bool o[100001];
vector<int> G[100001],GT[100001],r[100001];
void DFS(int s)
{
int i,z=G[s].size();
o[s]=1;
for (i=0;i<z;i++)
if (!o[G[s][i]])
DFS(G[s][i]);
postordine[++nr]=s;
}
void DFST(int s)
{
int i,z=GT[s].size();
o[s]=0;
for (i=0;i<z;i++)
if (o[GT[s][i]])
DFST(GT[s][i]);
r[t].push_back(s);
}
int main()
{
ifstream fin("ctc.in");
ofstream fout ("ctc.out");
fin>>n>>m;
for (i=1;i<=m;i++)
{
fin>>x>>y;
G[x].push_back(y);
GT[y].push_back(x);
}
for (i=1;i<=n;i++)
if (!o[i]) DFS(i);
for (i=n;i>=1;i--)
if (o[postordine[i]])
{
t++;
DFST(postordine[i]);
}
fout<<t<<'\n';
for (i=1;i<=t;i++)
{
for (j=0;j<r[i].size();j++)
fout<<r[i][j]<<" ";
fout<<'\n';
}
fin.close();
fout.close();
return 0;
}