Pagini recente » Cod sursa (job #135524) | Cod sursa (job #1682293) | Cod sursa (job #1733289) | Cod sursa (job #855217) | Cod sursa (job #2205579)
//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int s[100005],p[100005],n,m,nrc,ctc[100005],ss;
bool ok;
vector <int >v[100005],v2[100005],v3[100005];
ifstream in("ctc.in");
ofstream out("ctc.out");
void citire()
{
in>>n>>m;
for(int i=0;i<m;i++)
{
int x,y;
in>>x>>y;
v[x].push_back(y);
v3[y].push_back(x);
}
}
void dfs1(int x)
{
s[x]=1;
for(int i=0;i<v[x].size();i++)
{
int vecin=v[x][i];
if(s[vecin]==0)
dfs1(vecin);
}
}
void dfs2(int x)
{
p[x]=1;
for(int i=0;i<v3[x].size();i++)
{
int vecin=v3[x][i];
if(p[vecin]==0)
dfs2(vecin);
}
}
int main()
{
citire();
for(int i = 1 ; i <= n ; ++i)
if(ctc[i] == 0)
{
nrc ++;
dfs1(i); dfs2(i);
for(int j = 1; j <= n ; ++j)
if(s[j] == 1 && p[j] == 1)
{
ctc[j] = nrc;
v2[nrc].push_back(j);
ok=1;
}
if(i!=n)
for(int j = 1; j <= n ; ++j)
s[j] = p[j] = 0;
}
if(ok==1)
{
out<<nrc<<"\n";
for(int i=1;i<=nrc;i++)
{
for(int j=0;j<v2[i].size();j++)
out<<v2[i][j]<<" ";
out<<"\n";
}
}
else
out<<0;
return 0;
}