Pagini recente » Cod sursa (job #899973) | Cod sursa (job #1837173) | Istoria paginii utilizator/dragositu23 | Istoria paginii utilizator/travisjusef | Cod sursa (job #1837760)
#include <fstream>
#include<vector>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
vector<int> a[100002],b[100002],c[100002],q;
bool v[100002];
int x[100002];
int n,m,nrt;
void cit(){
int i,j,h;
fin>>n>>m;
for(h=1;h<=m;h++){
fin>>i>>j;
a[i].push_back(j);
b[j].push_back(i);
}
fin.close();
}
void dfs1(int k){
int i;
v[k]=1;
for(i=0;i<a[k].size();i++)
if(v[a[k][i]]==0)
dfs1(a[k][i]);
q.push_back(k);
}
void dfs2(int k){
int i;
x[k]=nrt;
for(i=0;i<b[k].size();i++)
if(x[b[k][i]]==0)
dfs2(b[k][i]);
}
int main(){
cit();
int i,j;
for(i=1;i<=n;i++)
if(v[i]==0)
dfs1(i);
while(!q.empty()){
if(x[q.back()]==0){
nrt++;
dfs2(q.back());
q.pop_back();
}
q.pop_back();
}
for(i=1;i<=n;i++)
c[x[i]].push_back(i);
fout<<nrt<<'\n';
for(i=1;i<=nrt;i++){
for(j=0;j<c[i].size();j++)
fout<<c[i][j]<<" ";
fout<<'\n';
}
fout.close();
return 0;
}