Pagini recente » Cod sursa (job #2545195) | Cod sursa (job #506981) | Cod sursa (job #2164378) | Cod sursa (job #2603086) | Cod sursa (job #2925793)
#include <fstream>
#include <string.h>
#include <vector>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int use[100001];
int st[100001];
vector <int> g[100001];
vector <int> gt[100001];
vector <int> ctc[100001];
int sol=0;
inline void dfs(int nod)
{
use[nod]=1;
for(int i=0;i<g[nod].size();++i)
if(!use[g[nod][i]]) dfs(g[nod][i]);
st[++st[0]]=nod;
}
inline void dfst(int nod)
{
use[nod]=1;
for(int i=0;i<gt[nod].size();++i)
if(!use[gt[nod][i]]) dfst(gt[nod][i]);
ctc[sol].push_back(nod);
}
int main()
{
int M,N,x,y;
fin>>N>>M;
for(int i=1;i<=M;++i)
{
fin>>x>>y;
g[x].push_back(y);
gt[y].push_back(x);
}
for(int i = 0; i <= sizeof(st)/sizeof(st[0]); i++)
st[i] = 0;
for(int i = 0; i <= sizeof(use)/sizeof(use[0]); i++)
use[i] = 0;
for(int i=1;i<=N;++i)
if(!use[i]) dfs(i);
for(int i = 0; i <= sizeof(use)/sizeof(use[0]); i++)
use[i] = 0;
for(int i=N;i>0;--i)
if(!use[st[i]])
{
++sol;
dfst(st[i]);
}
fout<<sol<<'\n';
for(int i=1;i<=sol;++i)
{
for(int j=0;j<ctc[i].size();++j)
fout<<ctc[i][j]<<" ";
fout<<"\n";
}
return 0;
}