Pagini recente » Cod sursa (job #1128913) | Cod sursa (job #1148189) | Cod sursa (job #2875217) | Cod sursa (job #1476536) | Cod sursa (job #2453299)
#include<fstream>
#include<stack>
#include<vector>
using namespace std;
ifstream cin("ctc.in");
ofstream cout("ctc.out");
int n,m,cnt;
int viz1[100005],viz2[100005];
vector<int> G[100005],GR[100005],rez[100005];
stack<int> S;
void postDFS(int nod){
viz1[nod]=1;
for(int i=0;i<G[nod].size();i++)
if(!viz1[G[nod][i]])
postDFS(G[nod][i]);
S.push(nod);
}
void preDFS(int nod){
rez[cnt].push_back(nod);
viz2[nod]=1;
for(int i=0;i<GR[nod].size();i++)
if(!viz2[GR[nod][i]])
preDFS(GR[nod][i]);
}
int main(){
cin>>n>>m;
for(int i=1;i<=m;i++){
int x,y;
cin>>x>>y;
G[x].push_back(y);
GR[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(!viz1[i])
postDFS(i);
while(!S.empty()){
int nod=S.top();
S.pop();
if(!viz2[nod]){
++cnt;
preDFS(nod);
}
}
cout<<cnt<<'\n';
for(int i=1;i<=cnt;i++,cout<<'\n')
for(int j=0;j<rez[i].size();j++,cout<<' ')
cout<<rez[i][j];/****/
}