Pagini recente » Cod sursa (job #2716170) | Cod sursa (job #1717045) | Cod sursa (job #969643) | Cod sursa (job #1808139) | Cod sursa (job #2174385)
#include <fstream>
#include<bitset>
#include<stack>
#include<vector>
using namespace std;
ifstream f("ctc.in");
ofstream g("ctc.out");
int n,m,nrcomp,index,idx[100003],lowlink[100003];
vector<int>v[100003];
bool pe_stiva[100003];
stack<int> s;
vector<int>comp[100003];
void tarjan(int k)
{
int u;
s.push(k);
pe_stiva[k]=1;
idx[k]=index;
lowlink[k]=index;
index++;
vector<int>::iterator it;
for(it=v[k].begin();it!=v[k].end();++it)
{
u=*it;
if(idx[u]==0)
{
tarjan(u);
lowlink[k]=min(lowlink[k],lowlink[u]);
}
else if(pe_stiva[u])
{
lowlink[k]=min(lowlink[k],idx[u]);
}
}
if(lowlink[k]==idx[k])
{
nrcomp++;
u=s.top();
while(u!=k)
{
u=s.top();
s.pop();
pe_stiva[u]=0;
comp[nrcomp].push_back(u);
}
}
}
int main()
{
int i,x,y;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
}
index=1;
for(i=1;i<=n;i++)
if(idx[i]==0) tarjan(i);
vector<int>::iterator it;
g<<nrcomp<<'\n';
for(i=1;i<=nrcomp;i++)
{
for(it=comp[i].begin();it!=comp[i].end();++it) g<<*it<<' ';
g<<'\n';
}
}