Pagini recente » Cod sursa (job #1966720) | Borderou de evaluare (job #2367029) | Cod sursa (job #1622102) | Cod sursa (job #2367228) | Cod sursa (job #3196649)
#include <bits/stdc++.h>
#define NMAX 100010
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
int n,m,id[NMAX],low[NMAX],cc,i,j,x,y,timp,onstack[NMAX];
vector<int>v[NMAX],c[NMAX];
stack<int>s;
void dfs(int node)
{
id[node]=low[node]=++timp;
s.push(node);
onstack[node]=1;
for(auto it:v[node])
{
if(id[it]==0)
dfs(it);
if(onstack[it])
low[node]=min(low[node],low[it]);
}
if(id[node]==low[node])
{
cc++;
while(s.top()!=node)
{
c[cc].push_back(s.top());
onstack[s.top()]=0;
s.pop();
}
c[cc].push_back(node);
onstack[node]=0;
s.pop();
}
}
int main()
{
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
}
for(i=1;i<=n;i++)
if(id[i]==0)
dfs(i);
fout<<cc<<'\n';
for(i=1;i<=cc;i++)
{
for(auto it:c[i])
fout<<it<<" ";
fout<<'\n';
}
return 0;
}