Pagini recente » Autentificare | Cod sursa (job #2436614) | Monitorul de evaluare | Cod sursa (job #386945) | Cod sursa (job #1883556)
#include <bits/stdc++.h>
#define nmax 100005
#define mmax 200001
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
int n,m;
vector <int> V[mmax],Vt[mmax],V1[mmax];
stack <int> S;
bool viz[nmax],vizT[nmax];
void read()
{int i,x,y;
f>>n>>m;
for(i=1;i<=m;i++)
{f>>x>>y;
V[x].push_back(y);
Vt[y].push_back(x);}
f.close();
}
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]);
S.push(x);
}
void dfsT(int x, int nr)
{int i;
vizT[x]=1;
for(i=0;i<Vt[x].size();i++)
if(vizT[Vt[x][i]]==0) dfsT(Vt[x][i],nr);
V1[nr].push_back(x);
}
void write()
{int i,j,x,nr=0;
for(i=1;i<=n;i++)
if(!viz[i]) dfs(i);
while(!S.empty())
{x=S.top(); S.pop();
if(!vizT[x]) {nr++;
dfsT(x,nr);}
}
g<<nr<<"\n";
for(i=1;i<=n;i++)
{for(j=0;j<V1[i].size();j++)
g<<V1[i][j]<<" ";
g<<"\n";
}
}
int main()
{read();
write();
return 0;
}