Pagini recente » Cod sursa (job #225037) | Cod sursa (job #1998896) | Cod sursa (job #2145541) | Cod sursa (job #1353132) | Cod sursa (job #2066652)
#include <fstream>
#include <vector>
#include <bitset>
#define nmax 100005
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
vector <int> g[nmax];
vector <int> solutie[nmax];
vector <int> gr[nmax];
bitset <nmax> v;
int post[nmax];
int nn=0,cnt=0;
void dfs(int nod)
{
v[nod]=1;
for(int i=0;i<gr[nod].size();i++)
if(!v[gr[nod][i]])
dfs(gr[nod][i]);
post[++nn]=nod;
}
void dfsr(int nod)
{
v[nod]=0;
solutie[cnt].push_back(nod);
for(int i=0;i<g[nod].size();i++)
if(v[g[nod][i]])
dfsr(g[nod][i]);
}
int main()
{
int n,m,x,y;
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
g[x].push_back(y);
gr[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(!v[i])
{
dfs(i);
}
}
for(int i=n;i>=1;i--)
{
if(v[i])
{
cnt++;
dfsr(i);
}
}
fout<<cnt<<"\n";
for(int i=cnt;i>=1;i--)
{
for(int j=0;j<solutie[i].size();j++)
fout<<solutie[i][j]<<" ";
fout<<"\n";
}
return 0;
}