Pagini recente » Cod sursa (job #2135635) | Cod sursa (job #3243815) | Cod sursa (job #1933098) | Cod sursa (job #313648) | Cod sursa (job #2421011)
#include <fstream>
#include <vector>
using namespace std;
vector <int> graph[100002],grapht[100002],sol[100002];
int coada[100002],pi,nr;
bool viz[100002];
void dfs(int nod)
{
sol[nr].push_back(nod);
viz[nod]=1;
for(int i=0;i<grapht[nod].size();++i)
if(!viz[grapht[nod][i]])
dfs(grapht[nod][i]);
}
void euler(int nod)
{
viz[nod]=1;
for(int i=0;i<graph[nod].size();++i)
if(!viz[graph[nod][i]])
euler(graph[nod][i]);
coada[++pi]=nod;
}
int main()
{
ifstream f("ctc.in");
ofstream g("ctc.out");
int n,m;
f>>n>>m;
int x,y;
for(int i=1;i<=m;++i)
{
f>>x>>y;
graph[x].push_back(y);
grapht[y].push_back(x);
}
for(int i=1;i<=n;++i)
if(!viz[i])
euler(i);
for(int i=1;i<=n;++i)
viz[i]=0;
for(int i=pi;i>=1;--i)
if(!viz[coada[i]])
++nr,dfs(coada[i]);
g<<nr<<"\n";
for(int i=1;i<=nr;++i,g<<"\n")
for(int j=0;j<sol[i].size();++j)
g<<sol[i][j]<<" ";
f.close();
g.close();
return 0;
}