Pagini recente » Cod sursa (job #419674) | Cod sursa (job #2673429) | Cod sursa (job #2928409) | Cod sursa (job #529988) | Cod sursa (job #2510271)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int low[100001],viz[100001],st[100001],vsol[100001],sol[100001];
bool stiva[100001];
vector <int> g[100001];
int n,m,k,ks;
void dfs(int nod,int niv)
{
viz[nod]=low[nod]=niv;
st[++k]=nod;stiva[nod]=1;
for(int i=0;i<g[nod].size();i++)
{
int v=g[nod][i];
if(viz[v]==0)
{
dfs(v,niv+1);
low[nod]=min(low[nod],low[v]);
}
else
low[nod]=min(low[nod],low[v]);
}
if(viz[nod]=low[nod])
{
sol[0]++;
while(st[k]!=nod)
{
vsol[++sol[sol[0]]]=st[k];
k--;
}
}
}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
g[x].push_back(y);
}
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
dfs(i,1);
}
fout<<sol[0]<<'\n';
for(int i=1;i<=sol[0];i++)
{
for(int j=1;j<=sol[i];j++)
fout<<vsol[j]<<' ';
fout<<'\n';
}
return 0;
}