Pagini recente » Cod sursa (job #2759104) | Cod sursa (job #916710) | Cod sursa (job #2719270) | Cod sursa (job #556102) | Cod sursa (job #708732)
Cod sursa(job #708732)
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
const char InFile[]="ctc.in";
const char OutFile[]="ctc.out";
const int MaxN=100111;
ifstream fin(InFile);
ofstream fout(OutFile);
int N,M,x,y,viz[MaxN],low[MaxN],nrd[MaxN],nrdfs,ind;
vector<int> G[MaxN],c;
vector< vector<int> > C;
stack<int> S;
void DFS(int nod)
{
S.push(nod);
++ind;
nrd[nod]=nrdfs;
low[nod]=viz[nod]=ind;
for(vector<int>::iterator it=G[nod].begin();it!=G[nod].end();++it)
{
if(!viz[*it])
{
DFS(*it);
low[nod]=min(low[nod],low[*it]);
}
else if(nrd[*it]==nrdfs)
{
low[nod]=min(low[nod],low[*it]);
}
}
if(low[nod]==viz[nod])
{
c.clear();
while(1)
{
int x=S.top();
S.pop();
c.push_back(x);
if(x==nod)
{
break;
}
}
C.push_back(c);
}
}
int main()
{
fin>>N>>M;
for(register int i=1;i<=M;++i)
{
fin>>x>>y;
G[x].push_back(y);
}
fin.close();
for(register int i=1;i<=N;++i)
{
if(!viz[i])
{
++nrdfs;
DFS(i);
}
}
fout<<C.size()<<"\n";
for(vector< vector<int> >::iterator it=C.begin();it!=C.end();++it)
{
for(vector<int>::iterator it2=it->begin();it2!=it->end();++it2)
{
fout<<*it2<<" ";
}
fout<<"\n";
}
fout.close();
return 0;
}