Pagini recente » Cod sursa (job #3236430) | Cod sursa (job #2405873) | Cod sursa (job #2327273) | Cod sursa (job #1830826) | Cod sursa (job #1916453)
#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
using namespace std;
ifstream fin("ctc.in");
ofstream fout("ctc.out");
vector<int> gf[100010], gt[100010], ans[100010];
deque<int> coada;
int n, m, x, y, nr, viz[100010], ctc[100010];
void DF1(int nod){
viz[nod] = 1;
for(int i = 0; i < gf[nod].size(); ++i){
int nxt = gf[nod][i];
if(viz[nxt] == 0){
DF1(nxt);
}
}
coada.push_front(nod);
}
void DF2(int nod){
ctc[nod] = nr;
for(int i = 0; i < gt[nod].size(); ++i){
int nxt = gt[nod][i];
if(ctc[nxt] == 0){
DF2(nxt);
}
}
ans[nr].push_back(nod);
}
int main()
{
fin >> n >> m;
for(int i = 1; i <= m; ++i){
fin >> x >> y;
gf[x].push_back(y);
gt[y].push_back(x);
}
for(int i = 1; i <= n; ++i){
if(viz[i] == 0){
DF1(i);
}
}
for(auto& it : coada){
if(ctc[it] == 0){
nr++;
DF2(it);
}
//cout << it << ' ' << ctc[it] << '\n';
}
fout << nr << '\n';
for(int i = 1; i <= nr; ++i){
for(auto& it : ans[i])
fout << it << ' ';
fout << '\n';
}
return 0;
}