Pagini recente » Cod sursa (job #893848) | Cod sursa (job #420099) | Cod sursa (job #2732154) | Cod sursa (job #290174) | Cod sursa (job #2174620)
# include <fstream>
# include <algorithm>
# include <vector>
# include <stack>
# define DIM 100010
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
stack<int> s;
vector<int> Lista[DIM],ctc[DIM];
int Marcat[DIM],poz[DIM],low[DIM],n,m,x,y,i,j,niv,nrctc;
void tarjan(int nc){
niv++;
poz[nc]=low[nc]=niv;
s.push(nc);
for(int i=0;i<Lista[nc].size();i++){
int nv=Lista[nc][i];
if(poz[nv]==0)
tarjan(nv);
if(Marcat[nv]==0)
low[nc]=min(low[nc],low[nv]);
}
if(low[nc]==poz[nc]){
nrctc++;
while(s.top()!=nc){
Marcat[s.top()]=nrctc;
ctc[nrctc].push_back(s.top());
s.pop();
}
Marcat[s.top()]=nrctc;
ctc[nrctc].push_back(s.top());
s.pop();
}
}
int main () {
fin>>n>>m;
for(i=1;i<=m;i++){
fin>>x>>y;
Lista[x].push_back(y);
}
for(i=1;i<=n;i++)
if(!poz[i])
tarjan(i);
fout<<nrctc<<"\n";
for(i=1;i<=nrctc;i++){
sort(ctc[i].begin(),ctc[i].end());
for(j=0;j<ctc[i].size();j++)
fout<<ctc[i][j]<<" ";
fout<<"\n";
}
return 0;
}