Pagini recente » Cod sursa (job #2744053) | Cod sursa (job #1652072) | Cod sursa (job #1959415) | Monitorul de evaluare | Cod sursa (job #2187605)
#include <fstream>
#include <vector>
using namespace std;
ifstream f ("ctc.in");
ofstream g ("ctc.out");
const int nmax=1e5+3;
int n,m,a,b,viz[nmax],nr,p,st[nmax],k,act,va[nmax];
vector <int> v[nmax],vt[nmax],sol[nmax];
void dfs1(int nod)
{
viz[nod]=1;
for(int i=0;i<v[nod].size();++i)
{
if(viz[v[nod][i]]) continue;
dfs1(v[nod][i]);
}
st[++k]=nod;
}
void dfs2(int nod)
{
va[nod]=p;
for(int i=0;i<vt[nod].size();++i)
{
if(va[vt[nod][i]]) continue;
dfs2(vt[nod][i]);
}
sol[p].push_back(nod);
}
int main()
{
f>>n>>m;
while(m--)
{
f>>a>>b;
v[a].push_back(b);
vt[b].push_back(a);
}
for(int i=1;i<=n;++i)
{
++nr;
if(!viz[i]) dfs1(i);
}
for(int i=n;i>=1;--i)
{
if(va[st[i]]) continue;
++p;
act=viz[st[i]];
dfs2(st[i]);
}
g<<p<<'\n';
for(int i=1;i<=p;++i)
{
for(int j=0;j<sol[i].size();++j) g<<sol[i][j]<<' ';
g<<'\n';
}
return 0;
}