Pagini recente » Cod sursa (job #1794492) | Cod sursa (job #459033) | Cod sursa (job #1692663) | Cod sursa (job #2276294) | Cod sursa (job #830734)
Cod sursa(job #830734)
#include <iostream>
#include <fstream>
#include <vector>
#define pb push_back
#define pB pop_back
using namespace std;
const int maxx=100005;
int n,m,a,b,i,val,viz[maxx],Sum;
vector <int> X[maxx],Xt[maxx],S,W[maxx];
bool used[maxx];
void read()
{
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
{
scanf("%d%d",&a,&b);
X[a].pb(b);
Xt[b].pb(a);
}
}
void df(int nod)
{
viz[nod]=1;
for(int i=0;i<X[nod].size();i++)
if(viz[X[nod][i]]==0)
df(X[nod][i]);
S.pb(nod);
}
void df2(int nod)
{
viz[nod]=val;
used[nod]=true;
for(int i=0;i<Xt[nod].size();i++)
if(used[Xt[nod][i]]==false)
df2(Xt[nod][i]);
Sum++;
}
void write()
{
printf("%d\n",val);
for(i=1;i<=n;i++)
W[viz[i]].pb(i);
for(i=1;i<=n;i++)
if(W[i].size())
{
for(int j=0;j<W[i].size();j++)
printf("%d ",W[i][j]);
printf("\n");
}
}
int main()
{
freopen("ctc.in","r",stdin);
freopen("ctc.out","w",stdout);
read();
for(i=1;i<=n;i++)
if(viz[i]==0)
df(i);
while(Sum!=n)
{
if(used[S.back()]==false)
{
val++;
df2(S.back());
}
S.pB();
}
write();
return 0;
}