Pagini recente » Cod sursa (job #2348533) | Cod sursa (job #1437909) | Cod sursa (job #142934) | Cod sursa (job #2128792) | Cod sursa (job #1920257)
#include <iostream>
#include <fstream>
#include <vector>
#define N 100010
using namespace std;
ifstream f("ctc.in");
ofstream ge("ctc.out");
vector<int> g[N];
vector<int> gt[N];
vector<int> ans[N];
int s[N],i,j,n,m,k,t,p,r,nr=0,viz[N],viz1[N];
void dfs(int x)
{
viz[x]=1;
s[++s[0]]=x;
for(int i=0;i<g[x].size();i++)
{
if(viz[g[x][i]]==0)
{
dfs(g[x][i]);
}
}
}
void dfs1(int x)
{
viz1[x]=1;
ans[nr].push_back(x);
for(int i=0;i<gt[x].size();i++)
{
if(viz1[gt[x][i]]==0)
dfs1(gt[x][i]);
}
}
int main()
{
int x,y;
f>>n>>m;
while(m!=0)
{
f>>x>>y;
g[x].push_back(y);
gt[y].push_back(x);
m--;
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
dfs(i);
}
for(i=n;i>=1;i--)
{
if(viz1[s[i]]==0)
{
nr++;
dfs1(s[i]);
}
}
g<<nr<<"\n";
for(i=1;i<=nr;i++)
{
for(int j=ans[i].size()-1;j>=0;j--)
g<<ans[i][j]<<' ';
g<<"\n";
}
}