Pagini recente » Cod sursa (job #1672425) | Cod sursa (job #752885) | Cod sursa (job #542848) | Cod sursa (job #883543) | Cod sursa (job #1520278)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
vector<int>v[100001];
vector<int>vinv[100001];
vector<int>sol[100001];
int n,m,i,j,nr,nr11,x,y,a[100001],vz[100005];
bool viz[100001];
void dfs1(int nod)
{
viz[nod]=1;
for(int i=0;i<v[nod].size();i++)
if(viz[v[nod][i]]==0)
dfs1(v[nod][i]);
nr++;
a[nr]=nod;
}
void dfs2(int nod)
{
viz[nod]=0;
for(int i=0;i<vinv[nod].size();i++)
if(viz[vinv[nod][i]]==1)
dfs2(vinv[nod][i]);
sol[nr].push_back(nod);
vz[nod]=nr;
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
vinv[y].push_back(x);
}
for(i=1;i<=n;i++)
if(viz[i]==0)
dfs1(i);
nr=0;
for(i=n;i>=1;i--)
if(viz[a[i]]==1)
{
nr++;
dfs2(a[i]);
}
g<<nr<<"\n";
for(i=1;i<=nr;i++)
{
for(j=1;j<=n;j++)
if(vz[j]==i)
g<<j<<" ";
g<<"\n";
}
return 0;
}