Pagini recente » Cod sursa (job #251743) | Cod sursa (job #2487051) | Cod sursa (job #2230591) | Cod sursa (job #1710054) | Cod sursa (job #2481033)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
const int Nmax = 100000;
vector<int> G[Nmax + 5];
vector<int> Gt[Nmax + 5];
int viz[Nmax + 5];
int n,m;
void DFS(int a,int k){
viz[a] = k;
for(int i = 0; i < G[a].size(); i++){
if(viz[G[a][i]] == 0){
DFS(G[a][i],k);
}
}
}
void DFSt(int a,int k){
viz[a] = k+1;
for(int i = 0; i < Gt[a].size(); i++){
if(viz[Gt[a][i]] == k){
DFSt(Gt[a][i],k);
}
}
}
int main()
{
int i,j,a1,a2,k = 1;
fin>>n>>m;
for(i = 1; i <= m; i++){
fin>>a1>>a2;
G[a1].push_back(a2);
Gt[a2].push_back(a1);
}
for(i = 1; i <= n; i++){
if(viz[i] == 0){
DFS(i,k);
DFSt(i,k);
k+=2;
for(j = 1; j <= n; j++){
if(viz[j]%2 == 1){
viz[j] = 0;
}
}
}
}
k = (k>>1);
fout<<k<<'\n';
for(i = 1; i <= k; i++){
for(j = 1; j <= n; j++){
if(viz[j] == i*2){
fout<<j<<" ";
}
}
fout<<'\n';
}
return 0;
}