Pagini recente » Cod sursa (job #2624925) | Cod sursa (job #1698680) | Cod sursa (job #637355) | Cod sursa (job #176018) | Cod sursa (job #2298478)
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <bitset>
using namespace std;
int n,m,nr,ix[100005],llk[100005],nrc;
vector<int>g[100005];
stack<int>s;
vector<int>ctc[100005];
bitset<100005>b;
void citire()
{
ifstream fin("ctc.in");
fin>>n>>m;
int x,y;
for(int i=0;i<m;i++)
{
fin>>x>>y;
g[x].push_back(y);
}
}
void stiva(int x)
{
while(!s.empty()&&s.top()!=x)
{
ctc[nr].push_back(s.top());
b[s.top()]=0;
s.pop();
}
if(!s.empty())
{
ctc[nr].push_back(s.top());
b[s.top()]=0;
s.pop();
}
nr++;
}
void dfs(int x)
{
ix[x]=++nrc;
llk[x]=nrc;
s.push(x);
b[x]=1;
for(auto &v:g[x])
if(!ix[v])
{
dfs(v);
llk[x]=min(llk[x],llk[v]);
}
else
if(b[v]==1)
llk[x]=min(llk[x],ix[v]);
if(ix[x]==llk[x])
stiva(x);
}
void afisare()
{
ofstream fout("ctc.out");
fout<<nr<<"\n";
for(int i=0;i<nr;i++)
{
for(auto &v:ctc[i])
fout<<v<<" ";
fout<<"\n";
}
}
int main()
{
citire();
for(int i=1;i<=n;i++)
if(!ix[i])
dfs(i);
afisare();
return 0;
}